Performance Analysis of the (1+1) Evolutionary Algorithm for the Multiprocessor Scheduling Problem
- Authors
- Zhou, Yuren; Zhang, Jun; Wang, Yong
- Issue Date
- Sep-2015
- Publisher
- Springer Verlag
- Keywords
- Evolutionary algorithms; Scheduling problem; Local search algorithms; Approximation algorithms; Analysis of algorithms
- Citation
- Algorithmica, v.73, no.1, pp 21 - 41
- Pages
- 21
- Indexed
- SCI
SCIE
SCOPUS
- Journal Title
- Algorithmica
- Volume
- 73
- Number
- 1
- Start Page
- 21
- End Page
- 41
- URI
- https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/118514
- DOI
- 10.1007/s00453-014-9898-0
- ISSN
- 0178-4617
1432-0541
- 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.
- Files in This Item
-
Go to Link
- Appears in
Collections - COLLEGE OF ENGINEERING SCIENCES > SCHOOL OF ELECTRICAL ENGINEERING > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/118514)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.