| Article ID: | iaor1993937 |
| Country: | United States |
| Volume: | 38 |
| Issue: | 9 |
| Start Page Number: | 1329 |
| End Page Number: | 1340 |
| Publication Date: | Sep 1992 |
| Journal: | Management Science |
| Authors: | Karwan Mark H., Bahl Harish C., Diaby Moustapha, Ziont Stanley |
| Keywords: | lagrange multipliers, programming: integer |
In this paper, the authors 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. The present 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.