Pages that link to "Item:Q2433242"

The following pages link to Minimizing total completion time for UET tasks with release time and outtree precedence constraints (Q2433242):

Displaying 7 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)
• A polynomial algorithm for \(P | p_j = 1,r_j, outtree\,| \sum C_j\) (Q1812291) (← 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)
• The Coffman--Graham Algorithm Optimally Solves UET Task Systems with Overinterval Orders (Q5317601) (← links)