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 9 of 9 for “"Parallel machine scheduling"”.
-
A Robust Reactive Scheduling System with Application to Parallel Machine Scheduling
<p>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 …
-
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 …
-
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 …
-
Quantitative Methods For Select Problems In Facility Location And Facility Logistics
… three logistics problems. The first problem is a parallel machine scheduling problems that considers multiple unique characteristics including release dates, due dates, limited machine availability and job splitting. The objective of is to minimize the total amount of time required to complete …
-
Algorithms for discrete, non-linear and robust optimization problems with applications in scheduling and service operations
… or ratio of two or more linear functions, parallel machine scheduling problems with the makespan objective, robust versions of weighted multi-objective optimization problems, and assortment optimization problems with logit choice models. For many of these problems, we give the first fully …
-
Optimization Models and Approximate Algorithms for the Aerial Refueling Scheduling and Rescheduling Problems
<p>The Aerial Refueling Scheduling Problem (ARSP) can be defined as determining the refueling completion times for fighter aircrafts (jobs) on multiple tankers (machines) to minimize the total weighted tardiness. ARSP can be modeled as a parallel machine scheduling with release times and due …
-
Multi-agent coordination for dynamic decentralised task allocation
… be found in operations research, and is known as scheduling jobs on unrelated parallel machines (also known as RjjCmax). In this thesis, we draw parallels between unrelated parallel machine scheduling and the computation distribution problem, and, in so doing, we present the spanning tree …
-
Machine learning and combinatorial methods for discrete optimization problems
… the most important problems in this field are parallel machine scheduling problems and network flow problems, which have attracted sustained research in operations research and computer science for over half a century. In this thesis, we develop and implement algorithms for variants of these …