Decomposition Methods for Complex Factory Scheduling Problems

1. Front Matter

   Pages i-x

   PDF

2. Introduction

   • Irfan M. Ovacik, Reha Uzsoy

   Pages 1-14

3. Industrial Context and Motivation of Decomposition Methods

   • Irfan M. Ovacik, Reha Uzsoy

   Pages 15-29

4. Review of Decomposition Methods for Factory Scheduling Problems

   • Irfan M. Ovacik, Reha Uzsoy

   Pages 31-45

5. Modelling Interactions Between Subproblems: The Disjunctive Graph Representation and Extensions

   • Irfan M. Ovacik, Reha Uzsoy

   Pages 47-60

6. Workcenter-based Decomposition Procedures for the Classical Job Shop Environment

   • Irfan M. Ovacik, Reha Uzsoy

   Pages 61-90

7. A Generic Decomposition Procedure for Semiconductor Testing Facilities

   • Irfan M. Ovacik, Reha Uzsoy

   Pages 91-106

8. Time-Based Decomposition Procedures for Single-Machine Subproblems

   • Irfan M. Ovacik, Reha Uzsoy

   Pages 107-128

9. Time-Based Decomposition Procedures for Parallel Machine Subproblems with Sequence-Dependent Setup Times

   • Irfan M. Ovacik, Reha Uzsoy

   Pages 129-145

10. Naive Rolling Horizon Procedures for Job Shop Scheduling

    • Irfan M. Ovacik, Reha Uzsoy

    Pages 147-160

11. Tailored Decomposition Procedures for Semiconductor Testing Facilities

    • Irfan M. Ovacik, Reha Uzsoy

    Pages 161-173

12. Computational Results for Shops with Single and Parallel Machine Workcenters

    • Irfan M. Ovacik, Reha Uzsoy

    Pages 175-189

13. The Effects of Subproblem Solution Procedures and Control Structures

    • Irfan M. Ovacik, Reha Uzsoy

    Pages 191-201

14. Conclusions and Future Directions

    • Irfan M. Ovacik, Reha Uzsoy

    Pages 203-211

15. Back Matter

    Pages 213-215

    PDF

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.

• Manufacturing
• algorithm
• algorithms
• modeling
• production
• scheduling

• i2 Technologies, Irving, USA

  Irfan M. Ovacik

• School of Industrial Engineering, Purdue University, West Lafayette, USA

  Reha Uzsoy

Policies and ethics