A very difficult scheduling problem with communication delays
From MaRDI portal
Publication:1604057
DOI10.1016/S0167-6377(01)00103-1zbMath0993.90050MaRDI 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
computational complexity; scheduling; parallel computation; makespan; precedence constraints; communication delays
90B35: Deterministic scheduling theory in operations research
65Y20: Complexity and performance of numerical algorithms
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