Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors
From MaRDI portal
Publication:1013298
DOI10.1016/j.disopt.2008.09.001zbMath1158.68346MaRDI QIDQ1013298
Djamal Rebaine, Wiesław X. Kubiak, Chris N. Potts
Publication date: 17 April 2009
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2008.09.001
90B35: Deterministic scheduling theory in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
A survey on how the structure of precedence constraints may change the complexity class of scheduling problems, Linear time algorithms to solve the linear ordering problem for oriented tree based graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Optimal scheduling on parallel machines for a new order class
- Optimal scheduling for two-processor systems
- Scheduling precedence graphs of bounded height
- Profile Scheduling of Opposing Forests and Level Orders
- Scheduling Flat Graphs
- The Recognition of Series Parallel Digraphs
- Scheduling Opposing Forests
- The Coffman--Graham Algorithm Optimally Solves UET Task Systems with Overinterval Orders