Pages that link to "Item:Q3202129"
From MaRDI portal
The following pages link to Preemptive Scheduling of Equal Length Jobs on Two Machines to Minimize Mean Flow Time (Q3202129):
Displaying 14 items.
- Preemptive scheduling of two uniform parallel machines to minimize total tardiness (Q439607) (← links)
- Preemptive scheduling of equal-length jobs in polynomial time (Q626963) (← links)
- An \(O( n^2)\) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness (Q880552) (← links)
- The complexity of mean flow time scheduling problems with release times (Q880590) (← links)
- Preemptive scheduling to minimize mean weighted flow time (Q910208) (← links)
- Minimizing mean flow time with release time constraint (Q914352) (← links)
- Preemptive scheduling on uniform machines to minimize mean flow time (Q1017456) (← links)
- Preemptive scheduling of equal length jobs with release dates on two uniform parallel machines (Q1040089) (← links)
- Ideal preemptive schedules on two processors (Q1424363) (← links)
- Preemptive scheduling of equal-length jobs to maximize weighted throughput. (Q1426730) (← links)
- Normal-form preemption sequences for an open problem in scheduling theory (Q1702732) (← links)
- Preemptive scheduling on identical parallel machines subject to deadlines. (Q1810503) (← links)
- Ideal schedules in parallel machine settings (Q2029359) (← links)
- Two machine preemptive scheduling problem with release dates, equal processing times and precedence constraints (Q2576249) (← links)
