IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v37y2009i1p3-15.html
   My bibliography  Save this article

Coordinated deterministic dynamic demand lot-sizing problem: A review of models and algorithms

Author

Listed:
  • Robinson, Powell
  • Narayanan, Arunachalam
  • Sahin, Funda

Abstract

Due to their importance in industry and mathematical complexity, dynamic demand lot-sizing problems are frequently studied. In this article, we consider coordinated lot-size problems, their variants and exact and heuristic solutions approaches. The problem class provides a comprehensive approach for representing single and multiple items, coordinated and uncoordinated setup cost structures, and capacitated and uncapacitated problem characteristics. While efficient solution approaches have eluded researchers, recent advances in problem formulation and algorithms are enabling large-scale problems to be effectively solved. This paper updates a 1988 review of the coordinated lot-sizing problem and complements recent reviews on the single-item lot-sizing problem and the capacitated lot-sizing problem. It provides a state-of-the-art review of the research and future research projections. It is a starting point for anyone conducting research in the deterministic dynamic demand lot-sizing field.

Suggested Citation

  • Robinson, Powell & Narayanan, Arunachalam & Sahin, Funda, 2009. "Coordinated deterministic dynamic demand lot-sizing problem: A review of models and algorithms," Omega, Elsevier, vol. 37(1), pages 3-15, February.
  • Handle: RePEc:eee:jomega:v:37:y:2009:i:1:p:3-15
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305-0483(06)00149-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. Ben-Daya, M. & Hariga, M., 1995. "Comparative study of heuristics for the joint replenishment problem," Omega, Elsevier, vol. 23(3), pages 341-344, June.
    2. 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.
    3. 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.
    4. E. Powell Robinson, Jr. & Li-Lian Gao, 1996. "A Dual Ascent Procedure for Multiproduct Dynamic Demand Coordinated Replenishment with Backlogging," Management Science, INFORMS, vol. 42(11), pages 1556-1564, November.
    5. Armentano, Vinícius A. & França, Paulo M. & de Toledo, Franklina M. B., 1999. "A network flow model for the capacitated lot-sizing problem," Omega, Elsevier, vol. 27(2), pages 275-284, April.
    6. Arthur F. Veinott, 1969. "Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems," Operations Research, INFORMS, vol. 17(2), pages 262-291, April.
    7. ter Haseborg, Fokko, 1982. "On the optimality of joint ordering policies in a multi-product dynamic lot size model with individual and joint set-up costs," European Journal of Operational Research, Elsevier, vol. 9(1), pages 47-55, January.
    8. Wen-Lian Hsu, 1983. "On the General Feasibility Test of Scheduling Lot Sizes for Several Products on One Machine," Management Science, INFORMS, vol. 29(1), pages 93-105, January.
    9. B Karimi & S M T Fatemi Ghomi & J M Wilson, 2006. "A tabu search heuristic for solving the CLSP with backlogging and set-up carry-over," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(2), pages 140-147, February.
    10. HSU, Wen-Lian, 1983. "On the general feasibility test of scheduling lot sizes for several products on one machine," LIDAM Reprints CORE 515, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    11. Dev Joneja, 1990. "The Joint Replenishment Problem: New Heuristics and Worst Case Performance Bounds," Operations Research, INFORMS, vol. 38(4), pages 711-723, August.
    12. Wildeman, R.E. & Frenk, J.B.G. & Dekker, R., 1997. "An efficient optimal solution method for the joint replenishment problem," European Journal of Operational Research, Elsevier, vol. 99(2), pages 433-444, June.
    13. Koulamas, C & Antony, SR & Jaen, R, 1994. "A survey of simulated annealing applications to operations research problems," Omega, Elsevier, vol. 22(1), pages 41-56, January.
    14. Pan, C-H, 1994. "Sensitivity analysis of dynamic lot-sizing heuristics," Omega, Elsevier, vol. 22(3), pages 251-261, May.
    15. Edward P. C. Kao, 1979. "A Multi-Product Dynamic Lot-Size Model with Individual and Joint Set-up Costs," Operations Research, INFORMS, vol. 27(2), pages 279-289, April.
    16. 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.
    17. 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.
    18. Goyal, Suresh K. & Satir, Ahmet T., 1989. "Joint replenishment inventory control: Deterministic and stochastic models," European Journal of Operational Research, Elsevier, vol. 38(1), pages 2-13, January.
    19. 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.
    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. Narayanan, Arunachalam & Robinson, Powell, 2010. "Efficient and effective heuristics for the coordinated capacitated lot-size problem," European Journal of Operational Research, Elsevier, vol. 203(3), pages 583-592, June.
    2. 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.
    3. 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.
    4. Bruno, Giuseppe & Genovese, Andrea & Piccolo, Carmela, 2014. "The capacitated Lot Sizing model: A powerful tool for logistics decision making," International Journal of Production Economics, Elsevier, vol. 155(C), pages 380-390.
    5. 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.
    6. Melega, Gislaine Mara & de Araujo, Silvio Alexandre & Jans, Raf, 2018. "Classification and literature review of integrated lot-sizing and cutting stock problems," European Journal of Operational Research, Elsevier, vol. 271(1), pages 1-19.
    7. Fink, Jiří & Hurink, Johann L., 2015. "Minimizing costs is easier than minimizing peaks when supplying the heat demand of a group of houses," European Journal of Operational Research, Elsevier, vol. 242(2), pages 644-650.
    8. Toledo, Franklina Maria Bragion & Armentano, Vinicius Amaral, 2006. "A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines," European Journal of Operational Research, Elsevier, vol. 175(2), pages 1070-1083, December.
    9. Yajaira Cardona-Valdés & Samuel Nucamendi-Guillén & Rodrigo E. Peimbert-García & Gustavo Macedo-Barragán & Eduardo Díaz-Medina, 2020. "A New Formulation for the Capacitated Lot Sizing Problem with Batch Ordering Allowing Shortages," Mathematics, MDPI, vol. 8(6), pages 1-16, June.
    10. Rizk, Nafee & Martel, Alain & Ramudhin, Amar, 2006. "A Lagrangean relaxation algorithm for multi-item lot-sizing problems with joint piecewise linear resource costs," International Journal of Production Economics, Elsevier, vol. 102(2), pages 344-357, August.
    11. E P Robinson & A Narayanan & L-L Gao, 2007. "Effective heuristics for the dynamic demand joint replenishment problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(6), pages 808-815, June.
    12. Danny Segev, 2014. "An Approximate Dynamic-Programming Approach to the Joint Replenishment Problem," Mathematics of Operations Research, INFORMS, vol. 39(2), pages 432-444, May.
    13. Sahling, Florian & Buschkühl, Lisbeth & Tempelmeier, Horst & Helber, Stefan, 2008. "Solving a Multi-Level Capacitated Lot Sizing Problem with Multi-Period Setup Carry-Over via a Fix-and-Optimize Heuristic," Hannover Economic Papers (HEP) dp-400, Leibniz Universität Hannover, Wirtschaftswissenschaftliche Fakultät.
    14. Weidenhiller, Andreas & Jodlbauer, Herbert, 2009. "Equivalence classes of problem instances for a continuous-time lot sizing and scheduling problem," European Journal of Operational Research, Elsevier, vol. 199(1), pages 139-149, November.
    15. Khouja, Moutaz & Goyal, Suresh, 2008. "A review of the joint replenishment problem literature: 1989-2005," European Journal of Operational Research, Elsevier, vol. 186(1), pages 1-16, April.
    16. Martel, Alain & Diaby, Moustapha & Boctor, Fayez, 1995. "Multiple items procurement under stochastic nonstationary demands," European Journal of Operational Research, Elsevier, vol. 87(1), pages 74-92, November.
    17. Boonmee, Atiwat & Sethanan, Kanchana, 2016. "A GLNPSO for multi-level capacitated lot-sizing and scheduling problem in the poultry industry," European Journal of Operational Research, Elsevier, vol. 250(2), pages 652-665.
    18. Narayanan, Arunachalam & Robinson, Powell, 2010. "Evaluation of joint replenishment lot-sizing procedures in rolling horizon planning systems," International Journal of Production Economics, Elsevier, vol. 127(1), pages 85-94, September.
    19. Wildeman, R.E. & Frenk, J.B.G. & Dekker, R., 1997. "An efficient optimal solution method for the joint replenishment problem," European Journal of Operational Research, Elsevier, vol. 99(2), pages 433-444, June.
    20. Wolter, Anja & Helber, Stefan, 2013. "Simultaneous Production and Maintenance Planning for a Single Capacitated Resource facing both a Dynamic Demand and Intensive Wear and Tear," Hannover Economic Papers (HEP) dp-522, Leibniz Universität Hannover, Wirtschaftswissenschaftliche Fakultät.

    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:jomega:v:37:y:2009:i:1:p:3-15. 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/wps/find/journaldescription.cws_home/375/description#description .

    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.