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

DOI10.1007/s00453-014-9898-0zbMath1319.68049OpenAlexW2093510225MaRDI QIDQ494929

Yong Wang, Yuren Zhou, 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 algorithmsevolutionary algorithmsapproximation algorithmsscheduling problemlocal search algorithms

Mathematics Subject Classification ID

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

Related Items (2)

A comparative performance analysis of evolutionary algorithms on \(k\)-median and facility location problems ⋮ Time complexity analysis of evolutionary algorithms for 2-hop \((1,2)\)-minimum spanning tree problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the approximation ability of evolutionary optimization with application to minimum set cover
• A large population size can be unhelpful in evolutionary algorithms
• Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
• Approximation algorithms for scheduling unrelated parallel machines
• Theoretical aspects of local search.
• Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
• Improved 0/1-interchange scheduling
• On the analysis of the \((1+1)\) evolutionary algorithm
• Performance Guarantees of Local Search for Multiprocessor Scheduling
• A linear time approximation algorithm for multiprocessor scheduling
• Fifty years of scheduling: a survey of milestones
• Bounds for List Schedules on Uniform Processors
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Computing single source shortest paths using single-objective fitness
• Probability and Computing
• STACS 2005
• Drift analysis and average time complexity of evolutionary algorithms

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