Chapman and Hall/CRC
1,216 pages | 262 B/W Illus.
Researchers in management, industrial engineering, operations, and computer science have intensely studied scheduling for more than 50 years, resulting in an astounding body of knowledge in this field. Handbook of Scheduling: Algorithms, Models, and Performance Analysis, the first handbook on scheduling, provides full coverage of the most recent and advanced topics on the subject. It assembles researchers from all relevant disciplines in order to facilitate cross-fertilization and create new scheduling insights.
The book comprises six major parts, each of which breaks down into smaller chapters:
· Part I introduces materials and notation, with tutorials on complexity theory and algorithms for the minimization of makespan, total completion time, dual objectives, maximum lateness, the number of late jobs, and total tardiness.
· Part II is devoted to classical scheduling problems.
· Part III explores scheduling models that originate in computer science, operations research, and management science.
· Part IV examines scheduling problems that arise in real-time systems, focusing on meeting hard deadline constraints while maximizing machine utilization.
· Part V discusses stochastic scheduling and queueing networks, highlighting jobs that are not deterministic.
· Part VI covers applications, discussing scheduling problems in airline, process, and transportation industries, as well as in hospitals and educational institutions.
“More than 90 well-known authors in this area have made contributions to this handbook … . This handbook is certainly valuable for researchers that want to get an impression on recent research areas and also an overview on existing results. … [T]his handbook presents a huge volume of recent research in different scheduling areas, and certainly will stimulate further developments in many directions … .”
— Mathematical Reviews, Issue 2005d
“This is an absolutely excellent, rigorous, mathematical book, something that the scheduling literature has, until now, really lacked…consists of high quality contributions that embrace all the significant and hot topics of the field.”
Computing Reviews, 2005
Elimination Rules for Job-shop Scheduling Problem: Overview and Extensions, Jacques Carlier, Laurent Peridy, Eric Pinson, and David Rivreau
Approximation Algorithms for Minimizing Average Weighted Completion Time, Chandra Chekuri and Sanjeev Khanna
Scheduling with Resource Constraints—Continuous Resources, Joanna J´ozefowska and Jan Weglarz
A Categorization of Real-Time Multiprocessor Scheduling Problems and Algorithms, John Carpenter, Shelby Funk, Philip Holman, Anand Srinivasan, James Anderson, and Sanjoy Baruah
Approximation Algorithms for Scheduling Time-Critical Jobs on Multiprocessor System, Sudarshan K. Dhall
Scheduling Overloaded Real-Time Systems with Competitive/Worst Case Guarantees, Gilad Koren and Dennis Shasha
Minimizing TotalWeighted Error for Imprecise Computation Tasks and Related Problems, Joseph Y-T. Leung
Dual Criteria Optimization Problems for Imprecise Computation Tasks, Kevin I-J Ho
Periodic Reward-Based Scheduling and Its Application to Power-Aware Real-Time Systems, Hakan Aydin, Rami Melhem, and Daniel Mosse
Stochastic Scheduling and Queueing Networks
Offline Deterministic Scheduling, Stochastic Scheduling, and Online Deterministic Scheduling: A Comparative Overview, Michael Pinedo
Developments in Queueing Networks with Tractable Solutions, Xiuli Chao
Scheduling of Flexible Resources in Professional Service Firms, Yalcın Akcay, Anantaram Balakrishnan, and Susan H. Xu
Novel Metaheuristic Approaches to Nurse Rostering Problems in Belgian Hospitals, Edmund Kieran Burke, Patrick De Causmaecker and Greet Vanden Berghe
A Composite Very-Large-Scale Neighborhood Search Algorithm for the Vehicle Routing Problem, Richa Agarwal, Ravinder K. Ahuja, Gilbert Laporte, and Zuo-Jun “Max” Shen