Mathematical Programming Approaches to Capacity-Constrained MRP Systems: Review, Formulation and Problem Reduction
Peter J. Billington,
John O. McClain and
L. Joseph Thomas
Additional contact information
Peter J. Billington: Northeastern University
John O. McClain: Cornell University
L. Joseph Thomas: Cornell University
Management Science, 1983, vol. 29, issue 10, 1126-1141
Abstract:
This paper introduces a line of research on capacity-constrained multi-stage production scheduling problems. The first section introduces the problem area as it arises from a failure of MRP systems. Then a review of the literature and an analysis of the type of problems that exist are presented in §2. Section 3 outlines linear and mixed integer-linear programming formulations. These formulations compute the required production lead times according to the demands on available capacity, thereby reducing in-process inventory compared to the usual practice in MRP. A discussion of how to use the LP version is included. However, the size of the problems in practice implies that more efficient solution techniques must be found. The final topic of this paper, Product Structure Compression, is introduced as a method to reduce the size of the problem without losing optimality.
Keywords: inventory/production: material requirements planning; programming: large-scale systems; programming: integer; applications (search for similar items in EconPapers)
Date: 1983
References: Add references at CitEc
Citations: View citations in EconPapers (66)
Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.29.10.1126 (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:29:y:1983:i:10:p:1126-1141
Access Statistics for this article
More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().