Abstract
This paper develops a new harmony search (HS) algorithm for the hybrid flow shop scheduling problem with multiprocessor tasks, which is known to be NP-hard in the strong sense. The goal is to minimize the makespan. Thus, the proposed HS starts with the application of an opposition based learning (OBL) method to increase the diversity level of the initial harmony memory (HM). Furthermore, we use novel improvisation rules of producing new harmonies based on crossover and mutation operators. Also, neighborhood techniques are employed to enhance the searching and improve the solution quality. The proposed HS is compared with three algorithms from the literature. The computational experiments demonstrate the effectiveness of the proposed HS algorithm in terms of makespan.
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.
