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 30 for “"parallel machine scheduling"”.

  1. Parallel machine scheduling with time windows

    This dissertation addresses the problem of scheduling a set of jobs with multiple priorities on nonhomogeneous, parallel machines. The application of interest involves the tracking and data relay satellite system (TDRSS) run by the U.S. National Aeronautics and Space Administration. This system …

    texas Repository record for Parallel machine scheduling with time windows (opens in a new tab)

  2. Optimization of Large-Scale Single Machine and Parallel Machine Scheduling

    … products need to be scheduled on a single or parallel machine in a steel plant every week. A good feasible schedule may save the company millions of dollars compared to a bad one. Single and parallel machine scheduling are also encountered often in many other industries, making it a crucial …

    mcmaster Repository record for Optimization of Large-Scale Single Machine and Parallel Machine Scheduling (opens in a new tab)

  3. A Robust Reactive Scheduling System with Application to Parallel Machine Scheduling

    In this turbulent world, scheduling role has become crucial in most manufacturing production, and service systems. It allows the allocation of limited resources to activities with the objective of optimizing one performance measure or more. Resources may be machines in a factory, operating rooms in …

    odu Repository record for A Robust Reactive Scheduling System with Application to Parallel Machine Scheduling (opens in a new tab)

  4. Parallel Machine Scheduling in Manufacturing Systems: Impact of a Shared Resource and Multiple Stages

    … at two stages. Each stage consists of identical parallel machines. The processing time is assumed to include the setup time. This problem is also modeled as a mathematical program. Solution approaches and lower bounding procedures are discussed. I develop lower bounds and heuristic approaches and …

    uiuc Repository record for Parallel Machine Scheduling in Manufacturing Systems: Impact of a Shared Resource and Multiple Stages (opens in a new tab)

  5. Efficient Algorithms for Unrelated Parallel Machine Scheduling Considering Time of Use Pricing and Demand Charges

    … presents multiple solution methods to solve a parallel machine shop scheduling problem to minimize the total energy cost of the production schedule under Time of Use (TOU) and demand charge pricing. The greedy heuristic and genetic algorithm developed are designed to provide efficient solutions …

    rit Repository record for Efficient Algorithms for Unrelated Parallel Machine Scheduling Considering Time of Use Pricing and Demand Charges (opens in a new tab)

  6. Time indexed formulation of scheduling problems

    … be used in finding a lower bound for single and parallel machine scheduling problems. These approaches are based on integer programming formulations involving binary variables indexed by (i,t), where i denotes a job and t is a time period. For the single machine case, we provide an approximation …

    ubc Repository record for Time indexed formulation of scheduling problems (opens in a new tab) Download PDF for Time indexed formulation of scheduling problems (opens in a new tab)

  7. Data Driven Efficiency for E-Warehousing: Descriptive and Prescriptive Analytics

    … for both the warehouse management system and the parallel machine scheduling literature. We provide mathematical formulations for the problem and devise two solution methods. The first is a simulated annealing metaheuristic, while the second is an exact branch-and-price method. We test the …

    waterloo Repository record for Data Driven Efficiency for E-Warehousing: Descriptive and Prescriptive Analytics (opens in a new tab)

  8. SCHEDULING PROBLEM WITH DRYING REQUIREMENTS, MACHINE ELIGIBILITY RESTRICTIONS, SETUP TIMES, AND ASSEMBLY REQUIREMENTS FOR AN INJECTION MOLDING FACILITY

    <p>Previous research only focused on an unrelated parallel machine scheduling problem with setup and processing resources. However, some manufacturing environments, such as plastic injection molding, need different sequential and parallel processes before the facility can process jobs in the …

    utk-theses Repository record for SCHEDULING PROBLEM WITH DRYING REQUIREMENTS, MACHINE ELIGIBILITY RESTRICTIONS, SETUP TIMES, AND ASSEMBLY REQUIREMENTS FOR AN INJECTION MOLDING FACILITY (opens in a new tab)

  9. Development and Evaluation of Algorithms for Scheduling Two Unrelated Parallel Processors

    … possible? This thesis considers this unrelated parallel machine scheduling problem with the objective of minimizing the completion time of a group of tasks (the makespan) from the perspective of a local printed circuit board manufacturer. An analytical model representing the job dependent …

    maryland Repository record for Development and Evaluation of Algorithms for Scheduling Two Unrelated Parallel Processors (opens in a new tab)

  10. Resource assignment algorithms for vehicular clouds

    In this thesis, we study the task scheduling problem in vehicular clouds. It falls in the category of unrelated parallel machine scheduling problems. Resource assignment in vehicular clouds must deal with the transient nature of the cloud resources and a relaxed definition of non-preemptive tasks. …

    lethbridge Repository record for Resource assignment algorithms for vehicular clouds (opens in a new tab)

  11. New valid inequalities for a time-indexed formulation of the flexible job shop scheduling problem

    … originally formulated for single- and parallel machine scheduling problems are extended to a time-indexed, mixed integer linear programming formulation of the exible job shop scheduling problem. The model of the exible job shop scheduling problem that is used for this purpose was …

    chalmers Repository record for New valid inequalities for a time-indexed formulation of the flexible job shop scheduling problem (opens in a new tab)

  12. Towards power of preemption on parallel machines

    Classical scheduling models typically fall in either of two categories: those that allow interruption of the processing of jobs, and those that do not. In parallel machine environments, scheduling problems for models which allow parallel processing of jobs are typically easier to solve, in terms of …

    greenwich Download PDF for Towards power of preemption on parallel machines (opens in a new tab)

Page 1 of 2