Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2012 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Pinedo, M.L. (2012). Modeling and Solving Scheduling Problems in Practice. In: Scheduling. Springer, Boston, MA. https://doi.org/10.1007/978-1-4614-2361-4_16
Download citation
DOI: https://doi.org/10.1007/978-1-4614-2361-4_16
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4614-1986-0
Online ISBN: 978-1-4614-2361-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)