Pages that link to "Item:Q1424363"
From MaRDI portal
The following pages link to Ideal preemptive schedules on two processors (Q1424363):
Displaying 8 items.
- An efficient algorithm for finding ideal schedules (Q766186) (← 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)
- 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)
- A new polynomial algorithm for a parallel identical scheduling problem (Q3517881) (← links)
