An Efficient Network-Based Formulation for Sequence Dependent Setup Scheduling on Parallel Identical Machines
Document Type
Article
Publication Date
2-2013
Abstract
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. Abstract © Elsevier
DOI
10.1016/j.mcm.2012.06.029
Source Publication
Mathematical and Computer Modelling
Recommended Citation
Anderson, B. E., Blocher, J. D., Bretthauer, K. M., & Venkataramanan, M. (2013). An efficient network-based formulation for sequence dependent setup scheduling on parallel identical machines. Mathematical and Computer Modelling, 57(3–4), 483–493. https://doi.org/10.1016/j.mcm.2012.06.029
Comments
The "Link to Full Text" button on this page loads the open access article version of record, hosted at Elsevier. The publisher retains permissions to re-use and distribute this article.