Please use this identifier to cite or link to this item:
|Title:||Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling||Authors:||Gao, Kai Zhou
Suganthan, P. N.
Pan, Q. K.
Chua, Tay Jin
Cai, T. J.
Chong, C. S.
|Keywords:||Flexible job shop scheduling; Harmony search algorithm; Multi-objective optimization; Local search||Issue Date:||2014||Source:||Gao, K., Suganthan, P. N., Pan, Q. K., Chua, T. J., Cai, T. X., & Chong, C. S. (2014). Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling. Information Sciences, 289, 76-90.||Series/Report no.:||Information Sciences||Abstract:||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.||URI:||https://hdl.handle.net/10356/82059
|ISSN:||0020-0255||DOI:||10.1016/j.ins.2014.07.039||Rights:||© 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].||Fulltext Permission:||open||Fulltext Availability:||With Fulltext|
|Appears in Collections:||EEE Journal Articles|
SIMTech Journal Articles
Files in This Item:
|Pareto-based Grouping Discrete Harmony Search Algorithm for Multi.pdf||780.19 kB||Adobe PDF|
Updated on Dec 28, 2021
Updated on Mar 3, 2021
Page view(s) 50480
Updated on Jun 25, 2022
Updated on Jun 25, 2022
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.