Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling
Gao, Kai Zhou
Suganthan, Ponnuthurai Nagaratnam
Pan, Q. K.
Chua, Tay Jin
Cai, T. J.
Chong, C. S.
Date of Issue2014-08-04
School of Electrical and Electronic Engineering
Singapore Institute of Manufacturing Technology
This paper proposes a Pareto-based grouping discrete harmony search algorithm (PGDHS) to solve the multi-objective flexible job shop scheduling problem (FJSP). Two objectives, namely the maximum completion time (makespan) and the mean of earliness and tardiness, are considered simultaneously. Firstly, two novel heuristics and several existing heuristics are employed to initialize the harmony memory. Secondly, multiple harmony generation strategies are proposed to improve the performance of harmony search algorithm. The operation sequence in a new harmony is produced based on the encoding method and the characteristics of FJSP. Thirdly, two local search methods based on critical path and due date are embedded to enhance the exploitation capability. Finally, extensive computational experiments are carried out using well-known benchmark instances. Three widely used performance measures, number of non-dominated solutions, diversification metric and quality metric, are employed to test the performance of PGDHS algorithm. Computational results and comparisons show the efficiency and effectiveness of the proposed PGDHS algorithm for solving multi-objective flexible job-shop scheduling problem.
Flexible job shop scheduling; Harmony search algorithm; Multi-objective optimization; Local search
© 2014 Elsevier. This is the author created version of a work that has been peer reviewed and accepted for publication by Information Sciences, Elsevier. It incorporates referee’s comments but changes resulting from the publishing process, such as copyediting, structural formatting, may not be reflected in this document. The published version is available at: [http://dx.doi.org/10.1016/j.ins.2014.07.039].