IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v177y2007i3p1855-1875.html
   My bibliography  Save this article

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

Author

Listed:
  • Jans, Raf
  • Degraeve, Zeger

Abstract

No abstract is available for this item.

Suggested Citation

  • Jans, Raf & Degraeve, Zeger, 2007. "Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1855-1875, March.
    • Handle: RePEc:eee:ejores:v:177:y:2007:i:3:p:1855-1875
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(05)00841-6
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. 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.
    2. Gary D. Eppen & R. Kipp Martin, 1987. "Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition," Operations Research, INFORMS, vol. 35(6), pages 832-848, December.
    3. 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.
    4. Laurence A. Wolsey, 1989. "Uncapacitated Lot-Sizing Problems with Start-Up Costs," Operations Research, INFORMS, vol. 37(5), pages 741-747, October.
    5. Thomas L. Magnanti & Trilochan Sastry, 2002. "Facets and Reformulations for Solving Production Planning With Changeover Costs," Operations Research, INFORMS, vol. 50(4), pages 708-719, August.
    6. 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).
    7. 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.
    8. 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.
    9. 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.
    10. Alan S. Manne, 1958. "Programming of Economic Lot Sizes," Management Science, INFORMS, vol. 4(2), pages 115-135, January.
    11. 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.
    12. 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.
    13. 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.
    14. 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).
    15. POCHET, Yves & WOLSEY, Laurence A., 1988. "Lot-size models with backlogging: strong reformulations and cutting planes," LIDAM Reprints CORE 791, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    16. 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-.
    17. 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.
    18. Fred Glover, 1989. "Tabu Search---Part I," INFORMS Journal on Computing, INFORMS, vol. 1(3), pages 190-206, August.
    19. 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.
    20. 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.
    21. Steven A. Lippman, 1969. "Optimal Inventory Policy with Multiple Set-Up Costs," Management Science, INFORMS, vol. 16(1), pages 118-138, September.
    22. BELVAUX, Gaetan & WOLSEY, Laurence A., 2001. "Modelling practical lot-sizing problems as mixed-integer programs," LIDAM Reprints CORE 1516, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    23. WOLSEY, Laurence A., 2002. "Solving multi-item lot-sizing problems with an MIP solver using classification and reformulation," LIDAM Reprints CORE 1605, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    24. George B. Dantzig & Philip Wolfe, 1960. "Decomposition Principle for Linear Programs," Operations Research, INFORMS, vol. 8(1), pages 101-111, February.
    25. 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.
    26. BARANY, Imre & VAN ROY, Tony & WOLSEY, Laurence A., 1984. "Uncapacitated lot-sizing: the convex hull of solutions," LIDAM Reprints CORE 605, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    27. Michael Florian & Morton Klein, 1971. "Deterministic Production Planning with Concave Costs and Capacity Constraints," Management Science, INFORMS, vol. 18(1), pages 12-20, September.
    28. 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.
    29. E. F. Peter Newson, 1975. "Multi-Item Lot Size Scheduling by Heuristic Part II: With Variable Resources," Management Science, INFORMS, vol. 21(10), pages 1194-1203, June.
    30. 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.
    31. Miguel Constantino, 1998. "Lower Bounds in Lot-Sizing Models: A Polyhedral Study," Mathematics of Operations Research, INFORMS, vol. 23(1), pages 101-118, February.
    32. Wolsey, L. A., 1997. "MIP modelling of changeovers in production planning and scheduling problems," LIDAM Reprints CORE 1271, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    33. BELVAUX, Gaëtan & WOLSEY, Laurence A., 2000. "bc-prod: A specialized branch-and-cut system for lot-sizing problems," LIDAM Reprints CORE 1455, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    34. Willard I. Zangwill, 1966. "A Deterministic Multi-Period Production Scheduling Model with Backlogging," Management Science, INFORMS, vol. 13(1), pages 105-119, September.
    35. WOLSEY, Laurence, 2002. "Solving multi-item lot-sizing problems with an MIP solver using classification and reformulation," LIDAM Discussion Papers CORE 2002012, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    36. MILLER, Andrew & NEMHAUSER, George & SAVELSBERGH, Martin, 2000. "Solving multi-item capacitated lot-sizing problems with setup times by branch-and-cut," LIDAM Discussion Papers CORE 2000039, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    37. Marshall L. Fisher, 1981. "The Lagrangian Relaxation Method for Solving Integer Programming Problems," Management Science, INFORMS, vol. 27(1), pages 1-18, January.
    38. 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.
    39. Uday S. Karmarkar & Sham Kekre & Sunder Kekre, 1987. "The Dynamic Lot-Sizing Problem with Startup and Reservation Costs," Operations Research, INFORMS, vol. 35(3), pages 389-398, June.
    40. 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.
    41. 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.
    42. 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.
    43. 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.
    44. 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.
    45. Hartmut Stadtler, 2003. "Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows," Operations Research, INFORMS, vol. 51(3), pages 487-502, June.
    46. 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.
    47. 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.
    48. 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.
    49. Elena Katok & Holly S. Lewis & Terry P. Harrison, 1998. "Lot Sizing in General Assembly Systems with Setup Costs, Setup Times, and Multiple Constrained Resources," Management Science, INFORMS, vol. 44(6), pages 859-877, June.
    50. 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.
    51. 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.
    52. POCHET, Yves & WOLSEY, Laurence A., 1993. "Lot-sizing with constant batches: formulation and valid inequalities," LIDAM Reprints CORE 1066, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    53. 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.
    54. Panayotis Afentakis & Bezalel Gavish, 1986. "Optimal Lot-Sizing Algorithms for Complex Product Structures," Operations Research, INFORMS, vol. 34(2), pages 237-249, April.
    55. 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.
    56. 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.
    57. Tang, Ou, 2004. "Simulated annealing in lot sizing problems," International Journal of Production Economics, Elsevier, vol. 88(2), pages 173-181, March.
    58. 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.
    59. 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.
    60. 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.
    61. 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.
    62. T. L. Magnanti & R. Vachani, 1990. "A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs," Operations Research, INFORMS, vol. 38(3), pages 456-473, June.
    63. 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.
    64. L. S. Lasdon & R. C. Terjung, 1971. "An Efficient Algorithm for Multi-Item Scheduling," Operations Research, INFORMS, vol. 19(4), pages 946-969, August.
    65. 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).
    66. P. R. Kleindorfer & E. F. P. Newson, 1975. "A Lower Bounding Structure for Lot-Size Scheduling Problems," Operations Research, INFORMS, vol. 23(2), pages 299-311, April.
    67. VAN VYVE, Mathieu, 2003. "Algorithms for single item constant capacity lotsizing problems," LIDAM Discussion Papers CORE 2003007, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    68. Willard I. Zangwill, 1966. "A Deterministic Multiproduct, Multi-Facility Production and Inventory Model," Operations Research, INFORMS, vol. 14(3), pages 486-507, June.
    69. 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.
    70. 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.
    71. 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.
    72. Wolsey, L. A., 1995. "Progress with single-item lot-sizing," LIDAM Reprints CORE 1174, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    73. Wolsey, Laurence A., 1995. "Progress with single-item lot-sizing," European Journal of Operational Research, Elsevier, vol. 86(3), pages 395-401, November.
    74. LOPARIC, Marko & MARCHAND, Hugues & WOLSEY, Laurence A., 2003. "Dynamic knapsack sets and capacitated lot-sizing," LIDAM Reprints CORE 1600, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    75. Gaetan Belvaux & Laurence A. Wolsey, 2000. "bc --- prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems," Management Science, INFORMS, vol. 46(5), pages 724-738, May.
    76. Pochet, Y. & Wolsey, L. A., 1995. "Algorithms and reformulations for lot sizing problems," LIDAM Reprints CORE 1160, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    77. Scott Webster, 1999. "Remarks on: "Some Extensions of the Discrete Lotsizing and Scheduling Problem"," Management Science, INFORMS, vol. 45(5), pages 768-769, May.
    78. 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.
    79. Fleischmann, Bernhard, 1990. "The discrete lot-sizing and scheduling problem," European Journal of Operational Research, Elsevier, vol. 44(3), pages 337-348, February.
    80. Renato de Matta & Monique Guignard, 1994. "Dynamic Production Scheduling for a Process Industry," Operations Research, INFORMS, vol. 42(3), pages 492-503, June.
    81. 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.
    82. BARANY, Imre & VAN ROY, Tony J. & WOLSEY, Laurence A., 1984. "Strong formulations for multi-item capacitated lot sizing," LIDAM Reprints CORE 590, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    83. 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.
    84. 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.
    85. 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).
    86. 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.
    87. 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.
    88. 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.
    89. Alok Aggarwal & James K. Park, 1993. "Improved Algorithms for Economic Lot Size Problems," Operations Research, INFORMS, vol. 41(3), pages 549-571, June.
    90. 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.
    91. 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.
    92. 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.
    93. 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.
    94. 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.
    95. 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.
    96. VAN VYVE, Mathieu & ORTEGA, Francisco, 2003. "Lot-sizing with fixed charges on stocks: the convex hull," LIDAM Discussion Papers CORE 2003014, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    97. Drexl, Andreas & Haase, Knut, 1995. "Proportional lotsizing and scheduling," International Journal of Production Economics, Elsevier, vol. 40(1), pages 73-87, June.
    98. François Vanderbeck, 1998. "Lot-Sizing with Start-Up Times," Management Science, INFORMS, vol. 44(10), pages 1409-1425, October.
    99. 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.
    100. C. P. M. van Hoesel & A. P. M. Wagelmans, 2001. "Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems," Mathematics of Operations Research, INFORMS, vol. 26(2), pages 339-357, May.
    101. Unknown, 1986. "Letters," Choices: The Magazine of Food, Farm, and Resource Issues, Agricultural and Applied Economics Association, vol. 1(4), pages 1-9.
    102. 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.
    103. 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.
    104. 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.
    105. Uday S. Karmarkar & Linus Schrage, 1985. "The Deterministic Dynamic Product Cycling Problem," Operations Research, INFORMS, vol. 33(2), pages 326-345, April.
    106. Cynthia Barnhart & Ellis L. Johnson & George L. Nemhauser & Martin W. P. Savelsbergh & Pamela H. Vance, 1998. "Branch-and-Price: Column Generation for Solving Huge Integer Programs," Operations Research, INFORMS, vol. 46(3), pages 316-329, June.
    107. 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.
    108. Yves Pochet & Laurence A. Wolsey, 1993. "Lot-Sizing with Constant Batches: Formulation and Valid Inequalities," Mathematics of Operations Research, INFORMS, vol. 18(4), pages 767-785, November.
    109. 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.
    110. 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.
    111. 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.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Jans, R.F. & Degraeve, Z., 2005. "Modeling Industrial Lot Sizing Problems: A Review," ERIM Report Series Research in Management ERS-2005-049-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.
    2. Brahimi, Nadjib & Dauzere-Peres, Stephane & Najid, Najib M. & Nordli, Atle, 2006. "Single item lot sizing problems," European Journal of Operational Research, Elsevier, vol. 168(1), pages 1-16, January.
    3. Kerem Akartunalı & Andrew Miller, 2012. "A computational analysis of lower bounds for big bucket production planning problems," Computational Optimization and Applications, Springer, vol. 53(3), pages 729-753, December.
    4. 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.
    5. AkartunalI, Kerem & Miller, Andrew J., 2009. "A heuristic approach for big bucket multi-level production planning problems," European Journal of Operational Research, Elsevier, vol. 193(2), pages 396-411, March.
    6. Karimi, B. & Fatemi Ghomi, S. M. T. & Wilson, J. M., 2003. "The capacitated lot sizing problem: a review of models and algorithms," Omega, Elsevier, vol. 31(5), pages 365-378, October.
    7. 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.
    8. Francesco Gaglioppa & Lisa A. Miller & Saif Benjaafar, 2008. "Multitask and Multistage Production Planning and Scheduling for Process Industries," Operations Research, INFORMS, vol. 56(4), pages 1010-1025, August.
    9. Karina Copil & Martin Wörbelauer & Herbert Meyr & Horst Tempelmeier, 2017. "Simultaneous lotsizing and scheduling problems: a classification and review of models," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(1), pages 1-64, January.
    10. 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.
    11. Kerem Akartunalı & Ioannis Fragkos & Andrew J. Miller & Tao Wu, 2016. "Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems," INFORMS Journal on Computing, INFORMS, vol. 28(4), pages 766-780, November.
    12. Helber, Stefan & Sahling, Florian, 2010. "A fix-and-optimize approach for the multi-level capacitated lot sizing problem," International Journal of Production Economics, Elsevier, vol. 123(2), pages 247-256, February.
    13. Zeger Degraeve & Raf Jans, 2007. "A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times," Operations Research, INFORMS, vol. 55(5), pages 909-920, October.
    14. Drexl, Andreas & Haase, Knut, 1992. "A new type of model for multi-item capacitated dynamic lotsizing and scheduling," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 286, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    15. Alper Atamtürk & Simge Küçükyavuz, 2005. "Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation," Operations Research, INFORMS, vol. 53(4), pages 711-730, August.
    16. François Vanderbeck, 1998. "Lot-Sizing with Start-Up Times," Management Science, INFORMS, vol. 44(10), pages 1409-1425, October.
    17. Awi Federgruen & Joern Meissner & Michal Tzur, 2007. "Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems," Operations Research, INFORMS, vol. 55(3), pages 490-502, June.
    18. Tao Wu, 2022. "Predictive Search for Capacitated Multi-Item Lot Sizing Problems," INFORMS Journal on Computing, INFORMS, vol. 34(1), pages 385-406, January.
    19. Absi, Nabil & Kedad-Sidhoum, Safia, 2008. "The multi-item capacitated lot-sizing problem with setup times and shortage costs," European Journal of Operational Research, Elsevier, vol. 185(3), pages 1351-1374, March.
    20. Brahimi, Nadjib & Absi, Nabil & Dauzère-Pérès, Stéphane & Nordli, Atle, 2017. "Single-item dynamic lot-sizing problems: An updated survey," European Journal of Operational Research, Elsevier, vol. 263(3), pages 838-863.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. 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.

    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 CitEc recognized a bibliographic reference but did not link an item in RePEc 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.