Pages that link to "Item:Q2433242"
From MaRDI portal
The following pages link to Minimizing total completion time for UET tasks with release time and outtree precedence constraints (Q2433242):
Displaying 5 items.
- A survey on how the structure of precedence constraints may change the complexity class of scheduling problems (Q1617290) (← links)
- Normal-form preemption sequences for an open problem in scheduling theory (Q1702732) (← links)
- Ideal schedules in parallel machine settings (Q2029359) (← links)
- Minimizing total completion time for UET tasks with release time and outtree precedence constraints (Q2433242) (← links)
- A new polynomial algorithm for a parallel identical scheduling problem (Q3517881) (← links)
