Abstract
The n-job 2-machine flow shop problem with arbitrary precedence constraints is considered. A branch and bound algorithm which minimises the makespan is described. The bounds are computed by solving relaxed problems in which the constraints have a series-parallel form.
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
