Performance analysis of the (1+1) evolutionary algorithm for the multiprocessor scheduling problem

DOI10.1007/S00453-014-9898-0MaRDI QIDQ494929zbMATH OpenOpenAlexFDO

Authors Yuren Zhou, Yong Wang, Jun Zhang

Publication date 3 September 2015

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-014-9898-0

zbMATH Keywords

analysis of algorithmsapproximation algorithmsevolutionary algorithmsscheduling problemlocal search algorithms

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms (68W40) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Recommendations

• Analysis of a simple evolutionary algorithm for the multiobjective shortest path problem
• scientific article; zbMATH DE number 6019547
• Analysis for time complexity of evolutionary algorithms
• On the approximation ability of evolutionary optimization with application to minimum set cover
• Evolutionary computation in combinatorial optimization

Cites work

• scientific article; zbMATH DE number 3493681 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 976350 (Why is no real title available?)
• scientific article; zbMATH DE number 1100794 (Why is no real title available?)
• scientific article; zbMATH DE number 1962832 (Why is no real title available?)
• A large population size can be unhelpful in evolutionary algorithms
• A linear time approximation algorithm for multiprocessor scheduling
• Approximation algorithms for scheduling unrelated parallel machines
• Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
• Bounds for List Schedules on Uniform Processors
• Computing single source shortest paths using single-objective fitness
• Drift analysis and average time complexity of evolutionary algorithms
• Fifty years of scheduling: a survey of milestones
• Improved 0/1-interchange scheduling
• On the analysis of the \((1+1)\) evolutionary algorithm
• On the approximation ability of evolutionary optimization with application to minimum set cover
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Performance guarantees of local search for multiprocessor scheduling
• Probability and Computing
• Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
• STACS 2005
• Theoretical aspects of local search.

Cited in

(6)

• Some fully polynomial time randomized approximation scheme based on an evolutionary algorithm
• On the approximation ability of evolutionary optimization with application to minimum set cover
• Time complexity analysis of evolutionary algorithms for 2-hop \((1,2)\)-minimum spanning tree problem
• Analysis of a simple evolutionary algorithm for the multiobjective shortest path problem
• scientific article; zbMATH DE number 1703859 (Why is no real title available?)
• A comparative performance analysis of evolutionary algorithms on k-median and facility location problems

This page was built for publication: Performance analysis of the \((1+1)\) evolutionary algorithm for the multiprocessor scheduling problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q494929)