An O( n^2) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness
From MaRDI portal
(Redirected from Publication:880552)
An \(O( n^2)\) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness
An \(O( n^2)\) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness
Recommendations
- An exact algorithm for the preemptive single machine scheduling of equal-length jobs
- Preemptive Scheduling of Equal Length Jobs on Two Machines to Minimize Mean Flow Time
- An O\((n^4)\) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
- Minimizing total weighted tardiness for scheduling equal-length jobs on a single machine
- Preemptive scheduling of equal-length jobs in polynomial time
- Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness
- Preemptive scheduling of two uniform parallel machines to minimize total tardiness
- Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan
- Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs
- A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
Cites work
- scientific article; zbMATH DE number 3883931 (Why is no real title available?)
- scientific article; zbMATH DE number 5345853 (Why is no real title available?)
- scientific article; zbMATH DE number 3691044 (Why is no real title available?)
- scientific article; zbMATH DE number 40477 (Why is no real title available?)
- scientific article; zbMATH DE number 1302193 (Why is no real title available?)
- Complexity results for single-machine problems with positive finish-start time-lags
- One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
- Optimal assignment of due-dates for preemptive single-machine scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling equal-length jobs on identical parallel machines
- Solution of the single machine total tardiness problem
Cited in
(12)- An exact algorithm for the preemptive single machine scheduling of equal-length jobs
- A survey on how the structure of precedence constraints may change the complexity class of scheduling problems
- Scheduling to tradeoff between the number and the length of accepted jobs
- Optimal work-conserving scheduler synthesis for real-time sporadic tasks using supervisory control of timed discrete-event systems
- Preemptive scheduling of equal-length jobs in polynomial time
- Modeling single machine preemptive scheduling problems for computational efficiency
- Competitive two-agent scheduling with release dates and preemption on a single machine
- Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness
- Parallel machine problems with equal processing times: a survey
- Minimizing total weighted tardiness for scheduling equal-length jobs on a single machine
- Minimizing total tardiness on parallel machines with preemptions
- Preemptive Scheduling of Equal Length Jobs on Two Machines to Minimize Mean Flow Time
This page was built for publication: An \(O( n^2)\) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q880552)
