Capacitated lot-sizing and scheduling with parallel machines, back-orders, and setup carry-over

Naval Research Logistics

Volumn 56, Issue 4, 2009, Pages 366-384

  Quadt, Daniel ^a   Kuhn, Heinrich ^a  

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

Author keywords

Back ordering; Lot sizing and scheduling; MIP model; Parallel machines; Setup carry over

Indexed keywords

BACK-ORDERING; LOT-SIZING AND SCHEDULING; MIP MODEL; PARALLEL MACHINES; SETUP CARRY-OVER;

HEURISTIC METHODS; PLASMA WAVES;

SCHEDULING;

EID: 67649794649     PISSN: 0894069X     EISSN: 15206750     Source Type: Journal    
DOI: 10.1002/nav.20345     Document Type: Article

References (58)

1. N. Absi and S. Kedad-Sidhoum, The multi-item capacitated lot-sizing problem with setup times and shortage costs, Eur J Oper Res 185 (2008), 1351-1374.
2. H.C. Bahl, L.P. Ritzman, and J.N.D. Gupta, Determining lot sizes and resource requirements: A review, Oper Res 35 (1987), 329-345.
3. P.J. Billington, J.O. McClain, and L.J. Thomas, Mathematical programming approaches to capacity-constrained MRP systems: Review, formulation and problem reduction, Management Sci 29 (1983), 1126-1141.
4. G.R. Bitran and H.H. Yanasse, Computational complexity of the capacitated lot size problem, Management Sci 28 (1982), 1174-1186.
5. F.F. Boctor and P. Poulin, Heuristics for n-product, m-stage, economic lot sizing and scheduling problem with dynamic demand, Int J Prod Res 43 (2005), 2809-2828.
6. N. Brahimi, S. Dauzere-Peres, and N. Najid, Capacitated multi-item lot-sizing problems with time windows, Oper Res 54 (2006), 951-967.
7. L. Buschkühl, F. Sahling, S. Helber, and H. Tempelmeier, Dynamic capacitated lotsizing problems-A classification and review of solution approaches, OR Spectrum (in press); DOI 10.1007/s00291-008-0150-7.
8. C.H. Cheng, M.S. Madan, Y. Gupta, and S. So, Solving the capacitated lot-sizing problem with backorder consideration, J Oper Res Soc 52 (2001), 952-959.
9. R. de Matta and M. Guignard, The performance of rolling production schedules in a process industry, IIE Trans 27 (1995), 564-573.
10. A. Drexl and A. Kimms, Lot sizing and scheduling-Survey and extensions, Eur J Oper Res 99 (1997), 221-235.
11. G.D. Eppen and R.K. Martin, Solving multi-item capacitated lot-sizing problems using variable redefinition, Oper Res 35 (1987), 832-848.
12. G. Fandel and C. Stammen-Hegen, Simultaneous lot sizing and scheduling for multi-product multi-level production, Int J Prod Economics 104 (2006), 308-316.
13. B. Fleischmann and H. Meyr, The general lotsizing and scheduling problem, OR Spektrum 19 (1997), 11-21.
14. M. Gopalakrishnan, K. Ding, J.-M. Bourjolly, and S. Mohan, A tabu-search heuristic for the capacitated lot-sizing problem with set-up carryover, Management Sci 47 (2001), 851- 863.
15. M. Gopalakrishnan, D. Miller, and C. Schmidt, A framework for modelling setup carryover in the capacitated lot sizing problem, Int J Prod Res 33 (1995), 1973-1988.
16. T. Grünert, Multi-level sequence-dependent dynamic lotsizing and scheduling, Shaker, Aachen, 1998.
17. D. Gupta and T. Magnusson, The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times, Comput Oper Res 32 (2005), 727-747.
18. K. Haase, Lotsizing and scheduling for production planning, Springer, Berlin, 1994.
19. K. Haase, Capacitated lot-sizing with sequence dependent setup costs, OR Spektrum 18 (1996), 51-59.
20. K. Haase, "Capacitated lot-sizing with linked production quantities of adjacent periods", Beyond manufacturing resource planning (MRP II)-Advanced models and methods for production planning, A. Drexl and A. Kimms (Editors), Springer, Berlin, 1998, pp. 127-146.
21. K. Haase and A. Kimms, Lot sizing and scheduling with sequence dependent setup costs and times and efficient rescheduling opportunities, Int J Prod Economics 66 (2000), 159-169.
22. A.C. Hax and D. Candea, Production and inventory management, Prentice Hall, Englewood Cliffs, NJ, 1984.
23. K.S. Hindi, Algorithms for capacitated, multi-item lot-sizing without set-ups, J Oper Res Soc 46 (1995), 465-472.
24. ILOG, ILOG OPL Studio 3.5: The optimization language, ILOG S.A., Paris, 2001.
25. R. Jans and Z. Degraeve, Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches, Eur J Oper Res 177 (2007), 1855-1875.
26. S. Kang, K. Malik, and L.J. Thomas, Lotsizing and scheduling on parallel machines with sequence-dependent setup costs, Management Sci 45 (1999), 273-289.
27. B. Karimi, S.M.T. Fathemi Ghomi, and J.M. Wilson, The capacitated lot sizing problem: A review of models and algorithms, Omega-Int J Management Sci 31 (2003), 365-378.
28. B. Karimi, S.M.T. Fathemi Ghomi, and J.M. Wilson, A tabu search heuristic for solving the CLSP with backlogging and set-up carry-over, J Oper Res Soc 57 (2006), 140-147.
29. E. Katok, H.S. Lewis, and T.P. Harrison, Lot sizing in general assembly systems with setup costs, setup times, and multiple constrained resources, Management Sci 44 (1998), 859-877.
30. R. Kuik, M. Salomon, and L.N. Van Wassenhove, Batching decisions: Structure and models, Eur J Oper Res 75 (1994), 243-263.
31. M. Laguna, A heuristic for production scheduling and inventory control in the presence of sequence-dependent setuptimes, IIE Trans 31 (1999), 125-134.
32. J. Maes, J.O. McClain, and L.N. Van Wassenhove, Multilevel capacitated lotsizing complexity and LP-based heuristics, Eur J Oper Res 53 (1991), 131-148.
33. J. Maes and L.N. Van Wassenhove, Multi-item single-level capacitated dynamic lot-sizing heuristics: A general review, J Oper Res Soc 39 (1988), 991-1004.
34. H. Meyr, Simultane Losgrößen- und Reihenfolgeplanung für kontinuierliche Produktionslinien-Modelle und Methoden im Rahmen des Supply Chain Management, Gabler, Wiesbaden, 1999.
35. H. Meyr, Simultaneous lotsizing and scheduling by combining local search with dual reoptimization, Eur J Oper Res 120 (2000), 311-326.
36. H. Meyr, Simultaneous lotsizing and scheduling on parallel machines, Eur J Oper Res 139 (2002), 277-292.
37. H.H. Millar andM.Yang,Anapplication of lagrangean decomposition to the capacitated multi-item lot sizing problem, Comput Oper Res 20 (1993), 409-420.
38. H.H. Millar and M. Yang, Lagrangian heuristics for the capacitated multi-item lot-sizing problem with backordering, Int J Prod Economics 34 (1994), 1-15.
39. A. Miller, G. Nemhauser, and M. Savelsbergh, On the polyhedral structure of a multi-item production planning model with setup times, Math Programming 94 (2003), 375-405.
40. L. Özdamar and G. Barbarosoglu, Hybrid heuristics for the multi-stage capacitated lot sizing and loading problem, J Oper Res Soc 50 (1999), 810-825.
41. R. Pitakaso, C. Almeder, K.F. Doerner, and R.F. Hartl, Combining exact and population-based methods for the constrained multilevel lot sizing problem, Int J Prod Res 44 (2006), 4755-4771.
42. Y. Pochet and L. Wolsey, Lot size models with back-logging: Strong reformulations and cutting planes, Math Programming 40 (1988), 317-335.
43. D. Quadt, Lot-sizing and scheduling for flexible flow lines, Lecture notes in economics and mathematical systems, Springer, Berlin, 2004.
44. D. Quadt and H. Kuhn, A conceptual framework for lot-sizing and scheduling of flexible flow lines, Int J Prod Res 43 (2005), 2291-2308.
45. D. Quadt and H. Kuhn, Batch scheduling of jobs with identical process times on flexible flow lines, Int J Prod Economics 105 (2007), 385-401.
46. D. Quadt and H. Kuhn, Capacitated lot-sizing with extensions: A review, 4OR: Q J Oper Res 6 (2008), 61-83.
47. F. Sahling, L. Buschkühl, S. Helber, and H. Tempelmeier, Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic, Comput Oper Res (in press); DOI 10.1016/j.cor.2008.10.009.
48. M. Sambasivan and S. Yahya, A lagrangean-based heuristic for multiplant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers, Comput Oper Res 32 (2005), 537-555.
49. C.R. Sox and Y. Gao, The capacitated lot sizing problem with setup carryover, IIE Trans 31 (1999), 173-181.
50. H. Stadtler, Mixed integer programming model formulations for dynamic multi-item multi-level capacitated lotsizing, Eur J Oper Res 94 (1996), 561-581.
51. H. Stadtler, Multilevel lot sizing with setup times and multiple constrained resources: Internally rolling schedules with lot-sizing windows, Oper Res 51 (2003), 487-502.
52. C. Sung and C.T. Maravelias, A mixed-integer programming formulation for the general capacitated lot-sizing problem, Comput Chem Eng 32 (2008), 244-259.
53. C. Sürie, Time continuity in discrete time models, Lecture notes in economics and mathematical systems, Springer, Berlin, 2005.
54. C. Sürie, Modeling of period overlapping setup times, Eur J Oper Res 174 (2006), 874-886.
55. C. Sürie and H. Stadtler, The capacitated lot-sizing problem with linked lot-sizes, Management Sci 49 (2003), 1039- 1054.
56. H. Tempelmeier and L. Buschkühl,Aheuristic for the dynamic multi-level capacitated lotsizing problem with linked lotsizes for general product structures, OR Spectrum (in press); DOI 10.1007/s00291-008-0130-y.
57. H. Tempelmeier and M. Derstroff, A lagrangean-based heuristic for dynamic multilevel multiitem constrained lotsizing with setup times, Management Sci 42 (1996), 738-757.
58. F.M.B. Toledo and V.A. Armentano, A lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines, Eur J Oper Res 175 (2006), 1070- 1083.