part, Part I: Introduction -- chapter 1 Introduction and Notation -- chapter 2 A Tutorial on Complexity -- chapter 3 Some Basic Scheduling Algorithms -- part, Part II: Classical Scheduling Problems -- chapter 4 Elimination Rules for Job-Shop Scheduling Problem: Overview and Extensions -- chapter 5 Flexible Hybrid Flowshops -- chapter 6 Open Shop Scheduling -- chapter 7 Cycle Shop Scheduling -- chapter 8 Reducibility among Scheduling Classes -- chapter 9 Parallel Scheduling for Early Completion -- chapter 10 Minimizing the Maximum Lateness -- chapter 11 Approximation Algorithms for Minimizing Average Weighted Completion Time -- chapter 12 Minimzing the Number of Tardy Jobs -- chapter 13 Branch-and-Bound Algorithms for Total Weighted Tardiness -- chapter 14 Scheduling Equal Processing Time Jobs -- chapter 15 Online Scheduling -- chapter 16 Convex Quadratic Relaxations in Scheduling -- part, Part III: Other Scheduling Models -- chapter 17 The Master-Slave Scheduling Model -- chapter 18 Scheduling in Bluetooth Networks -- chapter 19 Fair Sequences -- chapter 20 Due Date Quotation Models and Algorithms -- chapter 21 Scheduling with Due Date Assignment -- chapter 22 Machine Scheduling with Availability Constraints -- chapter 23 Scheduling with Discrete Resource Constraints* -- chapter 24 Scheduling with Resource Constraints-Continuous Resources -- chapter 25 Scheduling Parallel Tasks - Algorithms and Complexity -- chapter 26 Scheduling Parallel Tasks Approximation Algorithms -- part, Part IV: Real-Time Scheduling -- chapter 27 The Pinwheel: A Real-Time Scheduling Problem -- chapter 28 Scheduling Real-Time Tasks: Algorithms and Complexity* -- chapter 29 Real-Time Synchronization Protocols -- chapter 30 A Categorization of Real-Time Multiprocessor Scheduling Problems and Algorithms -- chapter 31 Fair Scheduling of Real-Time Tasks on Multiprocessors -- chapter 32 Approximation Algorithms for Scheduling Time-Critical Jobs on Multiprocessor Systems -- chapter 33 Scheduling Overloaded Real-Time Systems with Competitive/ Worst-Case Guarantees -- chapter 34 Minimizing Total Weighted Error for Imprecise Computation Tasks and Related Problems -- chapter 35 Dual Criteria Optimization Problems for Imprecise Computation Tasks -- chapter 36 Periodic Reward-Based Scheduling and Its Application to Power-Aware Real-Time Systems -- chapter 37 Routing Real-Time Messages on Networks -- part, Part V: Stochastic Scheduling and Queueing Networks -- chapter 38 Offline Deterministic Scheduling, Stochastic Scheduling, and Online Deterministic Scheduling: A Comparative Overview -- chapter 39 Stochastic Scheduling with Earliness and Tardiness Penalties -- chapter 40 Developments in Queueing Networks with Tractable Solutions -- chapter 41 Scheduling in Secondary Storage Systems -- chapter 42 Selfish Routing on the Internet -- part, Part VI: Applications -- chapter 43 Scheduling of Flexible Resources in Professional Service Firms -- chapter 44 Novel Metaheuristic Approaches to Nurse Rostering Problems in Belgian Hospitals / chapter 45 University Timetabling -- chapter 46 Adapting the GATES Architecture to Scheduling Faculty -- chapter 47 Constraint Programming for Scheduling -- chapter 48 Batch Production Scheduling in the Process Industries / chapter 49 A Composite Very-Large-Scale Neighborhood Search Algorithm for the Vehicle Routing Problem / chapter 50 Scheduling Problems in the Airline Industry -- chapter 51 Bus and Train Driver Scheduling -- chapter 52 Sports Scheduling.