Pages that link to "Item:Q1306357"
From MaRDI portal
The following pages link to An O\((n^4)\) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs (Q1306357):
Displayed 7 items.
- Preemptive scheduling of equal-length jobs in polynomial time (Q626963) (← links)
- Minimizing the weighted number of tardy jobs on a single machine with release dates (Q852934) (← links)
- Approximation algorithms for scheduling real-time jobs with multiple feasible intervals (Q853634) (← links)
- Scheduling jobs with release times preemptively on a single machine to minimize the number of late jobs (Q1043248) (← links)
- Preemptive scheduling of equal-length jobs to maximize weighted throughput. (Q1426730) (← links)
- A branch and bound to minimize the number of late jobs on a single machine with release time constraints (Q1869685) (← links)
- On-line scheduling on a single machine: Maximizing the number of early jobs (Q5929136) (← links)