Abstract
This paper proposed a discrete harmony search algorithm, named DHS, for solving the no-wait flow shop scheduling problem with the objective to minimize total flowtime. Firstly, the total flowtime is shown. Secondly, a harmony is represented as a discrete job permutation and the well-known NEH method is proposed to initialize the harmony memory. Thirdly, Extensive computational experiments are carried out based on a set of well-known benchmark instances. Computational results show the effectiveness of the DHS algorithm in solving the no-wait flow shop scheduling problem.
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.
