An Efficient Network-based Formulation for Sequence Dependent Setup Scheduling on Parallel Identical Machines
2013, Mathematical and Computer Modelling
B. Anderson, J.D. Blocher, K.M. Bretthauer, M.A. Venkataramanan
This paper compares the efficacy of a newly developed network-based mixed-integer programming (MIP) formulation with three existing formulations for the sequence dependent setup scheduling problem with earliness/tardiness penalties. This research shows that the new model is more efficient in terms of computation time for larger multi-machine problems than the existing formulations of these problems. The mixed-integer nature of the formulation allows companies to solve this class of problems with any one of many commonly available integer programming software packages. The presented MIP formulation provides a unique and useful method of conceptualizing and modeling a practical, yet difficult, problem within industry.
Anderson, B., J.D. Blocher, K.M. Bretthauer, M.A. Venkataramanan (2013), "An Efficient Network-based Formulation for Sequence Dependent Setup Scheduling on Parallel Identical Machines", Mathematical and Computer Modelling, 57, pp.483-493.