On the complexity of scheduling with large communication delays
From MaRDI portal
Publication:1278302
DOI10.1016/0377-2217(96)00124-5zbMath0947.90573OpenAlexW2086370835MaRDI QIDQ1278302
Evripidis Bampis, Aristotelis Giannakos, Jean-Claude Konig
Publication date: 8 November 2000
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(96)00124-5
Related Items (5)
Scheduling in the presence of processor networks : complexity and approximation ⋮ Complexity and approximation for precedence constrained scheduling problems with large communication delays ⋮ Scheduling trees with large communication delays on two identical processors ⋮ An EPTAS for scheduling fork-join graphs with communication delay ⋮ Scheduling \(UET\)-tasks on a star network: complexity and approximation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multiprocessor scheduling with communication delays
- UET scheduling with unit interprocessor communication delays
- Three, four, five, six, or the complexity of scheduling with communication delays
- Towards an Architecture-Independent Analysis of Parallel Algorithms
- On Scheduling Independent Tasks with Restricted Execution Times
- Complexity of Scheduling under Precedence Constraints
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
This page was built for publication: On the complexity of scheduling with large communication delays