This book provides a theoretical and application-oriented analysis of deterministic scheduling problems in advanced planning and computer systems. The text examines scheduling problems across a range of parameters: job priority, release times, due dates, processing times, precedence constraints, resource usage and more, focusing on such topics as computer systems and supply chain management. Discussion includes single and parallel processors, flexible shops and manufacturing systems, and resource-constrained project scheduling. Many applications from industry and service operations management and case studies are described. The handbook will be useful to a broad audience, from researchers to practitioners, graduate and advanced undergraduate students.
Cited By
- Benmansour R, Braun O and Hanafi S (2019). The single-processor scheduling problem with time restrictions, Journal of Scheduling, 22:4, (465-471), Online publication date: 1-Aug-2019.
- Kress D, Müller D and Nossack J (2019). A worker constrained flexible job shop scheduling problem with sequence-dependent setup times, OR Spectrum, 41:1, (179-217), Online publication date: 1-Mar-2019.
- De Weerdt M, Albert M, Conitzer V and Van Der Linden K Complexity of scheduling charging in the smart grid Proceedings of the 27th International Joint Conference on Artificial Intelligence, (4736-4742)
- Kress D, Meiswinkel S and Pesch E (2018). Mechanism design for machine scheduling problems, OR Spectrum, 40:3, (583-611), Online publication date: 1-Jul-2018.
- Tasgetiren M, Kizilay D, Pan Q and Suganthan P (2017). Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion, Computers and Operations Research, 77:C, (111-126), Online publication date: 1-Jan-2017.
- Kis T (2015). Approximability of total weighted completion time with resource consuming jobs, Operations Research Letters, 43:6, (595-598), Online publication date: 1-Nov-2015.