Pages that link to "Item:Q626963"
From MaRDI portal
The following pages link to Preemptive scheduling of equal-length jobs in polynomial time (Q626963):
Displaying 11 items.
- Properties of optimal schedules for the minimization total weighted completion time in preemptive equal-length job with release dates scheduling problem on a single machine (Q612212) (← links)
- Scheduling equal processing time jobs to minimize the weighted number of late jobs (Q853793) (← 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 interval orders is polynomial (Q913500) (← links)
- Preemptive scheduling of equal-length jobs to maximize weighted throughput. (Q1426730) (← links)
- Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time (Q1885337) (← links)
- Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times (Q1964481) (← links)
- An exact algorithm for the preemptive single machine scheduling of equal-length jobs (Q2147002) (← links)
- A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack (Q2400435) (← links)
- A fast algorithm for multi-machine scheduling problems with jobs of equal processing times (Q3113703) (← links)
- Time-of-use scheduling problem with equal-length jobs (Q6111939) (← links)
