IDEAS home Printed from https://ideas.repec.org/
MyIDEAS: Login to save this article or follow this journal

Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches

  • Jans, Raf
  • Degraeve, Zeger
Registered author(s):

    No abstract is available for this item.

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

    File URL: http://www.sciencedirect.com/science/article/B6VCT-4J2TVM6-6/2/ce483b1c16bbf2a7939e119237bf549e
    Download Restriction: Full text for ScienceDirect subscribers only

    As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

    Article provided by Elsevier in its journal European Journal of Operational Research.

    Volume (Year): 177 (2007)
    Issue (Month): 3 (March)
    Pages: 1855-1875

    as
    in new window

    Handle: RePEc:eee:ejores:v:177:y:2007:i:3:p:1855-1875
    Contact details of provider: Web page: http://www.elsevier.com/locate/eor

    References listed on IDEAS
    Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:

    as in new window
    1. Mohan Gopalakrishnan & Ke Ding & Jean-Marie Bourjolly & Srimathy Mohan, 2001. "A Tabu-Search Heuristic for the Capacitated Lot-Sizing Problem with Set-up Carryover," Management Science, INFORMS, vol. 47(6), pages 851-863, June.
    2. Willard I. Zangwill, 1966. "A Deterministic Multi-Period Production Scheduling Model with Backlogging," Management Science, INFORMS, vol. 13(1), pages 105-119, September.
    3. WOLSEY, Laurence, 2002. "Solving multi-item lot-sizing problems with an MIP solver using classification and reformulation," CORE Discussion Papers 2002012, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    4. Alan S. Manne, 1957. "Programming of Economic Lot Sizes," Cowles Foundation Discussion Papers 23, Cowles Foundation for Research in Economics, Yale University.
    5. Gaafar, Lotfi K. & Choueiki, M. Hisham, 2000. "A neural network model for solving the lot-sizing problem," Omega, Elsevier, vol. 28(2), pages 175-184, April.
    6. Fleischmann, Bernhard, 1994. "The discrete lot-sizing and scheduling problem with sequence-dependent setup costs," European Journal of Operational Research, Elsevier, vol. 75(2), pages 395-404, June.
    7. Dellaert, N. & Jeunet, J. & Jonard, N., 2000. "A genetic algorithm to solve the general multi-level lot-sizing problem with time-varying costs," International Journal of Production Economics, Elsevier, vol. 68(3), pages 241-257, December.
    8. Bernard P. Dzielinski & Ralph E. Gomory, 1965. "Optimal Programming of Lot Sizes, Inventory and Labor Allocations," Management Science, INFORMS, vol. 11(9), pages 874-890, July.
    9. van Hoesel, Stan & Kolen, Antoon, 1994. "A linear description of the discrete lot-sizing and scheduling problem," European Journal of Operational Research, Elsevier, vol. 75(2), pages 342-353, June.
    10. Katok, Elena & Holly S. Lewis & Terry P. Harrison, 1995. "Lot Sizing in General Assembly Systems with Setup Costs, Setup Times and Multiple Constrained Resources," Discussion Paper Serie B 346, University of Bonn, Germany.
    11. Terry P. Harrison & Holly S. Lewis, 1996. "Lot Sizing in Serial Assembly Systems with Multiple Constrained Resources," Management Science, INFORMS, vol. 42(1), pages 19-36, January.
    12. Selen, W. J. & Heuts, R. M. J., 1990. "Operational production planning in a chemical manufacturing environment," European Journal of Operational Research, Elsevier, vol. 45(1), pages 38-46, March.
    13. Cattrysse, Dirk & Maes, Johan & Van Wassenhove, Luk N., 1990. "Set partitioning and column generation heuristics for capacitated dynamic lotsizing," European Journal of Operational Research, Elsevier, vol. 46(1), pages 38-47, May.
    14. E. F. Peter Newson, 1975. "Multi-Item Lot Size Scheduling by Heuristic Part I: With Fixed Resources," Management Science, INFORMS, vol. 21(10), pages 1186-1193, June.
    15. De Bodt, Marc A. & Gelders, Ludo F. & Van Wassenhove, Luk N., 1984. "Lot sizing under dynamic demand conditions: A review," Engineering Costs and Production Economics, Elsevier, vol. 8(3), pages 165-187, December.
    16. Gaetan Belvaux & Laurence A. Wolsey, 2001. "Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs," Management Science, INFORMS, vol. 47(7), pages 993-1007, July.
    17. Maes, Johan & McClain, John O. & Van Wassenhove, Luk N., 1991. "Multilevel capacitated lotsizing complexity and LP-based heuristics," European Journal of Operational Research, Elsevier, vol. 53(2), pages 131-148, July.
    18. William W. Trigeiro & L. Joseph Thomas & John O. McClain, 1989. "Capacitated Lot Sizing with Setup Times," Management Science, INFORMS, vol. 35(3), pages 353-366, March.
    19. Fleischmann, Bernhard, 1990. "The discrete lot-sizing and scheduling problem," European Journal of Operational Research, Elsevier, vol. 44(3), pages 337-348, February.
    20. Degraeve, Z. & Jans, R.F., 2003. "A New Dantzig-Wolfe Reformulation And Branch-And-Price Algorithm For The Capacitated Lot Sizing Problem With Set Up Times," ERIM Report Series Research in Management ERS-2003-010-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    21. Hertz, Alain & Widmer, Marino, 2003. "Guidelines for the use of meta-heuristics in combinatorial optimization," European Journal of Operational Research, Elsevier, vol. 151(2), pages 247-252, December.
    22. Fleischmann, B. & Meyr, H., 1997. "The General Lotsizing and Scheduling Problem," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 36068, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    23. Ozdamar, Linet & Birbil, Sevket Ilker, 1998. "Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions," European Journal of Operational Research, Elsevier, vol. 110(3), pages 525-547, November.
    24. Dong X. Shaw & Albert P. M. Wagelmans, 1998. "An Algorithm for Single-Item Capacitated Economic Lot Sizing with Piecewise Linear Production Costs and General Holding Costs," Management Science, INFORMS, vol. 44(6), pages 831-838, June.
    25. Gabriel R. Bitran & Thomas L. Magnanti & Horacio H. Yanasse, 1984. "Approximation Methods for the Uncapacitated Dynamic Lot Size Problem," Management Science, INFORMS, vol. 30(9), pages 1121-1140, September.
    26. François Vanderbeck, 1998. "Lot-Sizing with Start-Up Times," Management Science, INFORMS, vol. 44(10), pages 1409-1425, October.
    27. Willard I. Zangwill, 1969. "A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System--A Network Approach," Management Science, INFORMS, vol. 15(9), pages 506-527, May.
    28. Tempelmeier, Horst & Helber, Stefan, 1994. "A heuristic for dynamic multi-item multi-level capacitated lotsizing for general product structures," European Journal of Operational Research, Elsevier, vol. 75(2), pages 296-311, June.
    29. Steven A. Lippman, 1969. "Optimal Inventory Policy with Multiple Set-Up Costs," Management Science, INFORMS, vol. 16(1), pages 118-138, September.
    30. Horst Tempelmeier & Matthias Derstroff, 1996. "A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times," Management Science, INFORMS, vol. 42(5), pages 738-757, May.
    31. Gu[diaeresis]nther, H.O., 1987. "Planning lot sizes and capacity requirements in a single stage production system," European Journal of Operational Research, Elsevier, vol. 31(2), pages 223-231, August.
    32. Laurence A. Wolsey, 2002. "Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation," Management Science, INFORMS, vol. 48(12), pages 1587-1602, December.
    33. Michael Florian & Morton Klein, 1971. "Deterministic Production Planning with Concave Costs and Capacity Constraints," Management Science, INFORMS, vol. 18(1), pages 12-20, September.
    34. Kirca, Omer & Kokten, Melih, 1994. "A new heuristic approach for the multi-item dynamic lot sizing problem," European Journal of Operational Research, Elsevier, vol. 75(2), pages 332-341, June.
    35. Drexl, Andreas & Haase, Knut, 1995. "Proportional lotsizing and scheduling," International Journal of Production Economics, Elsevier, vol. 40(1), pages 73-87, June.
    36. VAN VYVE, Mathieu, 2003. "Algorithms for single item constant capacity lotsizing problems," CORE Discussion Papers 2003007, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    37. van Nunen, J. A. E. E. & Wessels, J., 1978. "Multi-item lot size determination and scheduling under capacity constraints," European Journal of Operational Research, Elsevier, vol. 2(1), pages 36-41, January.
    38. Awi Federgruen & Michal Tzur, 1991. "A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time," Management Science, INFORMS, vol. 37(8), pages 909-925, August.
    39. Joseph D. Blackburn & Robert A. Millen, 1982. "Improved Heuristics for Multi-Stage Requirements Planning Systems," Management Science, INFORMS, vol. 28(1), pages 44-56, January.
    40. Aarts, E. H. L. & Reijnhoudt, M. F. & Stehouwer, H. P. & Wessels, J., 2000. "A novel decomposition approach for on-line lot-sizing," European Journal of Operational Research, Elsevier, vol. 122(2), pages 339-353, April.
    41. Harvey M. Wagner & Thomson M. Whitin, 1958. "Dynamic Version of the Economic Lot Size Model," Management Science, INFORMS, vol. 5(1), pages 89-96, October.
    42. MILLER, Andrew & NEMHAUSER, George & SAVELSBERGH, Martin, 2000. "Solving multi-item capacitated lot-sizing problems with setup times by branch-and-cut," CORE Discussion Papers 2000039, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    43. Kirca, Omer, 1990. "An efficient algorithm for the capacitated single item dynamic lot size problem," European Journal of Operational Research, Elsevier, vol. 45(1), pages 15-24, March.
    44. Wolfgang Bruggemann & Hermann Jahnke, 1997. "Remarks on: "Some Extensions of the Discrete Lotsizing and Scheduling Problem"," Management Science, INFORMS, vol. 43(1), pages 122-122, January.
    45. Diaby, Moustapha, 1993. "Efficient post-optimization analysis procedure for the dynamic lot-sizing problem," European Journal of Operational Research, Elsevier, vol. 68(1), pages 134-138, July.
    46. Meyr, H., 2000. "Simultaneous Lotsizing and Scheduling by combining Local Search with Dual Reoptimization," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 39380, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    47. M. Florian & J. K. Lenstra & A. H. G. Rinnooy Kan, 1980. "Deterministic Production Planning: Algorithms and Complexity," Management Science, INFORMS, vol. 26(7), pages 669-679, July.
    48. Stadtler, Hartmut, 1997. "Reformulations of the shortest route model for dynamic multi-item multi-level capacitated lotsizing," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 7096, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    49. Dirk Cattrysse & Marc Salomon & Roelof Kuik & Luk N. Van Wassenhove, 1993. "A Dual Ascent and Column Generation Heuristic for the Discrete Lotsizing and Scheduling Problem with Setup Times," Management Science, INFORMS, vol. 39(4), pages 477-486, April.
    50. Andrew J. Clark & Herbert Scarf, 2004. "Optimal Policies for a Multi-Echelon Inventory Problem," Management Science, INFORMS, vol. 50(12_supple), pages 1782-1790, December.
    51. Wolsey, Laurence A., 1997. "MIP modelling of changeovers in production planning and scheduling problems," European Journal of Operational Research, Elsevier, vol. 99(1), pages 154-165, May.
    52. Meyr, H., 2000. "Simultaneous lotsizing and scheduling by combining local search with dual reoptimization," European Journal of Operational Research, Elsevier, vol. 120(2), pages 311-326, January.
    53. du Merle, O & Goffin, J-L & Trouiller, C & Vial, J-Ph, 1997. "A Lagrangian Relaxation of the Capacitated Multi-Item Lot Sizing Problem Solved with an Interior Point Cutting Plan Algorithm," Papers 97.11, Ecole des Hautes Etudes Commerciales, Universite de Geneve-.
    54. Drexl, A. & Kimms, A., 1997. "Lot sizing and scheduling -- Survey and extensions," European Journal of Operational Research, Elsevier, vol. 99(2), pages 221-235, June.
    55. Stadtler, Hartmut, 1996. "Mixed integer programming model formulations for dynamic multi-item multi-level capacitated lotsizing," European Journal of Operational Research, Elsevier, vol. 94(3), pages 561-581, November.
    56. Dellaert, N. P. & Jeunet, J., 2003. "Randomized multi-level lot-sizing heuristics for general product structures," European Journal of Operational Research, Elsevier, vol. 148(1), pages 211-228, July.
    57. Kuik, Roelof & Salomon, Marc & van Wassenhove, Luk N., 1994. "Batching decisions: structure and models," European Journal of Operational Research, Elsevier, vol. 75(2), pages 243-263, June.
    58. de Matta, Renato & Guignard, Monique, 1994. "Studying the effects of production loss due to setup in dynamic production scheduling," European Journal of Operational Research, Elsevier, vol. 72(1), pages 62-73, January.
    59. Bruggemann, Wolfgang & Jahnke, Hermann, 2000. "The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability," European Journal of Operational Research, Elsevier, vol. 124(3), pages 511-528, August.
    60. Diaby, M. & Bahl, H. C. & Karwan, M. H. & Zionts, S., 1992. "Capacitated lot-sizing and scheduling by Lagrangean relaxation," European Journal of Operational Research, Elsevier, vol. 59(3), pages 444-458, June.
    61. Scott Webster, 1999. "Remarks on: "Some Extensions of the Discrete Lotsizing and Scheduling Problem"," Management Science, INFORMS, vol. 45(5), pages 768-769, May.
    62. Moustapha Diaby & Harish C. Bahl & Mark H. Karwan & Stanley Zionts, 1992. "A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing," Management Science, INFORMS, vol. 38(9), pages 1329-1340, September.
    63. VAN VYVE, Mathieu & ORTEGA, Francisco, 2003. "Lot-sizing with fixed charges on stocks: the convex hull," CORE Discussion Papers 2003014, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    64. Gabriel R. Bitran & Horacio H. Yanasse, 1982. "Computational Complexity of the Capacitated Lot Size Problem," Management Science, INFORMS, vol. 28(10), pages 1174-1186, October.
    65. Lambrecht, Marc & Vander Eecken, Jacques, 1978. "A facilities in series capacity constrained dynamic lot-size model," European Journal of Operational Research, Elsevier, vol. 2(1), pages 42-49, January.
    66. Panayotis Afentakis & Bezalel Gavish & Uday Karmarkar, 1984. "Computationally Efficient Optimal Solutions to the Lot-Sizing Problem in Multistage Assembly Systems," Management Science, INFORMS, vol. 30(2), pages 222-239, February.
    67. Kuik, R. & Salomon, M., 1990. "Multi-level lot-sizing problem: Evaluation of a simulated-annealing heuristic," European Journal of Operational Research, Elsevier, vol. 45(1), pages 25-37, March.
    68. Wolsey, Laurence A., 1995. "Progress with single-item lot-sizing," European Journal of Operational Research, Elsevier, vol. 86(3), pages 395-401, November.
    69. Marc Salomon & Leo G. Kroon & Roelof Kuik & Luk N. Van Wassenhove, 1991. "Some Extensions of the Discrete Lotsizing and Scheduling Problem," Management Science, INFORMS, vol. 37(7), pages 801-812, July.
    70. Tang, Ou, 2004. "Simulated annealing in lot sizing problems," International Journal of Production Economics, Elsevier, vol. 88(2), pages 173-181, March.
    71. Stadtler, Hartmut, 2003. "Multilevel lot sizing with setup times and multiple constrained resources: Internally rolling schedules with lot-sizing windows," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 20204, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    72. Gabriel R. Bitran & Hirofumi Matsuo, 1986. "The Multi-Item Capacitated Lot Size Problem: Error Bounds of Manne's Formulations," Management Science, INFORMS, vol. 32(3), pages 350-359, March.
    73. Marshall L. Fisher, 1981. "The Lagrangian Relaxation Method for Solving Integer Programming Problems," Management Science, INFORMS, vol. 27(1), pages 1-18, January.
    74. Miller, Andrew J. & Nemhauser, George L. & Savelsbergh, Martin W. P., 2000. "On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra," European Journal of Operational Research, Elsevier, vol. 125(2), pages 298-315, September.
    75. Lambrecht, Marc & Vander Eecken, Jacques, 1978. "A capacity constrained single-facility dynamic lot-size model," European Journal of Operational Research, Elsevier, vol. 2(2), pages 132-136, March.
    76. van Hoesel, Stan & Wagelmans, Albert & Moerman, Bram, 1994. "Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions," European Journal of Operational Research, Elsevier, vol. 75(2), pages 312-331, June.
    77. Imre Barany & Tony J. Van Roy & Laurence A. Wolsey, 1984. "Strong Formulations for Multi-Item Capacitated Lot Sizing," Management Science, INFORMS, vol. 30(10), pages 1255-1261, October.
    78. Yves Pochet & Laurence A. Wolsey, 1991. "Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes," Management Science, INFORMS, vol. 37(1), pages 53-67, January.
    Full references (including those not matched with items on IDEAS)

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:177:y:2007:i:3:p:1855-1875. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.