Modeling and Solving Scheduling Problems in Practice
In Parts I and II a number of stylized and (supposedly) elegant mathematical models are discussed in detail. The deterministic models have led to a number of simple priority rules as well as to many algorithmic techniques and heuristic procedures. The stochastic models have provided some insight into the robustness of the priority rules. The results for the stochastic models have led to the conclusion that the more randomness there is in a system, the less advisable it is to use very sophisticated optimization techniques. Or, equivalently, the more randomness the system is subject to, the simpler the scheduling rules ought to be.
KeywordsSchedule Problem Cycle Time Setup Time Feasible Schedule Sequence Dependent Setup Time
Unable to display preview. Download preview PDF.