Journal
OPTIMIZATION LETTERS
Volume 6, Issue 3, Pages 559-569Publisher
SPRINGER HEIDELBERG
DOI: 10.1007/s11590-011-0281-7
Keywords
Flow shop; Scheduling; Availability constraint; Approximation scheme
Ask authors/readers for more resources
In this paper, we develop a polynomial-time approximation scheme for the two-machine flow shop scheduling problem with several availability constraints on the first machine, under the resumable scenario.
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
