The Multi-Item Capacitated Lot Size Problem: Error Bounds of Manne's Formulations

Gabriel R. Bitran and Hirofumi Matsuo
Additional contact information
Gabriel R. Bitran: Alfred P. Sloan School of Management, Massachusetts Institute of Technology, Cambridge, Massachusetts 02138

Management Science, 1986, vol. 32, issue 3, 350-359

Abstract: We discuss an approximation scheme for the multi-item lot size problem. It is based on an optimal basic solution of a linear programming problem derived from the original problem. The approximate solution is obtained by taking a linear convex combination of the optimal solution of the linear programming problem. We express error bounds of the approximation as a function of some parameters that can be easily estimated in practice. When set-up times are positive, the approximation may result in an infeasible solution. We take the same approach to show that the infeasibility of the approximation is small. The analysis is extended to a variable capacity problem with overtime. As an auxiliary result, we provide a bound on the duality gap of the Lagrangian dual problem.

Keywords: lot sizing; production planning; heuristics: worst case analysis (search for similar items in EconPapers)
Date: 1986
References: Add references at CitEc
Citations: View citations in EconPapers (15)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.32.3.350 (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:32:y:1986:i:3:p:350-359

Access Statistics for this article

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