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):
Displaying 13 items.
- Preemptive scheduling of equal-length jobs in polynomial time (Q626963) (← links)
- Minimizing total weighted tardiness for scheduling equal-length jobs on a single machine (Q827995) (← links)
- Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness (Q1038111) (← links)
- An O\((n^4)\) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs (Q1306357) (← links)
- A survey on how the structure of precedence constraints may change the complexity class of scheduling problems (Q1617290) (← links)
- Optimal work-conserving scheduler synthesis for real-time sporadic tasks using supervisory control of timed discrete-event systems (Q2061133) (← links)
- An exact algorithm for the preemptive single machine scheduling of equal-length jobs (Q2147002) (← links)
- Scheduling to tradeoff between the number and the length of accepted jobs (Q2235744) (← links)
- Modeling single machine preemptive scheduling problems for computational efficiency (Q2288995) (← links)
- Parallel machine problems with equal processing times: a survey (Q2434248) (← links)
- Minimizing total tardiness on parallel machines with preemptions (Q2434279) (← links)
- Preemptive Scheduling of Equal Length Jobs on Two Machines to Minimize Mean Flow Time (Q3202129) (← links)
- Competitive two-agent scheduling with release dates and preemption on a single machine (Q6116025) (← links)
