Journal
OPTIMIZATION LETTERS
Volume 3, Issue 4, Pages 583-592Publisher
SPRINGER HEIDELBERG
DOI: 10.1007/s11590-009-0137-6
Keywords
Flow shop scheduling; Availability constraint; Approximation algorithms; Error bound
Ask authors/readers for more resources
In this paper, we deal with a special case of the two-machine flow shop scheduling problem with several availability constraints on the second machine, under the resumable scenario. We develop an improved algorithm with a relative worst-case error bound of 4/3.
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
Share Paper
