Journal
4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH
Volume 8, Issue 3, Pages 271-280Publisher
SPRINGER HEIDELBERG
DOI: 10.1007/s10288-010-0119-7
Keywords
Flow shop scheduling; Availability constraint; Heuristics; Worst case analysis; Polynomially solvable case
Categories
Ask authors/readers for more resources
In this paper we deal with the two-machine flow shop scheduling problem with several availability constraints on the first machine, under the resumable scenario. We first develop an improved algorithm with a relative worst-case error bound of 4/3. We then present a polynomially solvable case.
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
