A comparison of multiprocessor task scheduling algorithms with communication costs

DOI10.1016/j.cor.2006.05.013zbMath1278.90159OpenAlexW2027197113MaRDI QIDQ2456658

Hiroshi Katayama, Mitsuo Gen, Reakook Hwang

Publication date: 19 October 2007

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2006.05.013

zbMATH Keywords

genetic algorithmmultiprocessor task schedulingpriority-based multi-chromosome (PMC)

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (5)

Reducing the solution space of optimal task scheduling ⋮ Hardware design of a new genetic based disk scheduling method ⋮ New MIP model for multiprocessor scheduling problem with communication delays ⋮ A bipartite genetic algorithm for multi-processor task scheduling ⋮ A Memetic Model Based on Fixed Structure Learning Automata for Solving NP-Hard Problems

Uses Software

• Hypertool

Cites Work

• Unnamed Item
• Scheduling Precedence Graphs in Systems with Interprocessor Communication Times
• A comparison of list schedules for parallel processing systems

This page was built for publication: A comparison of multiprocessor task scheduling algorithms with communication costs