New complexity results on scheduling with small communication delays
From MaRDI portal
(Redirected from Publication:1894375)
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- C.P.M. Scheduling with Small Communication Delays and Task Duplication
- Task scheduling with interprocessor communication delays
- Towards an Architecture-Independent Analysis of Parallel Algorithms
- Tree scheduling with communication delays
- UET scheduling with unit interprocessor communication delays
Cited in
(10)- The complexity of scheduling problems with communication delays for trees
- Complexity and approximation for precedence constrained scheduling problems with large communication delays
- On the complexity of scheduling with large communication delays
- Approximation algorithms for precedence-constrained identical machine scheduling with rejection
- Scheduling in the presence of processor networks : complexity and approximation
- An approximation algorithm for scheduling dependent tasks on \(m\) processors with small communication delays
- Task scheduling with interprocessor communication delays
- Using duplication for scheduling unitary tasks on m processors with unit communication delays
- Scheduling unitary task systems with zero--one communication delays for quasi-interval orders
- Approximation algorithms for scheduling with a limited number of communications
This page was built for publication: New complexity results on scheduling with small communication delays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1894375)