Performance Analysis of the (1+1) Evolutionary Algorithm for the Multiprocessor Scheduling Problem
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Zhou, Yuren | - |
dc.contributor.author | Zhang, Jun | - |
dc.contributor.author | Wang, Yong | - |
dc.date.accessioned | 2024-04-09T03:01:11Z | - |
dc.date.available | 2024-04-09T03:01:11Z | - |
dc.date.issued | 2015-09 | - |
dc.identifier.issn | 0178-4617 | - |
dc.identifier.issn | 1432-0541 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/118514 | - |
dc.description.abstract | In recent years, there has been considerable progress in the theoretical study of evolutionary algorithms (EAs) for discrete optimization problems. However, results on the performance analysis of EAs for NP-hard problems are rare. This paper contributes a theoretical understanding of EAs on the NP-hard multiprocessor scheduling problem. The worst-case bound on the (1+1)EA for the multiprocessor scheduling problem and a worst-case example are presented. It is proved that the (1+1)EA on problem achieves an approximation ratio of in expected time . Finally, the theoretical analysis on three selected instances of the multiprocessor scheduling problem shows that EAs outperform local search algorithms on these instances. | - |
dc.format.extent | 21 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | Springer Verlag | - |
dc.title | Performance Analysis of the (1+1) Evolutionary Algorithm for the Multiprocessor Scheduling Problem | - |
dc.type | Article | - |
dc.publisher.location | 미국 | - |
dc.identifier.doi | 10.1007/s00453-014-9898-0 | - |
dc.identifier.scopusid | 2-s2.0-84933673375 | - |
dc.identifier.wosid | 000357113900002 | - |
dc.identifier.bibliographicCitation | Algorithmica, v.73, no.1, pp 21 - 41 | - |
dc.citation.title | Algorithmica | - |
dc.citation.volume | 73 | - |
dc.citation.number | 1 | - |
dc.citation.startPage | 21 | - |
dc.citation.endPage | 41 | - |
dc.type.docType | Article | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | sci | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Mathematics | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Software Engineering | - |
dc.relation.journalWebOfScienceCategory | Mathematics, Applied | - |
dc.subject.keywordPlus | APPROXIMATION ALGORITHMS | - |
dc.subject.keywordPlus | TIME-COMPLEXITY | - |
dc.subject.keywordPlus | LOCAL SEARCH | - |
dc.subject.keywordPlus | POPULATION | - |
dc.subject.keywordAuthor | Evolutionary algorithms | - |
dc.subject.keywordAuthor | Scheduling problem | - |
dc.subject.keywordAuthor | Local search algorithms | - |
dc.subject.keywordAuthor | Approximation algorithms | - |
dc.subject.keywordAuthor | Analysis of algorithms | - |
dc.identifier.url | https://www.scopus.com/record/display.uri?eid=2-s2.0-84933673375&origin=inward&txGid=c50e772a9c3e0e8b39e95429ee978ee0 | - |
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.