American Journal of Operations Research

Volume 11, Issue 1 (January 2021)

ISSN Print: 2160-8830   ISSN Online: 2160-8849

Google-based Impact Factor: 0.84  Citations  

Identical Machine Scheduling Problem with Sequence-Dependent Setup Times: MILP Formulations Computational Study

HTML  XML Download Download as PDF (Size: 4717KB)  PP. 15-34  
DOI: 10.4236/ajor.2021.111002    453 Downloads   1,625 Views  Citations

ABSTRACT

This work aims to give a systematic construction of the two families of mixed-integer-linear-programming (MILP) formulations, which are graph- based and sequence-based, of the well-known scheduling problem. Two upper bounds of job completion times are introduced. A numerical test result analysis is conducted with a two-fold objective 1) testing the performance of each solving methods, and 2) identifying and analyzing the tractability of an instance according to the instance structure in terms of the number of machines, of the jobs setup time lengths and of the jobs release date distribution over the scheduling horizon.

Share and Cite:

Yalaoui, F. and Quy Nguyen, N. (2021) Identical Machine Scheduling Problem with Sequence-Dependent Setup Times: MILP Formulations Computational Study. American Journal of Operations Research, 11, 15-34. doi: 10.4236/ajor.2021.111002.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.