Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/82059
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGao, Kai Zhouen
dc.contributor.authorSuganthan, P. N.en
dc.contributor.authorPan, Q. K.en
dc.contributor.authorChua, Tay Jinen
dc.contributor.authorCai, T. J.en
dc.contributor.authorChong, C. S.en
dc.date.accessioned2016-01-22T07:47:16Zen
dc.date.accessioned2019-12-06T14:45:40Z-
dc.date.available2016-01-22T07:47:16Zen
dc.date.available2019-12-06T14:45:40Z-
dc.date.issued2014en
dc.identifier.citationGao, 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.en
dc.identifier.issn0020-0255en
dc.identifier.urihttps://hdl.handle.net/10356/82059-
dc.description.abstractThis 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.en
dc.description.sponsorshipASTAR (Agency for Sci., Tech. and Research, S’pore)en
dc.format.extent18 p.en
dc.language.isoenen
dc.relation.ispartofseriesInformation Sciencesen
dc.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].en
dc.subjectFlexible job shop scheduling; Harmony search algorithm; Multi-objective optimization; Local searchen
dc.titlePareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop schedulingen
dc.typeJournal Articleen
dc.contributor.schoolSchool of Electrical and Electronic Engineeringen
dc.contributor.organizationA*STAR SIMTechen
dc.identifier.doi10.1016/j.ins.2014.07.039en
dc.description.versionAccepted versionen
item.grantfulltextopen-
item.fulltextWith Fulltext-
Appears in Collections:EEE Journal Articles
SIMTech Journal Articles
Files in This Item:
File Description SizeFormat 
Pareto-based Grouping Discrete Harmony Search Algorithm for Multi.pdf780.19 kBAdobe PDFThumbnail
View/Open

SCOPUSTM   
Citations 5

135
Updated on Jul 11, 2022

PublonsTM
Citations 5

117
Updated on Jul 4, 2022

Page view(s) 50

496
Updated on Aug 14, 2022

Download(s) 5

440
Updated on Aug 14, 2022

Google ScholarTM

Check

Altmetric


Plumx

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.