×

zbMATH — the first resource for mathematics

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches. (English) Zbl 1102.90002
Summary: Proofs from complexity theory as well as computational experiments indicate that most lot sizing problems are hard to solve. Because these problems are so difficult, various solution techniques have been proposed to solve them. In the past decade, meta-heuristics such as tabu search, genetic algorithms and simulated annealing, have become popular and efficient tools for solving hard combinatorial optimization problems. We review the various meta-heuristics that have been specifically developed to solve lot sizing problems, discussing their main components such as representation, evaluation, neighborhood definition and genetic operators. Further, we briefly review other solution approaches, such as dynamic programming, cutting planes, Dantzig-Wolfe decomposition, Lagrange relaxation and dedicated heuristics. This allows us to compare these techniques. Understanding their respective advantages and disadvantages gives insight into how we can integrate elements from several solution approaches into more powerful hybrid algorithms. Finally, we discuss general guidelines for computational experiments and illustrate these with several examples.

MSC:
90B05 Inventory, storage, reservoirs
90C59 Approximation methods and heuristics in mathematical programming
Software:
bc-prod; Tabu search
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Aarts, E.H.L.; Reijnhoudt, M.F.; Stehouwer, H.P.; Wessels, J., A novel decomposition approach for on-line lot sizing, European journal of operational research, 122, 339-353, (2000) · Zbl 1068.91511
[2] Afentakis, P.; Gavish, B., Optimal lot-sizing algorithms for complex product structures, Operations research, 34, 2, 237-249, (1986) · Zbl 0602.90048
[3] Afentakis, P.; Gavish, B.; Karmarkar, U., Computationally efficient optimal solutions to the lot-sizing problem in multistage assembly systems, Management science, 30, 2, 222-239, (1984) · Zbl 0552.90045
[4] Aggarwal, A.; Park, J.K., Improved algorithms for economic lot size problems, Operations research, 41, 3, 549-571, (1993) · Zbl 0820.90035
[5] Agra, A.; Constantino, M., Lotsizing with backlogging and start-ups: the case of wagner – whitin costs, Operations research letters, 25, 81-88, (1999) · Zbl 0973.90001
[6] Alfieri, A.; Brandimarte, P.; D’Orazio, S., LP-based heuristics for the capacitated lot-sizing problem: tthe interaction of model formulation and solution algorithm, International journal of production research, 40, 2, 441-458, (2002) · Zbl 1060.90687
[7] Axsäter, S., Performance bounds for lot sizing heuristics, Management science, 31, 5, 634-640, (1985) · Zbl 0612.90029
[8] Bahl, H.C.; Ritzman, L.P.; Gupta, J.N.D., Determining lot sizes and resource requirements: A review, Operations research, 35, 3, 329-345, (1987)
[9] Baker, K.R., Requirements planning, (), 571-627
[10] Barany, I.; Van Roy, T.J.; Wolsey, L.A., Strong formulations for multi-item capacitated lot sizing, Management science, 30, 10, 1255-1261, (1984) · Zbl 0601.90037
[11] Barany, I.; Van Roy, T.J.; Wolsey, L.A., Uncapacitated lot-sizing: the convex hull of solutions, Mathematical programming study, 22, 32-43, (1984) · Zbl 0551.90068
[12] Barbarosoğlu, G.; Özdamar, L., Analysis of solution space-dependent performance of simulated annealing: the case of the multi-level capacitated lot sizing problem, Computers and operations research, 27, 895-903, (2000) · Zbl 0957.90043
[13] Barnhart, C.; Johnson, E.L.; Nemhauser, G.L.; Savelsbergh, M.W.P.; Vance, P.H., Branch-and-price: column generation for solving huge integer programs, Operations research, 46, 3, 316-329, (1998) · Zbl 0979.90092
[14] Belvaux, G.; Wolsey, L.A., Bc-prod: A specialized branch-and-cut system for lot-sizing problems, Management science, 46, 5, 724-738, (2000) · Zbl 1231.90384
[15] Belvaux, G.; Wolsey, L.A., Modelling practical lot-sizing problems as mixed-integer programs, Management science, 47, 7, 993-1007, (2001) · Zbl 1232.90169
[16] Billington, P.; Blackburn, J.; Maes, J.; Millen, R.; Van Wassenhove, L.N., Multi-item lotsizing in capacitated multi-stage serial systems, IIE transactions, 26, 2, 12-18, (1994)
[17] Bitran, G.R.; Matsuo, H., The multi-item capacitated lot size problem: error bounds of manne’s formulations, Management science, 32, 3, 350-359, (1986) · Zbl 0596.90043
[18] Bitran, G.R.; Yanasse, H.H., Computational complexity of the capacitated lot size problem, Management science, 28, 10, 1174-1186, (1982) · Zbl 0502.90046
[19] Bitran, G.B.; Magnanti, T.L.; Yanasse, H.H., Approximation methods for the uncapacitated dynamic lot size problem, Management science, 30, 9, 1121-1140, (1984) · Zbl 0549.90034
[20] Blackburn, J.D.; Millen, R.A., Improved heuristics for multi-stage requirements planning systems, Management science, 28, 1, 44-56, (1982) · Zbl 0486.90035
[21] Bookbinder, J.H.; Koch, L.A., Production planning for mixed assembly/arborescent systems, Journal of operations management, 9, 1, 7-23, (1990)
[22] Brüggemann, W.; Jahnke, H., DLSP for two-stage multi-item batch production, International journal of production research, 32, 4, 755-768, (1994) · Zbl 0901.90127
[23] Brüggemann, W.; Jahnke, H., Remarks on: “some extensions of the discrete lotsizing and scheduling problem”, Management science, 43, 1, 122, (1997) · Zbl 0900.90283
[24] Brüggemann, W.; Jahnke, H., The discrete lot-sizing and scheduling problem: complexity and modification for batch availability, European journal of operational research, 124, 511-528, (2000) · Zbl 0967.90043
[25] Cattrysse, D.; Maes, J.; Van Wassenhove, L.N., Set partitioning and column generation heuristics for capacitated dynamic lotsizing, European journal of operational research, 46, 38-47, (1990) · Zbl 0711.90019
[26] 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, 4, 477-486, (1993) · Zbl 0774.90059
[27] Chung, C.S.; Lin, C.H.M., An O(T2) algorithm for the NI/G/NI/ND capacitated lot size problem, Management science, 34, 3, 420-426, (1988) · Zbl 0668.90015
[28] Clark, A.R.; Armentano, V.A., A heuristic for a resource-capacitated multi-stage lot-sizing problem with lead times, Journal of the operational research society, 46, 10, 1208-1222, (1995) · Zbl 0845.90038
[29] Clark, A.J.; Scarf, H., Optimal policies for a multi-echelon inventory problem, Management science, 6, 4, 475-490, (1960)
[30] Coleman, B.J., A further analysis of variable demand lot-sizing techniques, Production and inventory management journal third quarter, 19-24, (1992)
[31] Coleman, B.J.; McKnew, M.A., A technique for order placement and sizing, Journal of purchasing and materials management, 26, 2, 32-40, (1990)
[32] Constantino, M., A cutting plane approach to capacitated lot-sizing with start-up costs, Mathematical programming, 75, 353-376, (1996) · Zbl 0874.90098
[33] Constantino, M., Lower bounds in lot-sizing models: A polyhedral study, Mathematics of operations research, 23, 1, 101-118, (1998) · Zbl 0977.90029
[34] Dantzig, G.B.; Wolfe, P., Decomposition principle for linear programs, Operations research, 8, 101-111, (1960) · Zbl 0093.32806
[35] De Bodt, M.A.; Gelders, L.F.; Van Wassenhove, L.N., Lot sizing under dynamic demand conditions: A review, Engineering costs and production economics, 8, 165-187, (1984)
[36] Degraeve, Z., Jans, R., 2003. A new Dantzig-Wolfe reformulation and branch-and-price algorithm for the capacitated lot sizing problem with set up times. ERIM Report Series in Management ERS-2003-010-LIS, Erasmus University Rotterdam, The Netherlands. · Zbl 1167.90321
[37] Dellaert, N.; Jeunet, J., Solving large unconstrained multilevel lot-sizing problems using a hybrid genetic algorithm, International journal of production research, 38, 5, 1083-1099, (2000) · Zbl 0945.90533
[38] Dellaert, N.P.; Jeunet, J., Randomized multi-level lot-sizing heuristics for general product structures, European journal of operational research, 148, 211-228, (2003) · Zbl 1137.90308
[39] Dellaert, N.; Jeunet, J.; Jonard, N., A genetic algorithm to solve the general multi-level lot-sizing problem with time-varying costs, International journal of production economics, 68, 241-257, (2000)
[40] De Matta, R.; Guignard, M., Dynamic production scheduling for a process industry, Operations research, 42, 3, 492-503, (1994) · Zbl 0809.90066
[41] De Matta, R.; Guignard, M., Studying the effects of production loss due to setup in dynamic production scheduling, European journal of operational research, 72, 62-73, (1994) · Zbl 0798.90079
[42] Diaby, M., Efficient post-optimization analysis procedure for the dynamic lot-sizing problem, European journal of operational research, 68, 134-138, (1993) · Zbl 0777.90013
[43] Diaby, M.; Bahl, H.C.; Karwan, M.H.; Zionts, S., Capacitated lot-sizing and scheduling by Lagrangean relaxation, European journal of operational research, 59, 444-458, (1992) · Zbl 0761.90060
[44] Diaby, M.; Bahl, H.C.; Karwan, M.H.; Zionts, S., A Lagrangean relaxation approach for very-large-scale capacitated lot-sizing, Management science, 38, 9, 1329-1340, (1992) · Zbl 0758.90020
[45] Dixon, P.S.; Silver, E.A., A heuristic solution procedure for the multi-item, single-level, limited capacity, lot-sizing problem, Journal of operations management, 2, 1, 23-39, (1981)
[46] Dixon, P.S.; Elder, M.D.; Rand, G.K.; Silver, E.A., A heuristic algorithm for determining lot sizes of an item subject to regular and overtime production capacities, Journal of operations management, 3, 3, 121-130, (1983)
[47] Dogramaci, A.; Panayiotopoulos, J.C.; Adam, N.R., The dynamic lot-sizing problem for multiple items under limited capacity, AIIE transactions, 13, 4, 294-303, (1981)
[48] Drexl, A.; Haase, K., Proportional lotsizing and scheduling, International journal of production economics, 40, 73-87, (1995)
[49] Drexl, A.; Haase, K., Sequential-analysis based randomized-regret-methods for lot-sizing and scheduling, Journal of the operational research society, 47, 251-265, (1996) · Zbl 0851.90053
[50] Drexl, A.; Kimms, A., Lot sizing and scheduling—survey and extensions, European journal of operational research, 99, 221-235, (1997) · Zbl 0923.90067
[51] Du Merle, O.; Goffin, J.-L.; Trouiller, C.; Vial, J.-P., A Lagrangian relaxation of the capacitated multi-item lot sizing problem solved with an interior point cutting plane algorithm, LES cahiers du GERAD, G-97-23, 26, (1997)
[52] Dzielinski, B.P.; Gomory, R.E., Optimal programming of lot sizes, inventory and labor allocations, Management science, 11, 9, 874-890, (1965)
[53] Eisenhut, P.S., A dynamic lot sizing algorithm with capacity constraints, AIIE transactions, 7, 2, 170-176, (1974)
[54] Eppen, G.D.; Martin, R.K., Solving multi-item capacitated lot-sizing problems using variable redefinition, Operations research, 35, 6, 832-848, (1987) · Zbl 0639.90046
[55] Federgruen, A.; Tzur, M., A simple forward algorithm to solve general dynamic lot sizing models with n periods in O(nlogn) or O(n) time, Management science, 37, 8, 909-925, (1991) · Zbl 0748.90011
[56] Federgruen, A.; Tzur, M., The dynamic lot-sizing model with backlogging: A simple O(nlogn) algorithm and minimal forecast horizon procedure, Naval research logistics, 40, 459-478, (1993) · Zbl 0804.90037
[57] Fisher, M.L., The Lagrangian relaxation method for solving integer programming problems, Management science, 27, 1, 1-18, (1981) · Zbl 0466.90054
[58] Fleischmann, B., The discrete lot-sizing and scheduling problem, European journal of operational research, 44, 337-348, (1990) · Zbl 0689.90043
[59] Fleischmann, B., The discrete lot-sizing and scheduling problem with sequence-dependent setup costs, European journal of operational research, 75, 395-404, (1994) · Zbl 0804.90070
[60] Fleischmann, B.; Meyr, H., The general lotsizing and scheduling problem, OR spektrum, 19, 11-21, (1997) · Zbl 0892.90055
[61] Florian, M.; Klein, M., Deterministic production planning with concave costs and capacity constraints, Management science, 18, 1, 12-20, (1971) · Zbl 0273.90023
[62] Florian, M.; Lenstra, J.K.; Rinnooy Kan, A.H.G., Deterministic production planning: algorithms and complexity, Management science, 26, 7, 669-679, (1980) · Zbl 0445.90025
[63] Gaafar, L.K.; Choueiki, M.H., A neural network model for solving the lot-sizing problem, Omega, 28, 175-184, (2000)
[64] Geoffrion, A.M., Lagrangean relaxation for integer programming, Mathematical programming study, 2, 82-113, (1974) · Zbl 0395.90056
[65] Glover, F., Tabu search – part I, ORSA journal on computing, 1, 3, 190-206, (1989) · Zbl 0753.90054
[66] Glover, F., Tabu search – part II, ORSA journal on computing, 2, 1, 4-32, (1990) · Zbl 0771.90084
[67] ()
[68] Glover, F.; Laguna, M., Tabu search, (1997), Kluwer Academic Publishers Boston · Zbl 0930.90083
[69] Gopalakrishnan, M.; Ding, K.; Bourjolly, J.-M.; Mohan, S., A tabu-search heuristic for the capacitated lot-sizing problem with set-up carryover, Management science, 47, 6, 851-863, (2001) · Zbl 1232.90181
[70] Groff, G.K., A lot sizing rule for time-phased component demand, Production and inventory management, 20, 47-53, (1979)
[71] Günther, H.O., Planning lot sizes and capacity requirements in a single stage production system, European journal of operational research, 31, 223-231, (1987) · Zbl 0615.90057
[72] Harrison, T.P.; Lewis, H.S., Lot sizing in serial assembly systems with multiple constrained resources, Management science, 42, 1, 19-36, (1996) · Zbl 0851.90054
[73] Hertz, A.; Widmer, M., Guidelines for the use of meta-heuristics in combinatorial optimization, European journal of operational research, 151, 247-252, (2003) · Zbl 1053.90053
[74] Hindi, K.S., Solving the single-item, capacitated dynamic lot sizing problem with startup and reservation costs by tabu search, Computers and industrial engineering, 28, 4, 701-707, (1995)
[75] Hindi, K.S., Solving the CLSP by a tabu search heuristic, Journal of the operational research society, 47, 151-161, (1996) · Zbl 0842.90030
[76] Hung, Y.F.; Chien, K.L., A multi-class multi-level capacitated lot sizing model, Journal of the operational research society, 51, 1309-1318, (2000) · Zbl 1107.90392
[77] Hung, Y.F.; Hu, Y.C., Solving mixed integer programming production planning problems with setups by shadow price information, Computers and operations research, 25, 12, 1027-1042, (1998) · Zbl 1042.90594
[78] Hung, Y.F.; Shih, C.C.; Chen, C.P., Evolutionary algorithm for production planning problems with setup decisions, Journal of the operational research society, 50, 857-866, (1999) · Zbl 1054.90538
[79] Hung, Y.F.; Chen, C.P.; Shih, C.C.; Hung, M.H., Using tabu search with ranking candidate List to solve production planning problems with setups, Computers & industrial engineering, 45, 615-634, (2003)
[80] Jans, R.; Degraeve, Z., An industrial extension of the discrete lot sizing and scheduling problem, IIE transactions, 36, 47-58, (2004)
[81] Jans, R.; Degraeve, Z., Improved lower bounds for the capacitated lot sizing problem with set up times, Operations research letters, 32, 185-195, (2004) · Zbl 1137.90584
[82] Karni, R.; Roll, Y., A heuristic algorithm for the multi-item lot-sizing problem with capacity constraint, IIE transactions, 14, 4, 249-256, (1982)
[83] Karmarkar, U.S.; Schrage, L., The deterministic dynamic product cycling problem, Operations research, 33, 2, 326-345, (1985) · Zbl 0571.90038
[84] Karmarkar, U.S.; Kekre, S.; Kekre, S., The dynamic lot-sizing problem with startup and reservation costs, Operations research, 35, 3, 389-398, (1987) · Zbl 0629.90030
[85] Katok, E.; Lewis, H.S.; Harrison, T.P., Lot sizing in general assembly systems with setup costs, setup times, and multiple constrained resources, Management science, 44, 6, 859-877, (1998) · Zbl 0989.90047
[86] Kimms, A., Competitive methods for multi-level lot sizing and scheduling: tabu search and randomized regrets, International journal of production research, 34, 8, 2279-2298, (1996) · Zbl 0930.90042
[87] Kimms, A., A genetic algorithm for multi-level, multi-machine lot sizing and scheduling, Computers & operations research, 26, 829-848, (1999) · Zbl 0957.90026
[88] Kirca, O., An efficient algorithm for the capacitated single item dynamic lot size problem, European journal of operational research, 45, 15-24, (1990) · Zbl 0685.90038
[89] Kirca, O.; Kökten, M., A new heuristic approach for the multi-item dynamic lot sizing problem, European journal of operational research, 75, 332-341, (1994) · Zbl 0806.90031
[90] Kleindorfer, P.R.; Newson, E.F.P., A lower bounding structure for lot-size scheduling problems, Operations research, 23, 2, 299-311, (1975) · Zbl 0304.90063
[91] Kohlmorgen, U.; Schmeck, H.; Haase, K., Experience with fine-grained parallel genetic algorithms, Annals of operations research, 90, 203-219, (1999) · Zbl 0937.90092
[92] Krarup, J.; Bilde, O., Plant location, set covering and economic lot sizes: an O(mn) algorithm for structured problems, (), 155-179
[93] Kuik, R.; Salomon, M., Multi-level lot-sizing problem: evaluation of a simulated annealing heuristic, European journal of operational research, 45, 25-37, (1990) · Zbl 0685.90052
[94] 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, 62-72, (1993)
[95] Kuik, R.; Salomon, M.; Van Wassenhove, L.N., Batching decisions: structure and models, European journal of operational research, 75, 243-263, (1994)
[96] Laguna, M., A heuristic for production scheduling and inventory control in the presence of sequence-dependent setup times, IIE transactions, 31, 125-134, (1999)
[97] Lambrecht, M.; Vander Eecken, J., A facilities in series capacity constrained dynamic lot-size model, European journal of operational research, 2, 42-49, (1978) · Zbl 0371.90055
[98] Lambrecht, M.; Vander Eecken, J., A capacity constrained single-facility dynamic lot-size model, European journal of operational research, 2, 132-136, (1978) · Zbl 0373.90030
[99] Lambrecht, M.; Vanderveken, H., Heuristic procedures for the single operation, multi-item loading problem, AIIE transactions, 11, 4, 319-326, (1979)
[100] Lasdon, L.S.; Terjung, R.C., An efficient algorithm for multi-item scheduling, Operations research, 19, 4, 946-969, (1971) · Zbl 0224.90039
[101] Leung, J.M.Y.; Magnanti, T.L.; Vachani, R., Facets and algorithms for capacitated lot sizing, Mathematical programming, 45, 331-359, (1989) · Zbl 0681.90060
[102] Lippman, S.A., Optimal inventory policy with multiple set-up cost, Management science, 16, 1, 118-138, (1969) · Zbl 0184.44701
[103] Loparic, M.; Marchand, H.; Wolsey, L.A., Dynamic knapsack sets and capacitated lot-sizing, Mathematical programming ser. B, 95, 53-69, (2003) · Zbl 1030.90102
[104] Maes, J.; Van Wassenhove, L.N., Multi-item single level capacitated dynamic lotsizing heuristics: A computational comparison (part I: static case), IIE transactions, 18, 2, 114-123, (1986)
[105] Maes, J.; Van Wassenhove, L.N., Multi-item single level capacitated dynamic lotsizing heuristics: A computational comparison (part II: rolling horizon), IIE transactions, 18, 2, 124-129, (1986)
[106] Maes, J.; Van Wassenhove, L.N., A simple heuristic for the multi-item single level capacitated lot sizing problem, Operations research letters, 4, 6, 265-273, (1986) · Zbl 0596.90029
[107] 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, 11, 991-1004, (1988) · Zbl 0655.90018
[108] Maes, J.; McClain, J.O.; Van Wassenhove, L.N., Multilevel capacitated lotsizing complexity and LP-based heuristics, European journal of operational research, 53, 131-148, (1991) · Zbl 0734.90036
[109] Magnanti, T.L.; Sastry, T., Facets and reformulations for solving production planning with changeover costs, Operations research, 50, 4, 708-719, (2002) · Zbl 1163.90466
[110] Magnanti, T.L.; Vachani, R., A strong cutting plane algorithm for production scheduling with changeover costs, Operations research, 38, 3, 456-473, (1990) · Zbl 0707.90047
[111] Manne, A.S., Programming of economic lot sizes, Management science, 4, 2, 115-135, (1958)
[112] McClain, J.; Thomas, L.J.; Weiss, E.N., Efficient solutions to a linear programming model for production scheduling with capacity constraints and no initial stock, IIE transactions, 21, 2, 144-152, (1989)
[113] Meyr, H., Simultaneous lotsizing and scheduling by combining local search with dual reoptimization, European journal of operational research, 120, 311-326, (2000) · Zbl 0943.90037
[114] Michalewicz, Z.; Fogel, D.B., How to solve it: modern heuristics, (2002), Springer-Verlag Berlin, p. 467 · Zbl 0943.90002
[115] Miller, A.J.; Nemhauser, G.L.; Savelsberg, M.W.P., On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra, European journal of operational research, 125, 298-315, (2000) · Zbl 0952.90028
[116] Miller, A.J., Nemhauser, G.L., Savelsberg, M.W.P., 2000b. Solving multi-item capacitated lot-sizing problems with setup times by branch-and-cut, CORE Discussion Paper, 2000/39, 32p.
[117] Miller, A.J.; Nemhauser, G.L.; Savelsberg, M.W.P., On the polyhedral structure of a multi-item production planning model with setup times, Mathematical programming, 94, 375-405, (2003) · Zbl 1030.90022
[118] Miller, A.J.; Nemhauser, G.L.; Savelsberg, M.W.P., A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterization for a special case, Mathematical programming, 95, 71-90, (2003) · Zbl 1030.90021
[119] Newson, E.F.P., Multi-item lot size scheduling by heuristic part I: with fixed resources, Management science, 21, 10, 1186-1193, (1975) · Zbl 0306.90035
[120] Newson, E.F.P., Multi-item lot size scheduling by heuristic part II: with variable resources, Management science, 21, 10, 1194-1203, (1975) · Zbl 0306.90035
[121] Özdamar, L.; Barbarosoğlu, G., Hybrid heuristics for the multi-stage capacitated lot sizing and loading problem, Journal of the operational research society, 50, 810-825, (1999) · Zbl 1054.90592
[122] Özdamar, L.; Barbarosoğlu, G., An integrated Lagrangean relaxation—simulated annealing approach to the multi-level multi-item capacitated lot sizing problem, International journal of production economics, 68, 319-331, (2000)
[123] Özdamar, L.; Birbil, S.I., Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions, European journal of operational research, 110, 525-547, (1998) · Zbl 0948.90009
[124] Özdamar, L.; Bozyel, M.A., The capacitated lot sizing problem with overtime decisions and setup times, IIE transactions, 32, 1043-1057, (2000)
[125] Özdamar, L.; Birbil, S.I.; Portmann, M.C., Technical note: new results for the capacitated lot sizing problem with overtime decisions and setup times, Production planning & control, 13, 2-10, (2002)
[126] Pereira, O., Wolsey, L., 2000. On the Wagner-Within lot-sizing polyhedron. CORE Discussion Paper 00/23, 11p.
[127] Pochet, Y., Valid inequalities and separation for capacitated economic lot sizing, Operations research letters, 7, 3, 109-115, (1988) · Zbl 0653.90051
[128] Pochet, Y., Mathematical programming models and formulations for deterministic production planning problems, (), 57-111 · Zbl 1052.90028
[129] Pochet, Y.; Wolsey, L.A., Lot-size models with backlogging: strong reformulations and cutting planes, Mathematical programming, 40, 317-335, (1988) · Zbl 0663.90038
[130] Pochet, Y.; Wolsey, L.A., Solving multi-item lot-sizing problems using strong cutting planes, Management science, 37, 1, 53-67, (1991) · Zbl 0727.90034
[131] Pochet, Y.; Wolsey, L.A., Lot-sizing with constant batches: formulation and valid inequalities, Mathematics of operations research, 18, 4, 767-785, (1993) · Zbl 0808.90058
[132] Pochet, Y.; Wolsey, L.A., Polyhedra for lot-sizing with wagner – whitin costs, Mathematical programming, 67, 297-323, (1994) · Zbl 0822.90049
[133] Pochet, Y.; Wolsey, L.A., Algorithms and reformulations for lot sizing problems, (), 245-293 · Zbl 0838.90029
[134] Rardin, R.L.; Uzsoy, R., Experimental evaluation of heuristic optimization algorithms: A tutorial, Journal of heuristics, 7, 261-304, (2001) · Zbl 0972.68634
[135] Reeves, C.R., Genetic algorithms for the operations researcher, INFORMS journal on computing, 9, 3, 231-250, (1997) · Zbl 0893.90145
[136] ()
[137] ()
[138] Salomon, M.; Kroon, L.G.; Kuik, R.; Van Wassenhove, L.N., Some extensions of the discrete lotsizing and scheduling problem, Management science, 37, 7, 801-812, (1991) · Zbl 0742.90039
[139] Salomon, M.; Kuik, R.; Van Wassenhove, L.N., Statistical search methods for lotsizing problems, Annals of operations research, 41, 453-468, (1993) · Zbl 0778.90017
[140] Sandbothe, R.A., The capacitated dynamic lot-sizing problem with startup and reservation costs: A forward algorithm solution, Journal of operations management, 10, 2, 255-266, (1991)
[141] Selen, W.J.; Heuts, R.M.J., Operational production planning in a chemical manufacturing environment, European journal of operational research, 45, 38-46, (1990)
[142] Shaw, D.X.; Wagelmans, A.P.M., An algorithm for single-item capacitated economic lot sizing with piecewise linear production costs and general holding costs, Management science, 44, 6, 831-838, (1998) · Zbl 0989.90051
[143] Silver, E.A.; Meal, H.C., A heuristic for selecting lot size quantities for the case of a deterministic time-varying demand rate and discrete opportunities for replenishment, Production and inventory management 2nd quarter, 64-74, (1973)
[144] Silver, E.A.; Pyke, D.F.; Peterson, R., Inventory management and production planning and scheduling, (1998), John Wiley NY
[145] Simpson, N.C., Questioning the relative virtues of the dynamic lot sizing rules, Computers and operations research, 28, 899-914, (2001) · Zbl 1027.90525
[146] Simpson, N.C.; Erenguc, S.S., Multiple-stage production planning research: history and opportunities, International journal of operations and production management, 16, 6, 25-40, (1996)
[147] Stadtler, H., Mixed integer programming model formulations for dynamic multi-item multi-level capacitated lotsizing, European journal of operational research, 94, 561-581, (1996) · Zbl 0947.90541
[148] Stadtler, H., Reformulations of the shortest route model for dynamic multi-item multi-level capacitated lotsizing, OR spektrum, 19, 87-96, (1997) · Zbl 0888.90051
[149] Stadtler, H., Multilevel lot sizing with set up times and multiple constrained resources: internally rolling schedules with lot-sizing windows, Operations research, 51, 3, 487-502, (2003) · Zbl 1163.90474
[150] Tang, O., Simulated annealing in lot sizing problems, International journal of production economics, 88, 173-181, (2004)
[151] Tempelmeier, H.; Derstroff, M., A Lagrangean based heuristic for dynamic multilevel multiitem constrained lotsizing with setup times, Management science, 42, 5, 738-757, (1996) · Zbl 0881.90045
[152] Tempelmeier, H.; Helber, S., A heuristic for dynamic multi-item multi-level capacitated lotsizing for general product structures, European journal of operational research, 75, 296-311, (1994) · Zbl 0809.90070
[153] Thizy, J.M.; Van Wassenhove, L.N., Lagrangean relaxation for the multi-item capacitated lot-sizing problem: A heuristic implementation, IIE transactions, 17, 4, 308-313, (1985)
[154] Trigeiro, W.W., A simple heuristic for lot sizing with setup times, Decision sciences, 20, 294-303, (1989)
[155] Trigeiro, W.; Thomas, L.J.; McClain, J.O., Capacitated lot sizing with set-up times, Management science, 35, 3, 353-366, (1989)
[156] Vachani, R., Performance of heuristics for the uncapacitated lot-size problem, Naval research logistics, 39, 801-813, (1992) · Zbl 0761.90033
[157] Vanderbeck, F., Lot-sizing with start-up times, Management science, 44, 10, 1409-1425, (1998) · Zbl 0989.90069
[158] Vanderbeck, F.; Wolsey, L.A., Valid inequalities for the lasdon – terjung production model, Journal of the operational research society, 43, 5, 435-441, (1992) · Zbl 0756.90047
[159] Van Eijl, C.A.; van Hoesel, C.P.M., On the discrete lot-sizing and scheduling problem with wagner – whitin costs, Operations research letters, 20, 7-13, (1997) · Zbl 0889.90084
[160] Van Hoesel, S.; Kolen, A., A linear description of the discrete lot-sizing and scheduling problem, European journal of operational research, 75, 312-331, (1994)
[161] Van Hoesel, C.P.M.; Wagelmans, A.P.M., An O(T3) algorithm for the economic lot-sizing problem with constant capacities, Management science, 42, 1, 142-150, (1996) · Zbl 0851.90058
[162] Van Hoesel, C.P.M.; Wagelmans, A.P.M., Fully polynomial approximation schemes for single-item capacitated economic lot-sizing problems, Mathematics of operations research, 26, 2, 339-357, (2001) · Zbl 1082.90532
[163] Van Hoesel, S.; Kuik, R.; Salomon, M.; Van Wassenhove, L.N., The single item discrete lot sizing and scheduling problem: optimization by linear and dynamic programming, Discrete applied mathematics, 48, 289-303, (1994) · Zbl 0793.90018
[164] Van Hoesel, S.; Wagelmans, A.; Moerman, B., Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions, European journal of operational research, 75, 287-295, (1994) · Zbl 0806.90125
[165] Van Nunen, J.A.E.E.; Wessels, J., Multi-item lot size determination and scheduling under capacity constraints, European journal of operational research, 2, 36-41, (1978) · Zbl 0371.90056
[166] Van Vyve, M., 2003. Algorithms for single item constant capacity lot sizing problems, CORE Discussion Paper 2003/7, p. 28.
[167] Van Vyve, M., Ortega, F., 2003. Lot-sizing with fixed charges on stocks: the convex hull, CORE Discussion Paper 2003/14, p. 19. · Zbl 1087.90013
[168] Van Wassenhove, L.N.; De Bodt, M.A., Capacitated lot sizing for injection moulding: A case study, Journal of the operational research society, 34, 6, 489-501, (1983)
[169] Wagelmans, A.; Van Hoesel, S.; Kolen, A., Economic lot sizing: an O(nlogn) algorithm that runs in linear time in the wagner – whitin case, Operations research, 40, 1, S145-S156, (1992) · Zbl 0771.90031
[170] Wagner, H.M.; Whitin, T.M., Dynamic version of the economic lot size model, Management science, 5, 1, 89-96, (1958) · Zbl 0977.90500
[171] Webster, S., Remarks on: “some extensions of the discrete lotsizing and scheduling problem”, Management science, 45, 5, 768-769, (1999) · Zbl 1231.90069
[172] Wolsey, L.A., Uncapacitated lot-sizing problems with start-up costs, Operations research, 37, 5, 741-747, (1989) · Zbl 0696.90021
[173] Wolsey, L.A., Progress with single-item lot-sizing, European journal of operational research, 86, 395-401, (1995) · Zbl 0914.90105
[174] Wolsey, L.A., MIP modelling of changeovers in production planning and scheduling problems, European journal of operational research, 99, 154-165, (1997) · Zbl 0923.90088
[175] Wolsey, L.A., Solving multi-item lot-sizing problems with an MIP solver using classification and reformulation, Management science, 48, 12, 1587-1602, (2002) · Zbl 1232.90104
[176] Xie, J.; Dong, J., Heuristic genetic algorithms for general capacitated lot-sizing problems, Computers and mathematics with applications, 44, 263-276, (2002) · Zbl 1007.90021
[177] Zangwill, W.I., A deterministic multi-period production scheduling model with backlogging, Management science, 13, 1, 105-119, (1966) · Zbl 0143.22101
[178] Zangwill, W.I., A deterministic multiproduct, multi-facility production and inventory model, Operations research, 14, 3, 486-507, (1966) · Zbl 0142.17105
[179] Zangwill, W.I., A backlogging model and a multi-echelon model of a dynamic economic lot size production system—a network approach, Management science, 15, 9, 506-527, (1969) · Zbl 0172.44603
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.