Pages that link to "Item:Q1013298"

The following pages link to Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors (Q1013298):

Displaying 1 item.

• A survey on how the structure of precedence constraints may change the complexity class of scheduling problems (Q1617290) (← links)