Scheduling chains on uniform processors with communication delays

DOI10.1002/jos.121zbMath1028.90016OpenAlexW1991906005MaRDI QIDQ1860371

Bernard Penz, Denis Trystram, Wiesław X. Kubiak

Publication date: 23 February 2003

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jos.121

zbMATH Keywords

schedulingchainscommunication delaysuniform processors

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (3)

1-optimality of static BSP computations: Scheduling independent chains as a case study. ⋮ Scheduling of uniform parallel machines with s-precedence constraints ⋮ APPROXIMATION SCHEMES FOR SCHEDULING JOBS WITH CHAIN PRECEDENCE CONSTRAINTS

Cites Work

• Scheduling with Deadlines and Loss Functions
• An Almost-Linear Algorithm for Two-Processor Scheduling
• Preemptive Scheduling of Uniform Processor Systems

This page was built for publication: Scheduling chains on uniform processors with communication delays