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.Carlier, J., Pinson, E., aAn Algorithm for Solving the Job-Shop Problemaquot;, Management Science 35, 164-176 (1989). Charlton ... Consilium Inc., Short- Interval Scheduling System Usera#39;s Manual, Internal Publication, Mountain View, CA (1988).
|Title||:||Decomposition Methods for Complex Factory Scheduling Problems|
|Author||:||Irfan M. Ovacik, Reha Uzsoy|
|Publisher||:||Springer Science & Business Media - 2012-12-06|