Modeling and Solving Scheduling Problems in Practice

Michael L. Pinedo
Additional contact information
Michael L. Pinedo: NYU Stern School of Business, IOMS Dept Rm 8-59 KMC

Chapter Chapter 16 in Scheduling, 2016, pp 431-458 from Springer

Abstract: 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.

Keywords: Schedule Problem; Setup Time; Soft Constraint; Feasible Schedule; Sequence Dependent Setup Time (search for similar items in EconPapers)
Date: 2016
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-319-26580-3_16

Ordering information: This item can be ordered from
http://www.springer.com/9783319265803

DOI: 10.1007/978-3-319-26580-3_16

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().