Identical Machine Scheduling Problem with Sequence-Dependent Setup Times: MILP Formulations Computational Study
Résumé
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.