Pages that link to "Item:Q2294894"
From MaRDI portal
The following pages link to A complexity analysis of parallel scheduling unit-time jobs with in-tree precedence constraints while minimizing the mean flow time (Q2294894):
Displaying 3 items.
- On the complexity of scheduling unit-time jobs with or-precedence constraints (Q813963) (← links)
- Three notes on scheduling unit-length jobs with precedence constraints to minimize the total completion time (Q2066685) (← links)
- The complexity of parallel machine scheduling of unit-processing-time jobs under level-order precedence constraints (Q2283293) (← links)