Pages that link to "Item:Q1013298"
From MaRDI portal
The following pages link to Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors (Q1013298):
Displaying 4 items.
- A survey on how the structure of precedence constraints may change the complexity class of scheduling problems (Q1617290) (← links)
- Three notes on scheduling unit-length jobs with precedence constraints to minimize the total completion time (Q2066685) (← links)
- Linear time algorithms on mirror trees (Q2091108) (← links)
- Linear time algorithms to solve the linear ordering problem for oriented tree based graphs (Q2805488) (← links)
