Abstract
In this paper, three hybrid harmony search (HS) algorithms, namely, hybrid harmony search (hHS) algorithm, hybrid globalbest harmony search (hgHS) algorithm and hybrid modified globalbest harmony search (hmgHS) algorithm, are developed for solving the flow shop scheduling with blocking to minimize the total flow time. Firstly, a largest position value (LPV) rule is proposed to convert continuous harmony vectors into job permutations. Secondly, an initialization scheme based on a variant of the NEH heuristic is presented to construct the initial harmony memory with certain quality and diversity. Thirdly, HS is employed to evolve harmony vectors in the harmony memory to perform exploration, whereas a local search algorithm based on the insert neighborhood is embedded to enhance the local exploitation ability. In addition, some new pitch adjustment rules are developed to well inherit good structures from the globalbest harmony vector. Based on a set of well-known benchmark instances, extensive computational experiments are carried out. Computational results show the effectiveness of the hybrid harmony search algorithms, especially the (hmgHS) algorithm, in solving the blocking flow shop scheduling with total flow time criterion.
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.
