An efficient network-based formulation for sequence dependent setup scheduling on parallel identical machines

作者：Anderson Bradley E^*; Blocher James D; Bretthauer Kurt M; Venkataramanan Munirpallam A

来源：Mathematical and Computer Modelling, 2013, 57(3-4): 483-493.

DOI：10.1016/j.mcm.2012.06.029

• Sequence-dependent setups
• Scheduling
• Mixed integer programming
• Earliness
• Tardiness

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. Published by Elsevier Ltd

• 出版日期2013-2