Lot sizing and scheduling - Survey and extensions

European Journal of Operational Research

Volumn 99, Issue 2, 1997, Pages 221-235

  Drexl, A ^a   Kimms, A ^a  

^a UNIVERSITY OF KIEL   (Germany)

Author keywords

Batching and scheduling problem; Capacitated lot sizing problem; Continuous setup lot sizing problem; Discrete lot sizing and scheduling problem; Lot sizing; Production planning; Proportional lot sizing and scheduling problem; Scheduling

Indexed keywords

MATHEMATICAL MODELS; MATHEMATICAL PROGRAMMING; OPERATIONS RESEARCH; SCHEDULING; STRATEGIC PLANNING;

LOT SIZING;

PRODUCTION CONTROL;

EID: 0031170482     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(97)00030-1     Document Type: Article

References (119)

1. Aggarwal, A., Park, J.K., Improved algorithms for economic lot-size problems. Operations Research 41 (1993) 549-571.
2. Ahmadi, R.H., Dasu, S., Tang, C., The dynamic line allocation problem, Management Science 38 (1992) 1341-1353.
3. Andler, K., Rationalisierung der Fabrikation und Optimale Losgrösse, Oldenbourg, München, 1929.
4. Arkin, E., Joneja, D., Roundy, R., Computational complexity of uncapacitated multi-echelon production planning problems, Operations Research Letters 8 (1989) 61-66.
5. Atkins, D.R., A simple lower bound to the dynamic assembly problem, European Journal of Operational Research 75 (1994) 462-466.
6. Bahl, H.C., Ritzman, L.P., Gupta, J.N.D., Determining lot sizes and resource requirements: a review, Operations Research 35 (1987) 329-345.
7. Barany, I., van Roy, T.J., Wolsey, L.A., Strong formulations for multi-item capacitated lotsizing, Management Science 30 (1984) 1255-1261.
8. Bitran, G.R., Matsuo, H., Approximation formulations for the single-product capacitated lot size problem. Operations Research 34 (1986) 63-74.
9. Bitran, G.R., Yanasse, H.H., Computational complexity of the capacitated lot size problem, Management Science 28 (1982) 1174-1186.
10. Blazewicz, J., Domschke, W., Pesch, E., The job shop scheduling problem: conventional and new solution techniques, European Journal of Operational Research 93 (1996) 1-33.
11. Brucker, P., Scheduling Algorithms, Springer, Berlin, 1995.
12. Brüggemann, W., Ausgewählte Probleme der Produktions-planung - Modellierung, Komplexität und Neuere Lösungsmöglichkeiten, Physica-Schriften zur Betriebswirtschaft, vol. 52, Physica, Heidelberg, 1995.
13. Brüggemann, W., Jahnke, H., DLSP for 2-stage multi-item batch production, International Journal of Production Research 32 (1994) 755-768.
14. Campbell, G.M., Using short-term dedication for scheduling multiple products on parallel machines, Production and Operations Management 1 (1992) 295-307.
15. Carreno, J.J., Economic lot scheduling for multiple products on parallel identical processors, Management Science 36 (1990) 348-358.
16. Cattrysse, D., Macs, J., Set partitioning and column generation heuristics for capacitated dynamic lotsizing, European Journal of Operational Research 46 (1990) 38-47.
17. Cattrysse, D., Salomon, M., Kuik, R., van Wassenhove, L.N., A dual ascent and column generation heuristic for the discrete lotsizing and scheduling problem with setup-times, Management Science 39 (1993) 477-486.
18. Chand, S., Morton, T.E., Proth, J.M., Existence of forecast horizons in undiscounted discrete-time lot size models, Operations Research 38 (1990) 884-892.
19. Chandra, P., Fisher, M.L., Coordination of production and distribution planning, European Journal of Operational Research 72 (1994) 503-517.
20. Chen, H.D., Hearn, D.W., Lee, C.Y., Minimizing the error bound for the dynamic lot size model, Operations Research Letters 17 (1995) 57-68.
21. Chen, W.H., Thizy, J.M., Analysis of relaxations for the multi-item capacitated lot-sizing problem, Annals of Operations Research 26 (1990) 29-72.
22. Choo, E.U., Chan, G.H., Two-way eyeballing heuristics in dynamic lot sizing with backlogging, Computers & Operations Research 17 (1990) 359-363.
23. Coleman, B.J., McKnew, M.A., An improved heuristic for multilevel lot sizing in material requirements planning, Decision Sciences 22 (1991) 136-156.
24. Dauzère-Péres, S., Lasserre, J.B., Integration of lotsizing and scheduling decisions in a job-shop, European Journal of Operational Research 75 (1994) 413-426.
25. Dauzère-Péres, S., Lasserre, J.B., An Integrated Approach in Production Planning and Scheduling, Lecture Notes in Economics and Mathematical Systems, vol. 411, Springer, Berlin, 1994.
26. DeBoth, M.A., Gelders, L.F., van Wassenhove, L.N., Lot sizing under dynamic demand conditions: a review, Engineering Costs and Production Economics 8 (1984) 165-187.
27. Denardo, E.V., Lee, C.Y., Error bound for the dynamic lot size model with backlogging, Annals of Operations Research 2 (1991) 213-228.
28. Diaby, M., Bahl, H.C., Karwan, M.H., Zionts, S., A Lagrangean relaxation approach for very-large-scale capacitated lot-sizing, Management Science 38 (1992) 1329-1340.
29. Diaby, M., Bahl, H.C., Karwan, M.H., Zionts, S., Capacitated lot-sizing and scheduling by Lagrangean relaxation, European Journal of Operational Research 59 (1992) 444-458.
30. Dilts, D.M., Ramsing, K.D., Joint lot sizing and scheduling of multiple items with sequence dependent setup costs, Decision Sciences 20 (1989) 120-133.
31. Dobson, G., The economic lot scheduling problem: achieving feasibility using time varying lot sizes, Operations Research 35 (1987) 764-771.
32. Dobson, G., The cyclic lot scheduling problem with sequence-dependent setups, Operations Research 40 (1992) 736-749.
33. Drexl, A., Haase, K., Proportional lotsizing and scheduling, International Journal of Production Economics 40 (1995) 73-87.
34. Drexl, A., Haase, K., Sequential-analysis based randomized-regret-methods for lot-sizing and scheduling, Journal of the Operational Research Society 47 (1996) 251-265.
35. Elmaghraby, S.E., The economic lot scheduling problem (ELSP): review and extensions, Management Science 24 (1978) 587-598.
36. Eppen, G.D., Martin, R.K., Solving multi-item capacitated lot-sizing problems using variable redefinition, Operations Research 35 (1987) 832-848.
37. [371 Erlenkotter, D., Ford Whitman Harris and the economic order quantity model, Operations Research 38 (1990) 937-946.
38. Federgruen, A., Tzur, M., A simple forward algorithm to solve general dynamic lot sizing models with n periods in O(n log n) or O(n) time, Management Science 37 (1991) 909-925.
39. [39[ Federgruen, A., Tzur, M., The dynamic lot-sizing model with backlogging: a simple O(n log n) algorithm and minimal forecast horizon procedure, Naval Research Logistics 40 (1993) 459-478.
40. Federgruen, A., Tzur, M., Minimal forecast horizons and a new planning procedure for the general dynamic lot sizing model: nervousness revisited, Operations Research 42 (1994) 456-468.
41. Federgruen, A., Tzur, M., Fast solution and detection of minimal forecast horizons in dynamic programs with a single indicator of the future: applications to dynamic lot-sizing models, Management Science 41 (1995) 874-893.
42. Fleischmann, B., The discrete lot-sizing and scheduling problem, European Journal of Operational Research 44 (1990) 337-348.
43. Fleischmann, B., The discrete lot-sizing and scheduling problem with sequence-dependent setup costs, European Journal of Operational Research 75 (1994) 395-404.
44. Fleischmann, B., Meyr, H., The general lot-sizing and scheduling problem, Working Paper, University of Augsburg, 1996; OR Spektrum, to appear.
45. Florian, M., Lenstra, J.K., Rinnooy Kan, A.H.G., Deterministic production planning: algorithms and complexity, Management Science 26 (1980) 669-679.
46. Gallego, G., Joneja, D., Economic lot scheduling problem with raw material considerations, Operations Research 42 (1994) 92-101.
47. Gelders, L.F., Maes, J., van Wassenhove, L.N., A branch and bound algorithm for the multi-item single level capacitated dynamic lotsizing problem, in: Axsäter, S., Schneeweiss, C., Silver, E. (Eds.), Multi-Stage Production Planning and Inventory Control, Lecture Notes in Economics and Mathematical Systems, vol. 266, Springer, Berlin, 1986, pp. 92-108.
48. Gorenstein, S., Planning tire production, Management Science B 17 (1970) 72-82.
49. Gupta, S.M., Brennan, L., Lot sizing and backordering in multi-level product structures, Production and Inventory Management Journal 33 (1) (1992) 27-35.
50. Haase, K., Capacitated lot-sizing with linked production quantities of adjacent periods, Working Paper No. 334, University of Kiel, 1993.
51. Haase, K., Lotsizing and Scheduling for Production Planning, Lecture Notes in Economics and Mathematical Systems, vol. 408, Springer, Berlin, 1994.
52. Haase, K., Capacitated lot-sizing with sequence dependent setup costs, OR Spektrum 18 (1996) 51-59.
53. Haase, K., Kimms, A., Lot sizing and scheduling with sequence dependent setup costs and times and efficient rescheduling opportunities, Working Paper No. 393, University of Kiel, 1996.
54. Harris, F.W., How many parts to make at once, Operations Research 38 (1990) 947-950 (reprint from Factory - The Magazine of Management 10 (1913) 135-136, 152).
55. Harris, F.W., How many parts to make at once, Operations Research 38 (1990) 947-950 (reprint from Factory - The Magazine of Management 10 (1913) 135-136, 152).
56. Helber, S., Kapazitätsorientierte Losgrößenplanung in PPS-Systemen, M & P, Stuttgart, 1994.
57. Helber, S., Lot sizing in capacitated production planning and control systems, OR Spektrum 17 (1995) 5-18.
58. Hindi, K.S., Solving the CLSP by a Tabu Search heuristic, Journal of the Operational Research Society 47 (1996) 151-161.
59. van Hoesel, S., Kolen, A., A linear description of the discrete lot-sizing and scheduling problem, European Journal of Operational Research 75 (1994) 342-353.
60. Hsieh, H., Lam, K.F., Choo, E.U., Comparative study of dynamic lot sizing heuristics with backlogging, Computers & Operations Research 19 (1992) 393-407.
61. Hsu, W.L., On the general feasibility test of scheduling lot sizes for several products on one machine, Management Science 29 (1983) 93-105.
62. Joneja, D., Multi-echelon assembly systems with non-stationary demands: heuristics and worst case performance bounds, Operations Research 39 (1991) 512-518.
63. Jordan, C., Batching and Scheduling - Models and Methods for Several Problem Classes, Lecture Notes in Economics and Mathematical Systems, vol. 437, Springer, Berlin, 1996.
64. Jordan, C., Drexl, A., Discrete lotsizing and scheduling by batch sequencing, Working Paper No. 343 (revised version), University of Kiel, 1994; Management Science, to appear.
65. Jordan, C., Drexl, A., A comparison of constraint and mixed-integer programming solvers for batch sequencing with sequence-dependent setups, ORSA Journal on Computing 7 (1995) 160-165.
66. Kang, S., Malik, K., Thomas, L.J., Lotsizing and scheduling on parallel machines with sequence-dependent setup costs, Working Paper No. 94-06, Cornell University, 1994.
67. Karmarkar, U.S., Kekre, S., Kekre, S., The deterministic lotsizing problem with startup and reservation costs, Operations Research 35 (1987) 389-398.
68. Karmarkar, U.S., Kekre, S., Kekre, S., Freeman, S., Lotsizing and lead-time performance in a manufacturing cell, Interfaces 15 (2) (1985) 1-9.
69. Karmarkar, U.S., Schrage, L., The deterministic dynamic product cycling problem, Operations Research 33 (1985) 326-345.
70. Kimms, A., Multi-level, single-machine lot sizing and scheduling (with initial inventory), European Journal of Operational Research 89 (1996) 86-99.
71. Kimms, A., Competitive methods for multi-level lot sizing and scheduling: Tabu Search and randomized regrets, International Journal of Production Research 34 (1996) 2279-2298.
72. Kimms, A., Improved lower bounds for the proportional lot sizing and scheduling problem, Working Paper No. 414, University of Kiel, 1996.
73. Kimms, A., A genetic algorithm for multi-level, multi-machine lot sizing and scheduling, Working Paper No. 415, University of Kiel, 1996.
74. Kimms, A., Drexl, A., Some insights into proportional lot sizing and scheduling, Working Paper No. 406, University of Kiel, 1996.
75. Kimms, A., Drexl, A., Proportional lot sizing and scheduling: some extensions, Working Paper No. 407, University of Kiel, 1996.
76. Kimms, A., Multi-level Lot Sizing and Scheduling -Methods for Capacitated, Dynamic, and Deterministic Models, Physica, Heidelberg, 1997.
77. Kirca, Ö., Kökten, M., A new heuristic approach for the multi-item dynamic lot sizing problem, European Journal of Operational Research 75 (1994) 332-341.
78. Kuik, R., Salomon, M., Multi-level lot-sizing problem: evaluation of a simulated-annealing heuristic, European Journal of Operational Research 45 (1990) 25-37.
79. Kuik, R., Salomon, M., van Wassenhove, L.N., Maes, J., Linear Programming, Simulated Annealing and Tabu Search heuristics for lotsizing in bottleneck assembly systems, IIE Transactions 25 (1) (1993) 62-72.
80. Kuik, R., Salomon, M., van Wassenhove, L.N., Batching decisions: structure and models, European Journal of Operational Research 75 (1994) 243-263.
81. Lasserre, J.B., An integrated model for job-shop planning and scheduling, Management Science 38 (1992) 1201-1211.
82. Leachman, R.C., Gascon, A., Xiong, Z.K., Multi-item single-machine scheduling with material supply constraints, Journal of the Operational Research Society 44 (1993) 1145-1154.
83. Maes, J., McClain, J.O., van Wassenhove, L.N., Multilevel capacitated lotsizing complexity and LP-based heuristics, European Journal of Operational Research 53 ( 1991) 131-148.
84. Maes, J, van Wassenhove, L.N., Multi-item single-level capacitated dynamic lot-sizing heuristics: a general review, Journal of the Operational Research Society 39 (1988) 991-1004.
85. Maes, J., van Wassenhove, L.N., Capacitated dynamic lotsizing heuristics for serial systems, International Journal of Production Research 29 (1991) 1235-1249.
86. Magnanti, T.L., Vacchani, R., A strong cutting plane algorithm for production scheduling with changeover costs, Operations Research 38 (1990) 456-473.
87. Mathes, H.D., Some valid constraints for the capacitated assembly line lotsizing problem, in: Fandel, G., Gulledge, Th., Jones, A. (Eds.), Operations Research in Production Planning and Control, Springer, Berlin, 1993, pp. 444-458.
88. de Matta, R., Guignard, M., The performance of rolling production schedules in a process industry, IIE Transactions 27 (1995) 564-573.
89. McKnew, M.A., Saydam, C., Coleman, B.J., An efficient zero-one formulation of the multilevel lot-sizing problem, Decision Sciences 22 (1991) 280-295.
90. Oliff, M.D., Burch, E.E., Multiproduct production scheduling at Owens-Corning Fiberglas, Interfaces 15(5) (1985) 25-34.
91. Pinedo, M., Scheduling - Theory, Algorithms, and Systems, Prentice-Hall, Englewood Cliffs, NJ, 1995.
92. Pochet, Y., Wolsey, L.A., Solving multi-item lot-sizing problems using strong cutting planes, Management Science 37 (1991) 53-67.
93. Potts, C.N., van Wassenhove, L.N., Integrating scheduling with batching and lot-sizing: a review of algorithms and complexity, Journal of the Operational Research Society 43 (1992) 395-406.
94. Richter, K., Vörös, J., On the stability region for multi-level inventory problems, European Journal of Operational Research 41 (1989) 169-173.
95. Rogers, J., A computational approach to the economic lot scheduling problem, Management Science 4 (1958) 264-291.
96. Roll, Y., Kami, R., Multi-item, multi-level lot sizing with an aggregate capacity constraint, European Journal of Operational Research 51 (1991) 73-87.
97. Roundy, R.O., Efficient, effective lot sizing for multistage production systems, Operations Research 41 (1993) 371-385.
98. Salomon, M., Deterministic Lotsizing Models for Production Planning, Lecture Notes in Economics and Mathematical Systems, vol. 355, Springer, Berlin, 1991.
99. Salomon, M., Kroon, L.G., Kuik, R., van Wassenhove, L.N., Some extensions of the discrete lotsizing and scheduling problem, Management Science 37 (1991) 801-812.
100. Salomon, M., Kuik, R., van Wassenhove, L.N., Statistical search methods for lotsizing problems, Annals of Operations Research 41 (1993) 453-468.
101. Salomon, M., Solomon, M.M., van Wassenhove, L.N., Dumas, Y.D., Dauzère-Pérès, S., Solving the discrete lotsizing and scheduling problem with sequence dependent set-up costs and set-up times using the travelling salesman problem with time windows, European Journal of Operational Research 100 (3) (1997) to appear.
102. Simpson, N.C., Erenguc, S.S., Improved heuristic methods for multiple stage production planning, Working Paper, State University of New York at Buffalo, 1994.
103. Smith-Daniels, V.L., Smith-Daniels, D.E., A mixed-integer programming model for lot sizing and sequencing packaging lines in the process industries, IIE Transactions 18 (1986) 278-285.
104. Sox, C.R., Gao, Y., The capacitated lot sizing problem with setup carry-over, Working Paper 96-07, Auburn University, 1996.
105. Stadtler, H., Reformulations of the shortest route model for dynamic multi-item multi-level capacitated lotsizing, Working Paper, Technical University of Darmstadt, 1995.
106. Stadtler, H., Mixed integer programming model formulations for dynamic multi-item multi-level capacitated lotsizing, European Journal of Operational Research 94 (1996) 561-581.
107. Sum, C.C., Hill, A.V., A new framework for manufacturing planning and control systems, Decision Sciences 24 (1993) 739-760.
108. Sum, C.C., Png, D.O.S., Yang, K.K., Effects of product structure complexity on multi-level lot sizing, Decision Sciences 24 (1993) 1135-1156.
109. Tempelmeier, H., Derstroff, M., A Lagrangean-based heuristic for dynamic multi-level multi-item constrained lotsizing with setup times, Management Science 42 (1996) 738-757.
110. Tempelmeier, H., Helber, S., A heuristic for dynamic multi-item multi-level capacitated lotsizing for general product structures, European Journal of Operational Research 75 (1994) 296-311.
111. Toklu, B., Wilson, J.M., A heuristic for multi-level lotsizing problems with a bottleneck. International Journal of Production Research 30 (1992) 787-798.
112. Vickery, S.K., Markland, R.E., Multi-stage lot-sizing in a serial production system, International Journal of Production Research 24 (1986) 517-534.
113. Vörös, J., Setup cost stability region for the multi-level dynamic lot sizing problem, European Journal of Operational Research 87 (1995) 132-141.
114. Wagelmans, A., van Hoesel, S., Kolen, A., Economic lot sizing: an O(n log n) algorithm that runs in linear time in the Wagner-Whitin case, Operations Research 40 (1992) S145-S156.
115. Wagner, H.M., Whitin, T.M., Dynamic version of the economic lot size model, Management Science 5 (1958) 89-96.
116. Webster, F.M., A back-order version of the Wagner-Whitin discrete demand EOQ algorithm by Dynamic Programming, Production and Inventory Management Journal 30 (1989) 1-5.
117. Woodruff, D.L., Spearman, M.L., Sequencing and batching for two classes of jobs with deadlines and setup-times, Production and Operations Management 1 (1992) 87-102.
118. Zäpfel, G., Missbauer, H., New concepts for production planning and control, European Journal of Operational Research 67 (1993) 297-320.
119. Zipkin, P., Computing optimal lot sizes in the economic lot scheduling problem, Operations Research 39 (1991) 56-63.