A bipartite genetic algorithm for multi-processor task scheduling
From MaRDI portal
Publication:735353
DOI10.1007/S10766-009-0107-8zbMath1183.68104OpenAlexW2032932574MaRDI QIDQ735353
Mohammad Reza Bonyadi, Mohsen Ebrahimi Moghaddam
Publication date: 21 October 2009
Published in: International Journal of Parallel Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10766-009-0107-8
Nonnumerical algorithms (68W05) Learning and adaptive systems in artificial intelligence (68T05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Multiprocessor scheduling in a genetic paradigm
- A comparison of multiprocessor task scheduling algorithms with communication costs
- Scheduling Precedence Graphs in Systems with Interprocessor Communication Times
- Introduction to evolutionary computing
- A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems
This page was built for publication: A bipartite genetic algorithm for multi-processor task scheduling