Abstract
No-wait flowshops circumscribe an important class of sequencing problems in the field of production planning. For no-wait flowshops with total completion time minimization, a permutation of jobs should be find to be processed sequentially on a number of machines under the restriction that each job is processed continuously. This is a typical NP-hard combinatorial optimization problem. In this paper, a new hybrid heuristic algorithm is proposed which is based on PH1p algorithm. PH1p is modified by replacing Nawaz-Enscore-Ham (NEH) insertion operator with FL method. A composite algorithm is adopted to generate an advantageous initial seed. Based on well-known benchmarks and comparisons with some existing algorithms, simulation results demonstrate the effectiveness of the proposed hybrid algorithm.
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.
