Reducing the Number of Changeover Constraints in a MIP Formulation of a Continuous-Time Scheduling Problem

Pavel A. Borisovsky, Anton V. Eremeev, Josef Kallrath

In this paper, we develop a new formulation of changeover constraints for mixed integer programming problem (MIP) that emerges in solving a short-term production scheduling problem…