Pages that link to "Item:Q1812291"
From MaRDI portal
The following pages link to A polynomial algorithm for \(P | p_j = 1,r_j, outtree\,| \sum C_j\) (Q1812291):
Displayed 11 items.
- Fast LP models and algorithms for identical jobs on uniform parallel machines (Q727360) (← links)
- 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)
- Three notes on scheduling unit-length jobs with precedence constraints to minimize the total completion time (Q2066685) (← links)
- A complexity analysis of parallel scheduling unit-time jobs with in-tree precedence constraints while minimizing the mean flow time (Q2294894) (← links)
- How small are shifts required in optimal preemptive schedules? (Q2341389) (← links)
- Minimizing total completion time for UET tasks with release time and outtree precedence constraints (Q2433242) (← links)
- Two machine preemptive scheduling problem with release dates, equal processing times and precedence constraints (Q2576249) (← links)
- A new polynomial algorithm for a parallel identical scheduling problem (Q3517881) (← links)
- Equitable scheduling on a single machine (Q6103750) (← links)