Pages that link to "Item:Q439607"
From MaRDI portal
The following pages link to Preemptive scheduling of two uniform parallel machines to minimize total tardiness (Q439607):
Displaying 10 items.
- An efficient algorithm for finding ideal schedules (Q766186) (← links)
- An \(O( n^2)\) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness (Q880552) (← links)
- Preemptive scheduling of equal length jobs with release dates on two uniform parallel machines (Q1040089) (← links)
- On the two-phase method for preemptive scheduling (Q1107434) (← links)
- A backward approach in list scheduling algorithms for multi-machine tardiness problems (Q1891242) (← links)
- On preemptive scheduling: A general setting for the two-phase method (Q1917267) (← links)
- Minimizing total tardiness on parallel machines with preemptions (Q2434279) (← links)
- Two machine preemptive scheduling problem with release dates, equal processing times and precedence constraints (Q2576249) (← links)
- Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs (Q3826352) (← links)
- On preemption redundancy in scheduling unit processing time jobs on two parallel machines (Q5945391) (← links)
