Task scheduling with and without communication delays: A unified approach

DOI10.1016/0377-2217(94)00255-XzbMath0913.90173OpenAlexW2128755407MaRDI QIDQ1266702

Venkatesh Krishnamorthy, Kemal Efe

Publication date: 7 October 1998

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)00255-x

zbMATH Keywords

makespantask schedulingscheduling directed acyclic task graphsunbounded number of processors

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (2)

PERMUTATION-BASED GENETIC, TABU, AND VARIABLE NEIGHBORHOOD SEARCH HEURISTICS FOR MULTIPROCESSOR SCHEDULING WITH COMMUNICATION DELAYS ⋮ Benchmark-problem instances for static scheduling of task graphs with communication delays on homogeneous multiprocessor systems

Cites Work

• Unnamed Item
• Unnamed Item
• UET scheduling with unit interprocessor communication delays
• Task scheduling with interprocessor communication delays
• NP-complete scheduling problems
• Towards an Architecture-Independent Analysis of Parallel Algorithms
• Scheduling Precedence Graphs in Systems with Interprocessor Communication Times
• A comparison of list schedules for parallel processing systems
• Computational Complexity of Discrete Optimization Problems
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

This page was built for publication: Task scheduling with and without communication delays: A unified approach