Mixed integer programming formulations for new jobs rescheduling on single machine to minimize maximum waiting-times

摘要

In this paper, a rescheduling problem involving annealing welding in a quartz glass factory is studied. Two different mixed integer programming (MIP) formulations for the problem are presented first, and the NP-hardness of this rescheduling problem is analyzed. Then the computational performance of two different MIP is analysised. Further, based on the comparison results, we discuss which MIP formulation might work better for the problem and propose the future work.