Mathematical Programming Approaches to Capacity-Constrained MRP Systems: Review, Formulation and Problem Reduction
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.
Volume (Year): 29 (1983)
Issue (Month): 10 (October)
|Contact details of provider:|| Postal: 7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA|
Web page: http://www.informs.org/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:29:y:1983:i:10:p:1126-1141. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc)
If references are entirely missing, you can add them using this form.