Pages that link to "Item:Q880552"
From MaRDI portal
The following pages link to An \(O( n^2)\) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness (Q880552):
Displayed 4 items.
- Preemptive scheduling of equal-length jobs in polynomial time (Q626963) (← links)
- Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness (Q1038111) (← links)
- Parallel machine problems with equal processing times: a survey (Q2434248) (← links)
- Minimizing total tardiness on parallel machines with preemptions (Q2434279) (← links)