Decomposition Methods for Complex Factory Scheduling Problems

ISBN-13: 9780792398356 / Angielski / Twarda / 1996 / 215 str.

Irfan M. Ovacik; Reha Uzsoy

Opis

The factory scheduling problem, that of allocating machines to competing jobs in manufacturing facilities to optimize or at least improve system performance, is encountered in many different manufacturing environments. Given the competitive pressures faced by many companies in today's rapidly changing global markets, improved factory scheduling should contribute to a flrm's success. However, even though an extensive body of research on scheduling models has been in existence for at least the last three decades, most of the techniques currently in use in industry are relatively simplistic, and have not made use of this body of knowledge. In this book we describe a systematic, long-term research effort aimed at developing effective scheduling algorithms for complex manufacturing facilities. We focus on a speciflc industrial context, that of semiconductor manufacturing, and try to combine knowledge of the physical production system with the methods and results of scheduling research to develop effective approximate solution procedures for these problems. The class of methods we suggest, decomposition methods, constitute a broad family of heuristic approaches to large, NP-hard scheduling problems which can be applied in other environments in addition to those studied in this book.

Spis treści

Preface. 1. Introduction. 2. Industrial Context and Motivation for Decomposition Methods. 3. Review of Decomposition Methods for Factory Scheduling Problems. 4. Modelling Interactions Between Subproblems: The Disjunctive Graph Representation and Extensions. 5. Workcenter-Based Decomposition Procedures for the Classical Job Shop Environment. 6. A Generic Decomposition Procedure for Semiconductor Testing Facilities. 7. Time-Based Decomposition Procedures for Single-Machine Subproblems with Sequence-Dependent Setup Times. 8. Time-Based Decomposition Procedures for Parallel Machine Subproblems with Sequence-Dependent Setup Times. 9. Naive Rolling Horizon Procedures for Job Shop Scheduling. 10. Tailored Decomposition Procedures for Semiconductor Testing Facilities. 11. Computational Results for Job Shops with Single and Parallel Machine Workcenters. 12. The Effects of Subproblem Solution Procedures and Control Structures. 13. Conclusions and Future Directions. Author Index.