A Lagrangean relaxation approach for capacitated lot sizing problem with setup times

Chun-Hung Cheng, Manohar S. Madan, Jaideep Motwani and Ka-Yun Yip

International Journal of Operational Research, 2013, vol. 18, issue 3, 272-303

Abstract: In this research, we consider a production planning problem that determines the production timings and quantities for multiple products over a finite number of periods without violating capacity constraints. This problem is commonly referred to as the capacitated lot sizing (CLS) problem. We develop a model that explicitly considers setup times for products and different types of production capacities such as regular time and overtime. We develop a heuristic based on Lagrangian relaxation to solve this CLS problem. Computational results show that our algorithm gives reliable results while comparing solution values to lower bounds.

Keywords: production planning; capacitated lot sizing; setup times; Lagrangean relaxation; production capacities. (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=56686 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:18:y:2013:i:3:p:272-303

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().