Scheduling series-parallel orders subject to 0/1-communication delays

DOI10.1016/S0167-8191(98)00100-8MaRDI QIDQ1285545zbMATH OpenOpenAlexFDO

Authors Rolf H. Möhring, Markus W. Schäffter

Publication date 28 April 1999

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-8191(98)00100-8

zbMATH Keywords

schedulingseries-parallel ordersunit communication delays

Mathematics Subject Classification ID

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

Recommendations

• Scheduling series--parallel orders subject to 0/1-communication delays
• Scheduling jobs with communication delays: using infeasible solutions for approximation
• Three, four, five, six, or the complexity of scheduling with communication delays
• Complexity and approximation for precedence constrained scheduling problems with large communication delays
• Scheduling tasks with communication delays on parallel processors

Cited in

(10)

• Scheduling series--parallel orders subject to 0/1-communication delays
• Three, four, five, six, or the complexity of scheduling with communication delays
• A very difficult scheduling problem with communication delays
• Scheduling unitary task systems with zero--one communication delays for quasi-interval orders
• Scheduling tasks with communication delays on parallel processors
• Retractions onto series-parallel posets
• Parallel processor scheduling with delay constraints
• Scheduling an interval ordered precedence graph with communication delays and a limited number of processors
• Scheduling jobs with communication delays: using infeasible solutions for approximation
• Confluent Hasse Diagrams

This page was built for publication: Scheduling series-parallel orders subject to 0/1-communication delays

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