Skip to Main content Skip to Navigation
Journal articles

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

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 Pm|rj,sij|∑Cj. 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.
Document type :
Journal articles
Complete list of metadata

https://hal-utt.archives-ouvertes.fr/hal-03272912
Contributor : Daniel Gavrysiak Connect in order to contact the contributor
Submitted on : Monday, June 28, 2021 - 4:54:23 PM
Last modification on : Friday, August 27, 2021 - 3:14:02 PM

Links full text

Identifiers

Collections

UTT

`

Citation

Farouk Yalaoui, Nhan Quy Nguyen. Identical Machine Scheduling Problem with Sequence-Dependent Setup Times: MILP Formulations Computational Study. American Journal of Operations Research, 2021, 11 (01), pp.15-34. ⟨10.4236/ajor.2021.111002⟩. ⟨hal-03272912⟩

Share

Metrics

Record views

18