Abstract
This paper analyzes the permutation flow shop scheduling problem with makespan minimization criteria. Since the publication of the well-known NEH heuristic from Nawaz, Enscore and Ham in 1983, several constructive heuristic methods have been developed. In this paper, we proposed constructive methods that make use of the principles of the NEH heuristic and recent studies to significantly improve its performance. For this purpose, 67 new constructive heuristic methods were proposed in this paper. Through a literature review, the main constructive methods for makespan minimization were identified. An extensive computational experiment was conducted with the best heuristics proposed in this paper and those identified in the literature for comparison and evaluation purposes. Based on the results, some of the proposed methods significantly outperform the literature heuristics, providing high quality solutions.
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 callMore From: The International Journal of Advanced Manufacturing Technology
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.
