A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing

Moustapha Diaby, Harish C. Bahl, Mark H. Karwan and Stanley Zionts
Additional contact information
Moustapha Diaby: College of Business, Arizona State University, Tempe, Arizona 85287
Harish C. Bahl: College of Business, California State University, Chico, California 95929-0011
Mark H. Karwan: Department of Industrial Engineering, State University of New York at Buffalo, Buffalo, New York 14260
Stanley Zionts: School of Management, State University of New York at Buffalo, Buffalo, New York 14260

Management Science, 1992, vol. 38, issue 9, 1329-1340

Abstract: In this paper, we develop a Lagrangean relaxation-based heuristic procedure to generate near-optimal solutions to very-large-scale capacitated lot-sizing problems (CLSP) with setup times and limited overtime. Our computational results show that large problems involving several thousand products and several thousand 0/1 integer variables can be solved in a reasonable amount of computer time to within one percent of their optimal solution. The proposed procedure is general enough to be applied directly or with slight modification to real-life production problems.

Keywords: inventory/production; deterministic models; inventory/production; material requirements planning; programming; large scale systems (search for similar items in EconPapers)
Date: 1992
References: Add references at CitEc
Citations: View citations in EconPapers (41)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.38.9.1329 (application/pdf)

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:inm:ormnsc:v:38:y:1992:i:9:p:1329-1340

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().