The Coffman--Graham Algorithm Optimally Solves UET Task Systems with Overinterval Orders
From MaRDI portal
Publication:5317601
DOI10.1137/S0895480101394999zbMath1087.90028MaRDI QIDQ5317601
Publication date: 16 September 2005
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895480101394999
Related Items
Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors, A polynomial algorithm for recognizing the \(\mathcal A\)-order class, A survey on how the structure of precedence constraints may change the complexity class of scheduling problems