Abstract
We address the flow-shop scheduling problem with two machines and time delays in order to minimize the makespan, i.e, the maximum completion time. We propose an exact algorithm based on a branch-and-bound enumeration scheme, for which we introduce a heuristic method based on a local search technique and three dominance rules. Finally, we present a computer simulation of the branch-and-bound algorithm, which was carried out on a set of 360 instances. The results show that our branch- and-bound method outperforms the state of the art exact method.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
