Pages that link to "Item:Q2066685"
From MaRDI portal
The following pages link to Three notes on scheduling unit-length jobs with precedence constraints to minimize the total completion time (Q2066685):
Displaying 6 items.
- Level scheduling to minimize schedule length on lots of unit-time jobs (Q803029) (← links)
- On the complexity of scheduling unit-time jobs with or-precedence constraints (Q813963) (← links)
- An iterative algorithm for scheduling unit-times tasks with precedence constraints to minimise the maximum lateness (Q1265894) (← links)
- Scheduling unit-length jobs with precedence constraints of small height (Q1667212) (← links)
- A complexity analysis of parallel scheduling unit-time jobs with in-tree precedence constraints while minimizing the mean flow time (Q2294894) (← links)
- Open-shop scheduling for unit jobs under precedence constraints (Q5919300) (← links)