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

DOI10.1016/S0304-3975(02)00328-6zbMath1023.68009MaRDI QIDQ1853631

Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude Konig

Publication date: 21 January 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)

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

This page was built for publication: An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications