A mixed integer programming model for integrating MRP and job shop scheduling

摘要

This paper presents a Mixed Integer Programming (MIP) model which succeeds in a systematic integration of the production planning and job shop scheduling problems. The proposed model explicitly considers capacity constraints, operation sequences, lead times and due dates in a dynamic demand environment. The objective of the model is to seek the minimum both production flow time and penalty costs including tardiness and earliness costs. The output of the model is operation schedules with order starting time and finish time. The integrated model is verified with a commercial software package and tested with a small example. The model will be further improved and meta-heuristics will be used to solve the model more efficiently.