A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups
A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups
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.
no-wait flow shop, deterministic scheduling, setup, heuristic algorithm, worst-case analysis, performance bounds
165-173
Sidney, Jeffrey B.
34912645-84ff-4724-9423-35e3b706ade7
Potts, Chris N.
58c36fe5-3bcb-4320-a018-509844d4ccff
Sriskandarajah, Chelliah
b3becb96-781c-4102-8289-c5b6eda0065e
2000
Sidney, Jeffrey B.
34912645-84ff-4724-9423-35e3b706ade7
Potts, Chris N.
58c36fe5-3bcb-4320-a018-509844d4ccff
Sriskandarajah, Chelliah
b3becb96-781c-4102-8289-c5b6eda0065e
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), .
(doi:10.1016/S0167-6377(00)00019-5).
Abstract
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.
This record has no associated files available for download.
More information
Published date: 2000
Keywords:
no-wait flow shop, deterministic scheduling, setup, heuristic algorithm, worst-case analysis, performance bounds
Organisations:
Operational Research
Identifiers
Local EPrints ID: 29613
URI: http://eprints.soton.ac.uk/id/eprint/29613
ISSN: 0167-6377
PURE UUID: ff65e3a5-db09-4dc9-9cff-b74773e9d99d
Catalogue record
Date deposited: 19 Jul 2006
Last modified: 15 Mar 2024 07:33
Export record
Altmetrics
Contributors
Author:
Jeffrey B. Sidney
Author:
Chelliah Sriskandarajah
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics