Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 281 for “"Makespan"”.

  1. Makespan Minimization in Re-entrant Permutation Flow Shops

    … shops before. The computational complexity of makespan minimization in re-entrant permutation flow shop problems requires heuristic solution approaches for large problem sizes. The problem provides promising structural properties for the application of a variable neighborhood search because of …

    qucosa-diss

  2. An analysis tableau and algorithm for flow-shop makespan minimization

    … concepts in developing a heuristic algorithm for makespan minimization. Computer implementation of this algorithm revealed promising results when compared with several state of-the-art heuristic algorithms. The tableau can be conceived as a three-dimensional matrix with the first two indices …

    vt Repository record for An analysis tableau and algorithm for flow-shop makespan minimization (opens in a new tab)

  3. Scheduling jobs on two uniform parallel machines to minimize the makespan

    The problem of scheduling n independent jobs on m uniform parallel machines such that the total completion time is minimized is a NP-Hard problem. We propose several heuristic-based online algorithms for machines with different speeds called Q2||Cmax. To show the efficiency of the proposed online …

    unlv Repository record for Scheduling jobs on two uniform parallel machines to minimize the makespan (opens in a new tab) Download PDF for Scheduling jobs on two uniform parallel machines to minimize the makespan (opens in a new tab)

  4. Approximations with Improving Error Bounds for Makespan Minimization in Batch Manufacturing

    … the manufacturing system in order to minimize makespan, or total time to complete processing of the jobs. We formulate this problem as a dynamic programming problem and illustrate the computational difficulty of solving this problem. We give a method for simulation of the system by representing …

    byu Repository record for Approximations with Improving Error Bounds for Makespan Minimization in Batch Manufacturing (opens in a new tab) Download PDF for Approximations with Improving Error Bounds for Makespan Minimization in Batch Manufacturing (opens in a new tab)

  5. Job shop scheduling to minimize makespan with explicit material handling considerations

    The efficient operation of a Flexible Manufacturing System (FMS) can be achieved by exploiting (i) Routing Flexibility and (ii) Scheduling Flexibility. Routing flexibility allows the selection of a machine on which an operation should be performed. Scheduling flexibility allows the determination of …

    uiuc Repository record for Job shop scheduling to minimize makespan with explicit material handling considerations (opens in a new tab)

  6. Fair allocation of operations and makespan minimization for multiple robotic agents

    … and efficient manner while also minimizing the makespan. We first present the Operation Trading Algorithm that generates allocations satisfying the DEQx (Duplicated Equitability up to any operation) fairness criterion while also guaranteeing an upper bound of 2 on the makespan for identical …

    uiuc Repository record for Fair allocation of operations and makespan minimization for multiple robotic agents (opens in a new tab)

  7. Tractability and approximability for subclasses of the makespan problem on unrelated parallel machines

    … ≤ i ≤ m and 1 ≤ j ≤ n. For a given schedule, the makespan is the completion time of a machine that finishes last. The goal is to produce a schedule of all n jobs with minimum makespan. This is known as the makespan problem on unrelated parallel machines (UPMs), denoted as R||C_{max}. In this …

    manitoba Repository record for Tractability and approximability for subclasses of the makespan problem on unrelated parallel machines (opens in a new tab)

  8. Approximation algorithms for makespan minimization: restricted assignments, interval uncertainties, and price of connectivity

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2026-02-19 without embargo terms

    uiuc Repository record for Approximation algorithms for makespan minimization: restricted assignments, interval uncertainties, and price of connectivity (opens in a new tab)

  9. Minimizing the makespan in a flexible flowshop with sequence dependent setup times, uniform machines, and limited buffers

    … research addresses the problem of minimizing the makespan in a flexible flowshop with sequence dependent setup times, uniform machines, and limited buffers. A mathematical model was developed to solve this problem. The problem is NP-Hard in the strong sense and only very small problems could be …

    wvu Repository record for Minimizing the makespan in a flexible flowshop with sequence dependent setup times, uniform machines, and limited buffers (opens in a new tab)

  10. A Deep Reinforcement Learning Approach with Prioritized Experience Replay and Importance Factor for Makespan Minimization in Manufacturing

    … scheduling optimization problem, max makespan minimization. In this application, tasks are scheduled to undergo processing in identical processing units (for instance, identical machines, machining centers, or cells). The optimization goal is to assign the jobs to be scheduled to units …

    lsu-thes Repository record for A Deep Reinforcement Learning Approach with Prioritized Experience Replay and Importance Factor for Makespan Minimization in Manufacturing (opens in a new tab)

Page 1 of 15