Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
