A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups
Sidney, Jeffrey B., Potts, Chris N. and Sriskandarajah, Chelliah (2000) A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups. Operations Research Letters, 26, (4), 165-173. (doi:10.1016/S0167-6377(00)00019-5).
Full text not available from this repository.
We consider a problem of scheduling jobs in two-machine no-wait flow shops for which the objective is to minimize the makespan. Each job, upon completion of its processing on the first machine, must be transferred immediately to the second machine due to a no-wait in process constraint. Every job requires a setup time on each machine before it is processed. The setup on the second machine is anticipatory, since it can be performed in advance of an arriving job, and consists of two parts. During the first part of the setup, the job should not be present in the machine, while the second part of setup can be done in the presence or absence of the job. A heuristic algorithm is proposed, and its worst-case performance ratio of 4/3 is established.
|Keywords:||no-wait flow shop, deterministic scheduling, setup, heuristic algorithm, worst-case analysis, performance bounds|
|Subjects:||Q Science > QA Mathematics|
|Divisions:||University Structure - Pre August 2011 > School of Mathematics > Operational Research
|Date Deposited:||19 Jul 2006|
|Last Modified:||27 Mar 2014 18:18|
|Contact Email Address:||firstname.lastname@example.org|
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Actions (login required)