A very difficult scheduling problem with communication delays
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 798656
- A Heuristic for a Scheduling Problem with Communication Delays
- On the complexity of scheduling with large communication delays
- Scheduling jobs with communication delays: using infeasible solutions for approximation
- A problem in scheduling theory
- scientific article; zbMATH DE number 4087409
- scientific article; zbMATH DE number 1061006
- Task scheduling with and without communication delays: A unified approach
- Complexity and approximation for precedence constrained scheduling problems with large communication delays
- Multiprocessor scheduling with communication delays
Cites work
- scientific article; zbMATH DE number 3888913 (Why is no real title available?)
- scientific article; zbMATH DE number 226824 (Why is no real title available?)
- Multiprocessor scheduling with communication delays
- Scheduling series-parallel orders subject to 0/1-communication delays
- Scheduling tasks with communication delays on parallel processors
- Three, four, five, six, or the complexity of scheduling with communication delays
- Towards an Architecture-Independent Analysis of Parallel Algorithms
Cited in
(2)
This page was built for publication: A very difficult scheduling problem with communication delays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1604057)