Skip to main content
SpringerLink
Log in

A Lagrangian heuristic for capacitated single item lot sizing problems

  • Research paper
  • Published:
4OR Aims and scope Submit manuscript

Abstract

This paper presents a new Lagrangian heuristic to solve the general capacitated single item lot sizing problem (CSILSP) where the total costs of production, setup, and inventory are to be minimized. We introduce a pre-smoothing procedure to transform the problem into a CSILSP with non-customer specific time windows and relax constraints that are specific to the CSILSP. The resulting uncapacitated single item problems with non-customer specific production time windows can be solved in polynomial time. We also analyze the performance of the Lagrangian heuristic for solving the CSILSP with non-customer specific time windows. Finally, the heuristic is adapted to the customer specific case. The introduction of pre-smoothing and the relaxation of CSILSP-specific constraints help to decrease the gap between lower bounds and upper bounds from 26.22 to 1.39 %, on average. The heuristic can be used to solve aggregate production planning problems, or can be integrated into a general procedure to solve more complex lot sizing problems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

Similar content being viewed by others

References

  • Akbalik A, Pochet Y (2009) Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs. Eur J Oper Res 198:412–434

    Article  Google Scholar 

  • Billington P, McClain J, Thomas L (1986) Heuristics for multilevel lot-sizing with a bottleneck. Manag Sci 32:989–1006

    Article  Google Scholar 

  • Bitran G, Yanasse H (1982) Computational complexity of the capacitated lot size problem. Manag Sci 28:1174–1186

    Article  Google Scholar 

  • Bitran GR, Magnanti TL, Yanasse HH (1984) Approximation methods for the uncapacitated dynamic lot size problem. Manag Sci 30:1121–1140

    Article  Google Scholar 

  • Brahimi N, Dauzère-Pérès S, Najid N (2006a) Capacitated multi-multi item lot sizing problems with time windows. Oper Res 54:951–967

    Article  Google Scholar 

  • Brahimi N, Dauzère-Pérès S, Najid N, Nordli A (2006b) Single item lot sizing problems. Eur J Oper Res 168:1–16

    Article  Google Scholar 

  • Brahimi N, Absi N, Dauzère-Pérès S, Kedad-Sidhoum S (2010a) Mathematical models and lagrangian heuristics for a two-level lot-sizing problem with bounded inventory. 8ème Conférence Francophone de Modélisation et Simulation, MOSIM, Hammamet, Tunisia

  • Brahimi N, Dauzère-Pérès S, Wolsey LA (2010b) Polyhedral and lagrangian approaches for lot sizing with production time windows and setup times. Comput Oper Res 37:182–188

    Article  Google Scholar 

  • Buschkühl L, Sahling F, Helber S, Tempelmeier H (2010) Dynamic capacitated lot-sizing problems: a classification and review of solution approaches. OR Spectr 32:231–261

    Article  Google Scholar 

  • Chen H-D, Hearn DW, Lee C-Y (1994) A new dynamic programming algorithm for the single item capacitated dynamic lot size model. J Glob Optim 4:285–300

    Article  Google Scholar 

  • Chen W, Thizy J (1990) Analysis of relaxations for the multi-item capacitated lot-sizing problem. Ann Oper Res 26:29–72

    Article  Google Scholar 

  • Dauzère-Pérès S, Brahimi N, Najid N, Nordli A (2002) The single-item lot sizing problem with time windows. Technical report, 02/4/AUTO, Ecole des Mines de Nantes, France. https://www.researchgate.net/publication/239919300_Uncapacitated_Lot-Sizing_Problems_with_Time_Windows

  • Dixon P, Silver E (1981) A heuristic solution procedure for the multi-item, single-level, limited-capacity, lot-sizing problem. J Oper Manag 2:23–39

    Article  Google Scholar 

  • FICO (2013) Xpress-ive. Web: http://www.FICO.com

  • Florian M, Klein M (1971) Deterministic production planning with concave costs and capacity constraints. Manag Sci 18:12–20

    Article  Google Scholar 

  • Hardin JR, Nemhauser GL, Savelsbergh MW (2007) Analysis of bounds for a capacitated single-item lot-sizing problem. Comput Oper Res 34:1721–1743

    Article  Google Scholar 

  • Held M, Worlfe P, Crowder H (1974) Validation of subgradient optimization. Math Program 6:62–88

    Article  Google Scholar 

  • Hwang H-C (2007) Dynamic lot-sizing model with production time windows. Naval Res Logist 54:692–701

    Article  Google Scholar 

  • Hwang H-C, Jaruphongsa W (2008) Dynamic lot-sizing model for major and minor demands. Eur J Oper Res 184:711–724

    Article  Google Scholar 

  • Love S (1973) Bounded production and inventory models with piecewise concave costs. Manag Sci 20(3):313–318

    Article  Google Scholar 

  • Maes J, Van Wassenhove L (1986) A simple heuristic for the multi-item, single level capacitated lot sizing problem. Oper Res Lett 4:265–273

    Article  Google Scholar 

  • Merle Od, Goffin J-L, Trouiller C, Vial J-P (2000) Pardalos PM (ed) A lagrangian relaxation of the capacitated multi-item lot sizing problem solved with an interior point cutting plane algorithm. Approximation and complexity in numerical optimization. Springer, US, number 42 in Nonconvex optimization and its applications, pp 380–405

  • Millar H, Yang M (1994) Lagrangian heuristics for the capacitated multi-item lot-sizing problem with backordering. Int J Prod Econ 34:1–15

    Article  Google Scholar 

  • Nahmias S (1982) Perishable inventory theory: a review. Oper Res 30:680–708

    Article  Google Scholar 

  • Ou J (2012) Economic lot sizing with constant capacities and concave inventory costs. Naval Res Logist 59:497–501

    Article  Google Scholar 

  • Parker R, Rardin R (1988) Discrete optimization. Academic Press, San Diego

    Google Scholar 

  • Quadt D, Kuhn H (2008) Capacitated lot-sizing with extensions: a review. 4OR, 6, pp 61–83

  • Saydam C, Evans J (1990) Comparative performance analysis of the wagner-whitin algorithm and lot-sizing heuristics. Comput Indus Eng 18:91–93

    Article  Google Scholar 

  • Shaw D, Wagelmans A (1998) An algorithm for single-item capacitated economic lot sizing with piecewise linear production costs and general holding costs. Manag Sci 44:831–838

    Article  Google Scholar 

  • Silver E, Meal H (1973) A heuristic for selecting lot size quantities for the case of a deterministic time-varying demand rate and discrete opportunities for replenishment. Prod Invent Manag 14:64–74

    Google Scholar 

  • Simpson V (1978) Optimum solution structure for a repairable inventory problem. Oper Res 26:270–281

    Article  Google Scholar 

  • Thizy J, van Wassenhove L (1986) A subgradient algorithm for the multi-item capacitated lot-sizing problem. IIE Trans 18:114–123

    Article  Google Scholar 

  • Thizy J-M, Van Wassenhove L (1985) Lagrangean relaxation for the multi-item capacitated lot-sizing problem: a heuristic implementation. IIE Trans (Institute of Industrial Engineers) 17:308–313

    Google Scholar 

  • Toledo FMB, Armentano VA (2006) A lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines. Eur J Oper Res 175:1070–1083

    Article  Google Scholar 

  • Trigeiro W, Thomas L, McClain J (1989) Capacitated lot sizing with set-up times. Manag Sci 35:353–366

    Article  Google Scholar 

  • Vachani R (1992) Performance of heuristics for the uncapacitated lot-size problem. Naval Res Logist (NRL) 39:801–813

    Article  Google Scholar 

  • van den Heuvel W, Wagelmans AP (2008) Four equivalent lot-sizing models. Oper Res Lett 36:465–470

    Article  Google Scholar 

  • Van Hoesel C, Wagelmans A (1996) O(t3) algorithm for the economic lot-sizing problem with constant capacities. Manag Sci 42:142

    Article  Google Scholar 

  • Van Hoesel C, Wagelmans A (2001) Fully polynomial approximation schemes for single-item capacitated economic lot-sizing problems. Math Oper Res 26:339–357

    Article  Google Scholar 

  • Wagelmans A, van Hoesel S, Kolen A (1992) Economic lot sizing an o(n log n) algorithm that runs in linear time in the wagner-whitin case. Oper Res 40:145

    Article  Google Scholar 

  • Wagner H, Whitin T (1958) Dynamic version of the economic lot size model. Manag Sci 5:89–96

    Article  Google Scholar 

  • Wolsey L (2006) Lot-sizing with production and delivery time windows. Math Program Ser A 107:471–489

    Article  Google Scholar 

  • Zamani R, Lau SK (2010) Embedding learning capability in lagrangean relaxation: an application to the travelling salesman problem. Eur J Oper Res 201:82–88

    Article  Google Scholar 

  • Zangwill W (1969) A backlogging model and a multi-echelon model of a dynamic economic lot size production system: a network approach. Manag Sci 15:506–527

    Article  Google Scholar 

Download references

Acknowledgments

The authors would like to express their gratitude to the anonymous reviewers for their very helpful comments which considerably contributed to the improvement of the quality of this paper.

Author information

Authors and Affiliations

  1. Department of Industrial Engineering and Management, College of Engineering, University of Sharjah, P.O. Box 27272, Sharjah, United Arab Emirates

    Nadjib Brahimi

  2. Department of Manufacturing Sciences and Logistics, CNRS UMR 6158, LIMOS, Ecole des Mines de Saint-Etienne - CMP, 13541 , Gardanne, France

    Stéphane Dauzère-Pérès

Authors
  1. Nadjib Brahimi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stéphane Dauzère-Pérès
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nadjib Brahimi.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Brahimi, N., Dauzère-Pérès, S. A Lagrangian heuristic for capacitated single item lot sizing problems. 4OR-Q J Oper Res 13, 173–198 (2015). https://doi.org/10.1007/s10288-014-0266-3

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10288-014-0266-3

Keywords

Mathematics Subject Classification

Search

Navigation