Cyclic scheduling and re-scheduling in response to change of product mix

摘要

This paper deals with a cyclic job shop scheduling problem requiring agile planning of an appropriate production schedule corresponding to a change of product mix. The product mix, which is defined as the total composite of products offered by a company, is generally changed to meet demand in a market. We propose the formulation of a cyclic scheduling problem in the form of mixed integer programming to plan optimum schedules under different product mix conditions. We also introduce a formulation of the re-scheduling problem that allows shifting to a new production schedule as soon as possible. Numerical simulations are carried out to verify the proposed formulations.