Computationally Efficient Optimal Solutions to the Lot-Sizing Problem in Multistage Assembly Systems

Panayotis Afentakis, Bezalel Gavish and Uday Karmarkar
Additional contact information
Panayotis Afentakis: Syracuse University
Bezalel Gavish: University of Rochester
Uday Karmarkar: University of Rochester

Management Science, 1984, vol. 30, issue 2, 222-239

Abstract: The scheduling of lot sizes in multistage production environments is a fundamental problem in many Material Requirements Planning Systems. Many heuristics have been suggested for this problem with varying degrees of success. Research to date on obtaining optimal solutions has been limited to small problems. This paper presents a new formulation of the lot-sizing problem in multistage assembly systems which leads to an effective optimization algorithm for the problem. The problem is reformulated in terms of "echelon stock" which simplifies its decomposition by a Lagrangean relaxation method. A Branch and Bound algorithm which uses the bounds obtained by the relaxation was developed and tested. Computational results are reported on 120 randomly generated problems involving up to 50 items in 15 stages and up to 18 time periods in the planning horizon.

Keywords: MRP systems; lot sizing in MRP systems; multistage assembly systems (search for similar items in EconPapers)
Date: 1984
References: Add references at CitEc
Citations: View citations in EconPapers (29)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.30.2.222 (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:30:y:1984:i:2:p:222-239

Access Statistics for this article

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