Abstract
In this paper, we developed several efficient heuristic algorithms to schedule unit processing time multiprocessor tasks in a two-stage hybrid flow-shop for minimizing makespan. We also derived two effective lower bounds for the problem. Then, we analyzed the average performance of the heuristic algorithms by computing the average relative gap of each heuristic solution from the lower bound. The results of the computational experiment to test the average performance of the proposed heuristic algorithms on a set of randomly generated problems showed that three of the proposed heuristic algorithms perform well.
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.
