Ant colony optimisation with parameterised search space for the job shop scheduling problem
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Seo, Minseok | - |
dc.contributor.author | Kim, Daecheol | - |
dc.date.accessioned | 2022-12-20T19:02:25Z | - |
dc.date.available | 2022-12-20T19:02:25Z | - |
dc.date.created | 2022-08-27 | - |
dc.date.issued | 2010-02 | - |
dc.identifier.issn | 0020-7543 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/175471 | - |
dc.description.abstract | The job-shop scheduling problem (JSSP) is known to be NP-hard. Due to its complexity, many metaheuristic algorithm approaches have arisen. Ant colony metaheuristic algorithm, lately proposed, has successful application to various combinatorial optimisation problems. In this study, an ant colony optimisation algorithm with parameterised search space is developed for JSSP with an objective of minimising makespan. The problem is modelled as a disjunctive graph where arcs connect only pairs of operations related rather than all operations are connected in pairs to mitigate the increase of the spatial complexity. The proposed algorithm is compared with a multiple colony ant algorithm using 20 benchmark problems. The results show that the proposed algorithm is very accurate by generating 12 optimal solutions out of 20 benchmark problems, and mean relative errors of the proposed and the multiple colony ant algorithms to the optimal solutions are 0.93% and 1.24%, respectively. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | TAYLOR & FRANCIS LTD | - |
dc.title | Ant colony optimisation with parameterised search space for the job shop scheduling problem | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Kim, Daecheol | - |
dc.identifier.doi | 10.1080/00207540802538021 | - |
dc.identifier.scopusid | 2-s2.0-74549198723 | - |
dc.identifier.wosid | 000272988400011 | - |
dc.identifier.bibliographicCitation | INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, v.48, no.4, pp.1143 - 1154 | - |
dc.relation.isPartOf | INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH | - |
dc.citation.title | INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH | - |
dc.citation.volume | 48 | - |
dc.citation.number | 4 | - |
dc.citation.startPage | 1143 | - |
dc.citation.endPage | 1154 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalResearchArea | Operations Research & Management Science | - |
dc.relation.journalWebOfScienceCategory | Engineering, Industrial | - |
dc.relation.journalWebOfScienceCategory | Engineering, Manufacturing | - |
dc.relation.journalWebOfScienceCategory | Operations Research & Management Science | - |
dc.subject.keywordPlus | GENETIC ALGORITHMS | - |
dc.subject.keywordPlus | TABOO SEARCH | - |
dc.subject.keywordAuthor | job-shop scheduling | - |
dc.subject.keywordAuthor | ant colony optimisation | - |
dc.subject.keywordAuthor | disjunctive graph | - |
dc.subject.keywordAuthor | makespan | - |
dc.subject.keywordAuthor | NP-hard | - |
dc.identifier.url | https://www.tandfonline.com/doi/full/10.1080/00207540802538021 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1365
COPYRIGHT © 2021 HANYANG UNIVERSITY.
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.