Three, four, five, six, or the complexity of scheduling with communication delays
From MaRDI portal
Publication:1342284
Recommendations
Cites work
- A Heuristic for a Scheduling Problem with Communication Delays
- C.P.M. Scheduling with Small Communication Delays and Task Duplication
- Complexity of Scheduling under Precedence Constraints
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- Multiprocessor scheduling with communication delays
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- The Complexity of Scheduling Trees with Communication Delays
- Towards an Architecture-Independent Analysis of Parallel Algorithms
- UET scheduling with unit interprocessor communication delays
Cited in
(36)- UET scheduling with unit interprocessor communication delays
- On the complexity of scheduling with large communication delays
- Scheduling series-parallel orders subject to 0/1-communication delays
- Scheduling inverse trees under the communication model of the LogP-machine
- Scheduling series--parallel orders subject to 0/1-communication delays
- An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications.
- A very difficult scheduling problem with communication delays
- Approximation algorithms for precedence-constrained identical machine scheduling with rejection
- Scheduling UET-UCT outforests to minimize maximum lateness
- Polynomial time approximation algorithms for machine scheduling: Ten open problems
- An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications
- Scheduling chains on uniform processors with communication delays
- New complexity results on scheduling with small communication delays
- An EPTAS for scheduling fork-join graphs with communication delay
- General scheduling non-approximability results in presence of hierarchical communications
- A complete 4-parametric complexity classification of short shop scheduling problems
- Scheduling with duplication on m processors with small communication delays
- Scheduling in the presence of processor networks : complexity and approximation
- On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications
- Complete Complexity Classification of Short Shop Scheduling
- scientific article; zbMATH DE number 1061006 (Why is no real title available?)
- scientific article; zbMATH DE number 1156619 (Why is no real title available?)
- scientific article; zbMATH DE number 1472179 (Why is no real title available?)
- A linear time algorithm for scheduling outforests with communication delays on three processors
- scientific article; zbMATH DE number 798656 (Why is no real title available?)
- The Complexity of Scheduling Trees with Communication Delays
- A fixed-parameter algorithm for a unit-execution-time unit-communication-time tasks scheduling problem with a limited number of identical processors
- Scheduling \(UET\)-tasks on a star network: complexity and approximation
- An approximation algorithm for scheduling dependent tasks on m processors with small communication delays
- Preemptive scheduling of independent jobs on identical parallel machines subject to migration delays
- A fixed-parameter algorithm for scheduling unit dependent tasks with unit communication delays
- Scheduling interval ordered tasks with non-uniform deadlines
- Scheduling jobs with shared additional operations on parallel identical machines
- Complexity and approximation algorithm for scheduling communication delays problem with limited communication resource
- Bicriteria approximation algorithms for scheduling problems with communications delays
- Complexity and approximation for precedence constrained scheduling problems with large communication delays
This page was built for publication: Three, four, five, six, or the complexity of scheduling with communication delays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1342284)
