Pages that link to "Item:Q2283293"

The following pages link to The complexity of parallel machine scheduling of unit-processing-time jobs under level-order precedence constraints (Q2283293):

Displaying 3 items.

• Three notes on scheduling unit-length jobs with precedence constraints to minimize the total completion time (Q2066685) (← links)
• Scheduling lower bounds via AND subset sum (Q2121467) (← links)
• Equitable scheduling on a single machine (Q6103750) (← links)