An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications.

DOI10.1016/S0304-3975(02)00328-6zbMath1051.68041MaRDI QIDQ1401200

Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude Konig

Publication date: 17 August 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

SchedulingApproximabilityHierarchical communications

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

General scheduling non-approximability results in presence of hierarchical communications

Cites Work

• Three, four, five, six, or the complexity of scheduling with communication delays
• On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• A Heuristic for a Scheduling Problem with Communication Delays
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item