Performance analysis of the \((1+1)\) evolutionary algorithm for the multiprocessor scheduling problem
type: Item
instance of: scholarly article
title: Performance analysis of the \((1+1)\) evolutionary algorithm for the multiprocessor scheduling problem
zbMATH Open document ID: 1319.68049
author: Yuren Zhou
author: Yong Wang
author: Jun Zhang
published in: Algorithmica
publication date: 2015-09-03T00:00:00Z
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 6478089
zbMATH Keywords: evolutionary algorithms
zbMATH Keywords: scheduling problem
zbMATH Keywords: local search algorithms
zbMATH Keywords: approximation algorithms
zbMATH Keywords: analysis of algorithms
MaRDI profile type: Publication
full work available at URL: s00453-014-9898-0
OpenAlex ID: W2093510225
cites work: Q4331755
cites work: Q4370804
cites work: Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
cites work: Q4076577
cites work: Probability and Computing
cites work: On the analysis of the \((1+1)\) evolutionary algorithm
cites work: Drift analysis and average time complexity of evolutionary algorithms
cites work: Q4418669
cites work: Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Computing single source shortest paths using single-objective fitness
cites work: A large population size can be unhelpful in evolutionary algorithms
cites work: Q4198056
cites work: STACS 2005
cites work: On the approximation ability of evolutionary optimization with application to minimum set cover
cites work: Fifty years of scheduling: a survey of milestones
cites work: A linear time approximation algorithm for multiprocessor scheduling
cites work: Bounds for List Schedules on Uniform Processors
cites work: Improved 0/1-interchange scheduling
cites work: Approximation algorithms for scheduling unrelated parallel machines
cites work: Performance guarantees of local search for multiprocessor scheduling
cites work: Theoretical aspects of local search.
DOI: 10.1007/S00453-014-9898-0
description: scientific article; zbMATH DE number 6478089