A mathematical programming approach towards optimized master production scheduling

The conventional material requirements planning (MRP) and master production scheduling (MPS) systems have gained wide acceptance among production management and control. In this paper, we consider further an aggregate optimization model for the usual MRP/MPS. That is, under a realistic assumption th...

Full description

Saved in:
Bibliographic Details
Published inInternational journal of production economics Vol. 38; no. 2; pp. 269 - 279
Main Author Chu, Sydney C.K.
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 01.03.1995
Elsevier Science
Elsevier
Elsevier Sequoia S.A
SeriesInternational Journal of Production Economics
Subjects
Applied sciences
Exact sciences and technology
Linear programming
Material requirements planning
Mathematical programming
Operational research and scientific management
Operational research. Management science
Operations research
Optimization
Planning. Forecasting
Production planning
Production scheduling
Studies
Decision support systems
Material requirements planning
Production control
Linear programming
Numerical simulation
Master production schedule
Modeling
Make to order manufacturing
Optimization
Method study
Online AccessGet full text

Cover

More Information
Summary:The conventional material requirements planning (MRP) and master production scheduling (MPS) systems have gained wide acceptance among production management and control. In this paper, we consider further an aggregate optimization model for the usual MRP/MPS. That is, under a realistic assumption that the availability of material accumulates over time, we seek an optimal production schedule for most profitable operation subject to various capacity constraints. To this end, linear programming formulations are given for various levels of model complexity, ranging from a basic product-mix problem to a global aggregate production planning problem. We examine stage-wise decomposition from the point of view of practical computational feasibility and study the robustness of this decomposition. Finally, simplified numerical results are provided as illustrations.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ISSN:0925-5273
1873-7579
DOI:10.1016/0925-5273(95)00015-G