An Improved MILP Modeling of Sequence-Dependent Switchovers for Discrete-Time Scheduling Problems

This paper presents a new mixed-integer linear program (MILP) formulation for modeling sequence-dependent switchovers for uniform discrete-time scheduling problems. The new formulation provides solutions faster than the formulation found in the paper by Kondili et al. (Comput. Chem. Eng. 1993, 17, 211) and scales more efficiently. The key to this formulation is the use of memory operation logic variables that track the temporal unit-operation …