A Heuristic for a Scheduling Problem with Communication Delays
From MaRDI portal
(Redirected from Publication:4367272)
Recommendations
- Scheduling jobs with communication delays: using infeasible solutions for approximation
- Multiprocessor scheduling with communication delays
- New complexity results on scheduling with small communication delays
- Scheduling with duplication on m processors with small communication delays
- Scheduling in the presence of processor networks : complexity and approximation
Cited in
(24)- List scheduling with and without communication delays
- Three, four, five, six, or the complexity of scheduling with communication delays
- An improved heuristic for one-machine scheduling with delays constraints
- Performance of Coffman-Graham schedules in the presence of unit communication delays
- Using duplication for scheduling unitary tasks on m processors with unit 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
- 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
- General scheduling non-approximability results in presence of hierarchical communications
- Tabu search method for multiprocessor scheduling with communication delays
- ILP formulations for scheduling ordered tasks on a bounded number of processors
- Scheduling in the presence of processor networks : complexity and approximation
- scientific article; zbMATH DE number 5669804 (Why is no real title available?)
- Scheduling Precedence Graphs in Systems with Interprocessor Communication Times
- Parallel Machine Scheduling with Uncertain Communication Delays
- Scheduling \(UET\)-tasks on a star network: complexity and approximation
- An approximation algorithm for scheduling dependent tasks on m processors with small communication delays
- Inapproximability and polynomial-time approximation algorithm for UET tasks on structured processor networks
- Bicriteria approximation algorithms for scheduling problems with communications delays
- Multiprocessor scheduling with communication delays
- Complexity and approximation for precedence constrained scheduling problems with large communication delays
This page was built for publication: A Heuristic for a Scheduling Problem with Communication Delays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4367272)
