An algorithm using Lagrangean relaxation and decomposition for solving a capacitated lot-sizing problem

Chun Hung Cheng, Manohar S. Madan, Angappa Gunasekaran, Ka Yun Yip

Research output: Contribution to journalArticlepeer-review

5 Scopus citations


In this research, we formulate and solve a type of the capacitated lotsizing (CLS) problem. This problem is commonly found in many manufacturing settings. Unlike a typical formulation, our formulation explicitly considers different types of production capacities such as regular time and overtime. We develop a heuristic based on Lagrangean relaxation with a decomposition scheme to solve this CLS problem. Computational results show that our algorithm gives very good results while comparing to lower bounds.

Original languageEnglish (US)
Pages (from-to)205-232
Number of pages28
JournalInternational Journal of Mathematics in Operational Research
Issue number2
StatePublished - Jan 2010

All Science Journal Classification (ASJC) codes

  • Decision Sciences(all)
  • Modeling and Simulation

Cite this