Journal
INFORMATION PROCESSING LETTERS
Volume 90, Issue 6, Pages 273-278Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ipl.2004.03.004
Keywords
approximation algorithms; flow shop scheduling; worst-case analysis
Categories
Ask authors/readers for more resources
We study the problem of scheduling n jobs in a two-machine flow shop where the second machine is not available for processing during a given time interval. A resumable scenario is assumed, i.e., if a job cannot be finished before the down period it is continued after the machine becomes available again. The objective is to minimize the makespan. The best fast approximation algorithm for this problem guarantees a relative worst-case error bound of 4/3. We present an improved algorithm with a relative worst-case error bound of 5/4. (C) 2004 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available