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

International Journal of Production Research

Volumn 43, Issue 11, 2005, Pages 2291-2308

  Quadt, D ^a   Kuhn, H ^a  

^a CATHOLIC UNIVERSITY OF EICHSTÄTT INGOLSTADT   (Germany)

Author keywords

Flexible flow lines; Lot sizing; Process industries; Production planning; Scheduling

Indexed keywords

DECISION MAKING; INVENTORY CONTROL; SCHEDULING; SEMICONDUCTOR DEVICES;

FLEXIBLE FLOW; SCHEDULING DECISIONS;

PRODUCTION ENGINEERING;

EID: 27944503347     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540500066762     Document Type: Article

References (33)

1. Azizoglu, M., Cakmak, E. and Kondakci, S., A flexible flowshop problem with total flow time minimization. Eur. J. Oper. Res., 2001, 132, 528-538.
2. Bitran, G.R. and Yanasse, H.H., Computational complexity of the capacitated lot size problem. Manag. Sci., 1982, 28, 1174-1186.
3. Brah, S.A. and Hunsucker, J.L., Branch and bound algorithm for the flow shop with multiple processors. Eur. J. Oper. Res., 1991, 51, 88-99.
4. Brah, S.A. and Loo, L.L., Heuristics for scheduling in a flow shop with multiple processors. Eur. J. Oper. Res. 1999, 113, 113-122.
5. Campbell, H.G., Dudek, R.A. and Smith, M.L., A heuristic algorithm for the n job, m machine sequencing problem. Manag. Sci. 1970, 16, B-630-B-637.
6. Derstroff, M.C., Mehrstufige Losgrößenplanung mit Kapazitätsbeschränkungen, 1995 (Heidelberg: Physica).
7. Drexl, A., Fleischmann, B., Günther, H.-O., Stadtler, H. and Tempelmeier, H., Konzeptionelle Grundlagen kapazitätsorientierter PPS-Systeme. Zeitschrift für betriebswirtschaftliche Forschung, 1994, 46, 1022-1045.
8. Drexl, A., and Kimms, A., Lot sizing and scheduling - Survey and extensions. Eur. J. Oper. Res. 1997, 99, 221-235.
9. Garey, M.R., Johnson, D.S., and Sethi, R., The complexity of flowshop and jobshop scheduling. Math. Oper. Res., 1976, 1, 117-129.
10. Guinet, A.G.P. and Solomon, M., Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time. Int. J. Prod. Res., 1996, 34, 1643-1654.
11. Gupta, J.N.D., Krüger, K., Lauff, V., Werner, F. and Sotskov, Y.N., Heuristics for hybrid flow shops with controllable processing times and assignable due dates. Comput. Oper. Res., 2002, 29, 1417-1439.
12. Haase, K., Capacitated lot-sizing with sequence dependent setup costs. OR Spektrum, 1996, 18, 51-59.
13. Haase, K. and Kimms, A., Lot sizing and scheduling with sequence dependent setup costs and times and efficient rescheduling opportunities. Int. J. Prod. Econ. 2000, 66, 159-169.
14. Hax, A.C. and Candea, D., Production and Inventory Management, 1984 (Englewood Cliffs, NJ: Prentice Hall).
15. Johnson, S.M., Optimal two- and three-stage production schedules with setup times included. Naval Res. Log. Q., 1954, 1, 61-68.
16. Kis, T. and Pesch, E., A review of exact solution methods for the non-preemptive multiprocessor flowshop problem. Eur. J. Oper. Res., 2005, 164, 592-608.
17. Kochhar, S. and Morris, R.J., Heuristic methods for flexible flow line scheduling. J. Manuf. Sys., 1987, 6, 299-314.
18. Kurz, M.E. and Askin, R.G., Comparing scheduling rules for flexible flow lines. Int. J. Prod. Econ., 2003a, 85, 371-388.
19. Kurz, M.E. and Askin, R.G., Scheduling flexible flow lines with sequence-dependent setup times. Working Paper, Clemson University, Clemson, SC, Eur. J. Oper. Res., 2004, 159, 66-82.
20. Nowicki, E. and Smutnicki, C., The flow shop with parallel machines: A tabu search approach. Eur. J. Oper. Res. 1998, 106, 226-253.
21. Özdamar, L. and Barbarosoglu, G., Hybrid heuristics for the multistage capacitated lot sizing and loading problem. J. Oper. Res. Soc., 1999, 50, 810-825.
22. Özdamar, L. and Birbil, S.I., Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions. Eur. J. Oper. Res., 1998, 110, 525-547.
23. Özdamar, L. and Bozyel, M.A., Simultaneous lot sizing and loading of product families on parallel facilities of different classes. Int. J. Prod. Res. 1998, 36, 1305-1324.
24. Portmann, M.-C., Vignier, A., Dardilhac, D. and Dezalay, D., Branch and bound crossed with GA to solve hybrid flowshops. Eur. J. Oper. Res., 1998, 107, 389-400.
25. Quadt, D., Lot-Sizing and Scheduling for Flexible Flow Lines, 2004 (Springer: Berlin).
26. Quadt, D. and Kuhn, H., Capacitated lot-sizing and scheduling with parallel machines, back-orders and setup carry-over. Working Paper, Ingolstadt School of Manag., Catholic University of Eichstätt-Ingolstadt, Ingolstadt, Germany submitted (2004a).
27. Quadt, D. and Kuhn, H., Capacitated lot-sizing with extensions: A review. Working Paper, Ingolstadt School of Manag., Catholic University of Eichstätt-Ingolstadt, Ingolstadt, Germany, submitted (2004b).
28. Quadt, D. and Kuhn, H., Batch scheduling of jobs with identical process times on flexible flow lines. Int. J. Prod. Econ., 2005 (In press).
29. Rajendran, C. and Chaudhuri, D., A multi-stage parallel-processor flowshop problem with minimum flowtime. Eur. J. Oper. Res., 1992, 57, 111-122.
30. Sawik, T., A scheduling algorithm for flexible flow lines with limited intermediate buffers. Appl. Stoch. Mod. Data Anal., 1993, 9, 127-138.
31. Tsubone, H., Suzuki, M., Uetake, T. and Ohba, M., A comparison between basic cyclic scheduling and variable cyclic scheduling in a twostage hybrid flow shop. Decision Sci., 2000, 31, 197-222.
32. Wardono, B. and Fathi, Y., A tabu search algorithm for the multistage parallel machine problem with limited buffer capacities. Eur. J. Oper. Res., 2004, 155, 380-409.
33. Wittrock, R.J., An adaptable scheduling algorithm for flexible flow lines. Oper. Res. 1988, 36, 445-453.