Contents PREFACE 1 INTRODUCTION The Role of Scheduling The Scheduling Function in an Enterprise Outline of the Book 6

Transcription

1 Integre Technical Publishing Co., Inc. Pinedo July 9, :31 p.m. front page v PREFACE xi 1 INTRODUCTION The Role of Scheduling The Scheduling Function in an Enterprise Outline of the Book 6 Part 1 Deterministic Models 11 2 DETERMINISTIC MODELS: PRELIMINARIES Framework and Notation Examples Classes of Schedules Complexity Hierarchy 26 v

2 Integre Technical Publishing Co., Inc. Pinedo July 9, :31 p.m. front page vi vi 3 SINGLE MACHINE MODELS (DETERMINISTIC) The Total Weighted Completion Time The Maximum Lateness The Number of Tardy Jobs The Total Tardiness The Total Weighted Tardiness Discussion 57 4 MORE ADVANCED SINGLE MACHINE MODELS (DETERMINISTIC) The Total Tardiness: An Approximation Scheme The Total Earliness and Tardiness Primary and Secondary Objectives Multiple Objectives: A Parametric Analysis The Makespan with Sequence-Dependent Setup Times Discussion 88 5 PARALLEL MACHINE MODELS (DETERMINISTIC) The Makespan without Preemptions The Makespan with Preemptions The Total Completion Time without Preemptions The Total Completion Time with Preemptions Due Date-Related Objectives Discussion FLOW SHOPS AND FLEXIBLE FLOW SHOPS (DETERMINISTIC) Flow Shops with Unlimited Intermediate Storage Flow Shops with Limited Intermediate Storage Flexible Flow Shops with Unlimited Intermediate Storage JOB SHOPS (DETERMINISTIC) Disjunctive Programming and Branch and Bound The Shifting Bottleneck Heuristic and the Makespan The Shifting Bottleneck Heuristic and the Total Weighted Tardiness Discussion 181

3 Integre Technical Publishing Co., Inc. Pinedo July 9, :31 p.m. front page vii vii 8 OPEN SHOPS (DETERMINISTIC) The Makespan without Preemptions The Makespan with Preemptions The Maximum Lateness without Preemptions The Maximum Lateness with Preemptions The Number of Tardy Jobs Discussion 204 Part 2 Stochastic Models STOCHASTIC MODELS: PRELIMINARIES Framework and Notation Distributions and Classes of Distributions Stochastic Dominance Impact of Randomness on Fixed Schedules Classes of Policies SINGLE MACHINE MODELS (STOCHASTIC) Arbitrary Distributions without Preemptions Arbitrary Distributions with Preemptions: The Gittins Index Likelihood Ratio Ordered Distributions Exponential Distributions SINGLE MACHINE MODELS WITH RELEASE DATES (STOCHASTIC) Arbitrary Releases and Arbitrary Processing Times Priority Queues, Work Conservation, and Poisson Releases Arbitrary Releases and Exponential Processing Times Poisson Releases and Arbitrary Processing Times Discussion PARALLEL MACHINE MODELS (STOCHASTIC) The Makespan without Preemptions The Makespan and Total Completion Time with Preemptions Due Date-Related Objectives 302

4 Integre Technical Publishing Co., Inc. Pinedo July 9, :31 p.m. front page viii viii 13 FLOW SHOPS, JOB SHOPS, AND OPEN SHOPS (STOCHASTIC) Stochastic Flow Shops with Unlimited Intermediate Storage Stochastic Flow Shops with Blocking Stochastic Job Shops Stochastic Open Shops 322 Part 3 Scheduling in Practice GENERAL PURPOSE PROCEDURES FOR SCHEDULING IN PRACTICE Dispatching Rules Composite Dispatching Rules Filtered Beam Search Local Search: Simulated Annealing and Tabu-Search Local Search: Genetic Algorithms Discussion MORE ADVANCED GENERAL PURPOSE PROCEDURES Decomposition Methods and Rolling Horizon Procedures Constraint Guided Heuristic Search Market-Based and Agent-Based Procedures Procedures for Scheduling Problems with Multiple Objectives Discussion MODELING AND SOLVING SCHEDULING PROBLEMS IN PRACTICE Scheduling Problems in Practice Cyclic Scheduling of a Flow Line Flexible Flow Line with Limited Buffers and Bypass Flexible Flow Line with Unlimited Buffers and Setups Bank of Parallel Machines with Release Dates and Due Dates Discussion DESIGN, DEVELOPMENT, AND IMPLEMENTATION OF SCHEDULING SYSTEMS Systems Architecture Databases and Knowledge-Bases Schedule Generation Issues 426

5 Integre Technical Publishing Co., Inc. Pinedo July 9, :31 p.m. front page ix ix 17.4 User Interfaces and Interactive Optimization Generic Systems Versus Application-Specific Systems Implementation and Maintenance Issues ADVANCED CONCEPTS IN SCHEDULING SYSTEM DESIGN Robustness and Reactive Scheduling Machine Learning Mechanisms Design of Scheduling Engines and Algorithm Libraries Reconfigurable Systems Scheduling Systems on the Internet Discussion EXAMPLES OF SYSTEM DESIGNS AND IMPLEMENTATIONS The SAP APO System IBM s Independent Agents Architecture i2 s TradeMatrix Production Scheduler An Implementation of Cybertec s Cyberplan Synquest s Virtual Production Engine The LEKIN System for Research and Teaching Discussion WHAT LIES AHEAD? Theoretical Research Applied Research Systems Development and Integration 507 Part 4 Appendixes 511 A B MATHEMATICAL PROGRAMMING: FORMULATIONS AND APPLICATIONS 513 A.1 Linear Programming Formulations 513 A.2 Integer Programming Formulations 518 A.3 Disjunctive Programming Formulations 522 DETERMINISTIC AND STOCHASTIC DYNAMIC PROGRAMMING 525 B.1 Deterministic Dynamic Programming 525 B.2 Stochastic Dynamic Programming 529

6 Integre Technical Publishing Co., Inc. Pinedo July 9, :31 p.m. front page x x C COMPLEXITY THEORY 533 C.1 Preliminaries 533 C.2 Polynomial Time Solutions Versus NP-Hardness 536 C.3 Examples 539 D COMPLEXITY CLASSIFICATION OF DETERMINISTIC SCHEDULING PROBLEMS 543 E OVERVIEW OF STOCHASTIC SCHEDULING PROBLEMS 547 F SELECTED SCHEDULING SYSTEMS 551 REFERENCES 555 INDEX 583