Many-Objective Job-Shop Scheduling: A Multiple Populations for Multiple Objectives-Based Genetic Algorithm Approach
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Liu, Si-Chen | - |
dc.contributor.author | Chen, Zong-Gan | - |
dc.contributor.author | Zhan, Zhi-Hui | - |
dc.contributor.author | Jeon, Sang-Woon | - |
dc.contributor.author | Kwong, Sam | - |
dc.contributor.author | Zhang, Jun | - |
dc.date.accessioned | 2023-04-03T10:03:24Z | - |
dc.date.available | 2023-04-03T10:03:24Z | - |
dc.date.issued | 2023-03 | - |
dc.identifier.issn | 2168-2267 | - |
dc.identifier.issn | 2168-2275 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/111656 | - |
dc.description.abstract | The job-shop scheduling problem (JSSP) is a challenging scheduling and optimization problem in the industry and engineering, which relates to the work efficiency and operational costs of factories. The completion time of all jobs is the most commonly considered optimization objective in the existing work. However, factories focus on both time and cost objectives, including completion time, total tardiness, advance time, production cost, and machine loss. Therefore, this article first time proposes a many-objective JSSP that considers all these five objectives to make the model more practical to reflect the various demands of factories. To optimize these five objectives simultaneously, a novel multiple populations for multiple objectives (MPMO) framework-based genetic algorithm (GA) approach, called MPMOGA, is proposed. First, MPMOGA employs five populations to optimize the five objectives, respectively. Second, to avoid each population only focusing on its corresponding single objective, an archive sharing technique (AST) is proposed to store the elite solutions collected from the five populations so that the populations can obtain optimization information about the other objectives from the archive. This way, MPMOGA can approximate different parts of the entire Pareto front (PF). Third, an archive update strategy (AUS) is proposed to further improve the quality of the solutions in the archive. The test instances in the widely used test sets are adopted to evaluate the performance of MPMOGA. The experimental results show that MPMOGA outperforms the compared state-of-the-art algorithms on most of the test instances. | - |
dc.format.extent | 15 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | IEEE Advancing Technology for Humanity | - |
dc.title | Many-Objective Job-Shop Scheduling: A Multiple Populations for Multiple Objectives-Based Genetic Algorithm Approach | - |
dc.type | Article | - |
dc.publisher.location | 미국 | - |
dc.identifier.doi | 10.1109/TCYB.2021.3102642 | - |
dc.identifier.scopusid | 2-s2.0-85115155797 | - |
dc.identifier.wosid | 000732301200001 | - |
dc.identifier.bibliographicCitation | IEEE Transactions on Cybernetics, v.53, no.3, pp 1460 - 1474 | - |
dc.citation.title | IEEE Transactions on Cybernetics | - |
dc.citation.volume | 53 | - |
dc.citation.number | 3 | - |
dc.citation.startPage | 1460 | - |
dc.citation.endPage | 1474 | - |
dc.type.docType | Article | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Automation & Control Systems | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Automation & Control Systems | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Artificial Intelligence | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Cybernetics | - |
dc.subject.keywordPlus | PARTICLE-SWARM | - |
dc.subject.keywordPlus | DIFFERENTIAL EVOLUTION | - |
dc.subject.keywordPlus | MULTIOBJECTIVE OPTIMIZATION | - |
dc.subject.keywordPlus | SEARCH ALGORITHM | - |
dc.subject.keywordPlus | TIME | - |
dc.subject.keywordPlus | DECOMPOSITION | - |
dc.subject.keywordAuthor | Optimization | - |
dc.subject.keywordAuthor | Statistics | - |
dc.subject.keywordAuthor | Sociology | - |
dc.subject.keywordAuthor | Costs | - |
dc.subject.keywordAuthor | Genetic algorithms | - |
dc.subject.keywordAuthor | Production facilities | - |
dc.subject.keywordAuthor | Job shop scheduling | - |
dc.subject.keywordAuthor | Archive sharing technique (AST) | - |
dc.subject.keywordAuthor | archive update strategy (AUS) | - |
dc.subject.keywordAuthor | genetic algorithm (GA) | - |
dc.subject.keywordAuthor | many-objective job-shop scheduling problem (MaJSSP) | - |
dc.subject.keywordAuthor | many-objective optimization | - |
dc.subject.keywordAuthor | multiple populations for multiple objectives (MPMO) | - |
dc.identifier.url | https://ieeexplore.ieee.org/document/9536021 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
55 Hanyangdeahak-ro, Sangnok-gu, Ansan, Gyeonggi-do, 15588, Korea+82-31-400-4269 sweetbrain@hanyang.ac.kr
COPYRIGHT © 2021 HANYANG UNIVERSITY. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.