A Heuristic for a Scheduling Problem with Communication Delays
From MaRDI portal
Publication:4367272
DOI10.1287/OPRE.45.1.145zbMATH Open0892.90104OpenAlexW1985059007MaRDI QIDQ4367272FDOQ4367272
Authors: A. Munier, Jean-Claude König 
Publication date: 25 November 1997
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.45.1.145
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 (21)
- Polynomial time approximation algorithms for machine scheduling: Ten open problems
- Scheduling chains on uniform processors with communication delays
- An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications
- A very difficult scheduling problem with communication delays
- Title not available (Why is that?)
- ILP formulations for scheduling ordered tasks on a bounded number of processors
- Complexity and approximation for precedence constrained scheduling problems with large communication delays
- Three, four, five, six, or the complexity of scheduling with communication delays
- Approximation algorithms for precedence-constrained identical machine scheduling with rejection
- Scheduling Precedence Graphs in Systems with Interprocessor Communication Times
- Multiprocessor scheduling with communication delays
- Bicriteria approximation algorithms for scheduling problems with communications delays
- Scheduling \(UET\)-tasks on a star network: complexity and approximation
- Scheduling in the presence of processor networks : complexity and approximation
- Inapproximability and polynomial-time approximation algorithm for UET tasks on structured processor networks
- General scheduling non-approximability results in presence of hierarchical communications
- An approximation algorithm for scheduling dependent tasks on \(m\) processors with small communication delays
- List scheduling with and without communication delays
- Tabu search method for multiprocessor scheduling with communication delays
- An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications.
- Parallel Machine Scheduling with Uncertain 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)
