Complexity and approximation for precedence constrained scheduling problems with large communication delays
From MaRDI portal
Recommendations
- On the complexity of scheduling with large communication delays
- An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications
- scientific article; zbMATH DE number 1500535
- scientific article; zbMATH DE number 1061006
- An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications.
- Bicriteria approximation algorithms for scheduling problems with communications delays
- New complexity results on scheduling with small communication delays
- Scheduling an interval ordered precedence graph with communication delays and a limited number of processors
Cites work
- scientific article; zbMATH DE number 1187164 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1302193 (Why is no real title available?)
- scientific article; zbMATH DE number 798656 (Why is no real title available?)
- scientific article; zbMATH DE number 922880 (Why is no real title available?)
- scientific article; zbMATH DE number 226824 (Why is no real title available?)
- A Heuristic for a Scheduling Problem with Communication Delays
- An approximation algorithm for scheduling dependent tasks on \(m\) processors with small communication delays
- Approximation algorithms for scheduling trees with general communication delays: Special issue on task scheduling problems for parallel and distributed systems
- C.P.M. Scheduling with Small Communication Delays and Task Duplication
- New complexity results on scheduling with small communication delays
- On a routing problem
- On the complexity of scheduling with large communication delays
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Three, four, five, six, or the complexity of scheduling with communication delays
- Towards an Architecture-Independent Analysis of Parallel Algorithms
- UET scheduling with unit interprocessor communication delays
- Using duplication for scheduling unitary tasks on m processors with unit communication delays
Cited in
(16)- An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications
- A very difficult scheduling problem with communication delays
- Scheduling 2-dimensional grids with large communication delays
- Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay.
- On the complexity of scheduling with large communication delays
- Open Problem—M/G/1 Scheduling with Preemption Delays
- Scheduling tasks with small communication delays for clusters of processors
- scientific article; zbMATH DE number 1560337 (Why is no real title available?)
- Bicriteria approximation algorithms for scheduling problems with communications delays
- Scheduling \(UET\)-tasks on a star network: complexity and approximation
- Inapproximability and polynomial-time approximation algorithm for UET tasks on structured processor networks
- scientific article; zbMATH DE number 2086382 (Why is no real title available?)
- Scheduling jobs with communication delays: using infeasible solutions for approximation
- Some complexity and approximation results for coupled-tasks scheduling problem according to topology
- Approximation algorithms for scheduling with a limited number of communications
- An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications.
This page was built for publication: Complexity and approximation for precedence constrained scheduling problems with large communication delays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q935152)
