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.

• 저널Management Science · 29(10) · 1126–1141
• 토픽Scheduling and Optimization Algorithms · Industrial and Manufacturing Engineering
• DOI10.1287/mnsc.29.10.1126
• 저자Peter J. Billington, John O. McClain