Abstract
This work aims at the minimization of makespan in m-machine permutation flowshops and presents an efficient branch-and-bound algorithm to solve this problem optimally. A job-based lower bound, integrated with a machine-based lower bound, is proposed which in turn is deployed in solving a bottleneck assignment problem to obtain a tight lower bound on the makespan. The algorithm is evaluated by solving many randomly generated problems of different problem sizes and the results of an extensive computational investigation are presented. In addition, the proposed branch-and-bound algorithm is compared with an existing bounding scheme.
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.
