Performance analysis of the (1+1) evolutionary algorithm for the multiprocessor scheduling problem
DOI10.1007/S00453-014-9898-0zbMATH Open1319.68049OpenAlexW2093510225MaRDI QIDQ494929FDOQ494929
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
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
analysis of algorithmsapproximation algorithmsevolutionary algorithmsscheduling problemlocal search algorithms
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)
Cites Work
- Title not available (Why is that?)
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Title not available (Why is that?)
- Title not available (Why is that?)
- STACS 2005
- Approximation algorithms for scheduling unrelated parallel machines
- Probability and Computing
- Fifty years of scheduling: a survey of milestones
- Bounds for List Schedules on Uniform Processors
- Title not available (Why is that?)
- Drift analysis and average time complexity of evolutionary algorithms
- Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
- A large population size can be unhelpful in evolutionary algorithms
- Performance guarantees of local search for multiprocessor scheduling
- A linear time approximation algorithm for multiprocessor scheduling
- Computing single source shortest paths using single-objective fitness
- Theoretical aspects of local search.
- On the analysis of the \((1+1)\) evolutionary algorithm
- On the approximation ability of evolutionary optimization with application to minimum set cover
- Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
- Title not available (Why is that?)
- Improved 0/1-interchange scheduling
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
- Analysis of a simple evolutionary algorithm for the multiobjective shortest path problem
- Time complexity analysis of evolutionary algorithms for 2-hop \((1,2)\)-minimum spanning tree problem
- Title not available (Why is that?)
- 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)
