Pages that link to "Item:Q5317601"
From MaRDI portal
The following pages link to The Coffman--Graham Algorithm Optimally Solves UET Task Systems with Overinterval Orders (Q5317601):
Displayed 3 items.
- Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors (Q1013298) (← links)
- A polynomial algorithm for recognizing the \(\mathcal A\)-order class (Q1043599) (← links)
- A survey on how the structure of precedence constraints may change the complexity class of scheduling problems (Q1617290) (← links)
