A very difficult scheduling problem with communication delays

DOI10.1016/S0167-6377(01)00103-1zbMath0993.90050OpenAlexW2061146945MaRDI QIDQ1604057

Gerhard J. Woeginger, Hoogeveen, J. A.

Publication date: 3 July 2002

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(01)00103-1

zbMATH Keywords

computational complexityschedulingparallel computationmakespanprecedence constraintscommunication delays

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Complexity and performance of numerical algorithms (65Y20)

Cites Work

• Unnamed Item
• Unnamed Item
• Multiprocessor scheduling with communication delays
• Scheduling series-parallel orders subject to 0/1-communication delays
• Three, four, five, six, or the complexity of scheduling with communication delays
• Scheduling tasks with communication delays on parallel processors
• Towards an Architecture-Independent Analysis of Parallel Algorithms

This page was built for publication: A very difficult scheduling problem with communication delays