General scheduling non-approximability results in presence of hierarchical communications
From MaRDI portal
Publication:2384613
DOI10.1016/j.ejor.2006.11.020zbMath1149.90340OpenAlexW2049916336MaRDI QIDQ2384613
Rodolphe Giroudeau, Jean-Claude Konig
Publication date: 10 October 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2006.11.020
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Three, four, five, six, or the complexity of scheduling with communication delays
- An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications.
- On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications
- C.P.M. Scheduling with Small Communication Delays and Task Duplication
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A Heuristic for a Scheduling Problem with Communication Delays
- GUIDELINES FOR DATA-PARALLEL CYCLE-STEALING IN NETWORKS OF WORKSTATIONS II: ON MAXIMIZING GUARANTEED OUTPUT