A continuous-time MILP to compute schedules with minimum changeover times for a make-and- pack production

摘要

In this paper we present a MILP formulation for the short-term scheduling of a real-world make-and-pack production facility of Procter & Gamble. The model accounts for sequence-dependent changeover times, multipurpose storage units with finite capacities, quarantine times, batch splitting, partial equipment connectivity, and transfer times. The planning problem consists in minimizing the total time required for changeovers while meeting given end-product demands within a prescribed planning horizon. Our computational results show that moderate-sized instances of the case study can be solved to optimality within short CPU times.