%0 Journal Article
%T Identical Machine Scheduling Problem with Sequence-Dependent Setup Times: MILP Formulations Computational Study
%A Farouk Yalaoui
%A Nhan Quy Nguyen
%J American Journal of Operations Research
%P 15-34
%@ 2160-8849
%D 2021
%I Scientific Research Publishing
%R 10.4236/ajor.2021.111002
%X This
work aims to give a systematic construction of the two families of
mixed-integer-linear-programming (MILP) formulations, which are graph-<span style=\"font-family:;\" \"=\"\"> </span><span style=\"font-family:Verdana;\">based
and sequence-based, of the well-known scheduling problem<img src=\"Edit_41010f25-7ca5-482c-89be-790fad4616e1.png\" alt=\"\" /></span><span style=\"font-family:Verdana;text-align:justify;\">. 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.</span> 
<div>
	<span style=\"font-family:Verdana;text-align:justify;\"><br />
</span> 
</div>
%K Identical Machine Scheduling Problem
%K Release Date
%K Sequence Dependent Setup Time
%U http://www.scirp.org/journal/PaperInformation.aspx?PaperID=106649