Conceptual framework for lot-sizing and scheduling of flexible flow lines

The paper considers the lot-sizing and scheduling problem for flexible flow line production facilities. Flexible flow lines are flow lines with parallel machines on some or all production stages. The objective is to find lot-sizes and a feasible schedule that minimizes set-up, inventory holding and back-order costs. Minimization of mean flow time (measured between entering the first stage and leaving the last) is a secondary objective. An integrative solution approach is presented that can incorporate the interdependencies between lot-sizing and scheduling decisions. Applications of the approach in the semiconductor industry are illustrated.

[1]  Daniel Quadt,et al.  Lot-Sizing and Scheduling for Flexible Flow Lines , 2004 .

[2]  R. A. Dudek,et al.  A Heuristic Algorithm for the n Job, m Machine Sequencing Problem , 1970 .

[3]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[4]  Suna Kondakci Köksalan,et al.  A flexible flowshop problem with total flow time minimization , 2001, Eur. J. Oper. Res..

[5]  Eugeniusz Nowicki,et al.  The flow shop with parallel machines: A tabu search approach , 1998, Eur. J. Oper. Res..

[6]  Robert J. Wittrock,et al.  An Adaptable Scheduling Algorithm for Flexible Flow Lines , 1988, Oper. Res..

[7]  Masaaki Ohba,et al.  A Comparison between Basic Cyclic Scheduling and Variable Cyclic Scheduling in a Two-stage Hybrid Flow Shop , 2000, Decis. Sci..

[8]  Robert J. T. Morris,et al.  Heuristic methods for flexible flow line scheduling , 1987 .

[9]  J. Hunsucker,et al.  BRANCH AND BOUND ALGORITHM FOR THE FLOW SHOP WITH MULTIPLE PROCESSORS , 1991 .

[10]  B. Fleischmann,et al.  Konzeptionelle Grundlagen kapazitätsorientierter PPS-Systeme , 1993 .

[11]  Tadeusz Sawik,et al.  A scheduling algorithm for flexible flow lines with limited intermediate buffers , 1993 .

[12]  Linet Özdamar,et al.  Simultaneous lot sizing and loading of product families on parallel facilities of different classes , 1998 .

[13]  G. Bitran,et al.  Computational Complexity of the Capacitated Lot Size Problem , 1982 .

[14]  M. Solomon,et al.  Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time , 1996 .

[15]  Knut Haase,et al.  Capacitated lot-sizing with sequence dependent setup costs , 1996 .

[16]  Yahya Fathi,et al.  Abstract Discrete Optimization , 2000 .

[17]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[18]  L Özdamar,et al.  Hybrid heuristics for the multi-stage capacitated lot sizing and loading problem , 1999, J. Oper. Res. Soc..

[19]  Linet Özdamar,et al.  Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions , 1998, Eur. J. Oper. Res..

[20]  Jatinder N. D. Gupta,et al.  Heuristics for hybrid flow shops with controllable processing times and assignable due dates , 2002, Comput. Oper. Res..

[21]  D. Chaudhuri,et al.  A multi-stage parallel-processor flowshop problem with minimum flowtime , 1992 .

[22]  Shaukat A. Brah,et al.  Heuristics for scheduling in a flow shop with multiple processors , 1999, Eur. J. Oper. Res..

[23]  Alf Kimms,et al.  Lot Sizing and Scheduling with Sequence Dependent Setup Costs and Times and Efficient Rescheduling O , 2000 .

[24]  Ronald G. Askin,et al.  Comparing scheduling rules for flexible flow lines , 2003 .

[25]  Tamás Kis,et al.  A review of exact solution methods for the non-preemptive multiprocessor flowshop problem , 2005, Eur. J. Oper. Res..

[26]  Arnoldo C. Hax,et al.  Production and inventory management , 1983 .

[27]  Daniel Quadt,et al.  Batch scheduling of jobs with identical process times on flexible flow lines , 2007 .

[28]  Ronald G. Askin,et al.  Scheduling flexible flow lines with sequence-dependent setup times , 2004, Eur. J. Oper. Res..

[29]  Alf Kimms,et al.  Lot sizing and scheduling -- Survey and extensions , 1997 .

[30]  Matthias Carl Derstroff Mehrstufige Losgrößenplanung mit Kapazitätsbeschränkungen , 1995 .

[31]  Marie-Claude Portmann,et al.  Branch and bound crossed with GA to solve hybrid flowshops , 1998, Eur. J. Oper. Res..