The complexity of scheduling problems with communication delays for trees
From MaRDI portal
Recommendations
Cites work
Cited in
(13)- On the complexity of scheduling with large communication delays
- Approximation algorithms for scheduling trees with general communication delays: Special issue on task scheduling problems for parallel and distributed systems
- Tree scheduling with communication delays
- Scheduling complete intrees on two uniform processors with communication delays
- New complexity results on scheduling with small communication delays
- Complexity of a class of task scheduling problems
- Scheduling UET Trees with Communication Delays on two Processors
- scientific article; zbMATH DE number 2086776 (Why is no real title available?)
- The Complexity of Scheduling Trees with Communication Delays
- The complexity of scheduling problems with communication delays for trees
- Some models for scheduling parallel programs with communication delays
- Data transmission in processor networks
- Scheduling jobs with shared additional operations on parallel identical machines
This page was built for publication: The complexity of scheduling problems with communication delays for trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5056138)