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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.