scientific article; zbMATH DE number 1500535

zbMATH Open0962.68011MaRDI QIDQ4501554FDOQ4501554

Authors: Rodolphe Giroudeau, Evripidis Bampis, Jean-Claude König 

Publication date: 4 September 2000

Title of this publication is not available (Why is that?)

Recommendations

• An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications.
• An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications
• Bicriteria approximation algorithms for scheduling problems with communications delays
• Scheduling tasks with small communication delays for clusters of processors

zbMATH Keywords

biprocessor machinesprecedence multiprocessor constrained scheduling problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cited In (9)

• An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications
• Complexity and approximation for precedence constrained scheduling problems with large communication delays
• Title not available (Why is that?)
• Scheduling tasks with small communication delays for clusters of processors
• Bicriteria approximation algorithms for scheduling problems with communications delays
• On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications
• General scheduling non-approximability results in presence of hierarchical communications
• Approximation algorithms for scheduling with a limited number of communications
• An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications.

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4501554)