Scheduling to tradeoff between the number and the length of accepted jobs
From MaRDI portal
Publication:2235744
Recommendations
- A note on single-machine scheduling to tradeoff between the number of tardy jobs and the start time of machine
- Single-machine scheduling with trade-off between number of tardy jobs and resource allocation
- An \(O( n^2)\) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness
- An O\((n^4)\) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
- Single-machine scheduling with trade-off between number of tardy jobs and compression cost
Cites work
- A note on the single machine scheduling to minimize the number of tardy jobs with deadlines
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Complexity of single machine hierarchical scheduling: A survey
- Complexity of two dual criteria scheduling problems
- Introduction to algorithms.
- Minimizing the number of late jobs when the start time of the machine is variable
- Necessary and sufficient conditions of optimality for some classical scheduling problems
- Unary NP-hardness of minimizing the number of tardy jobs with deadlines
Cited in
(3)
This page was built for publication: Scheduling to tradeoff between the number and the length of accepted jobs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2235744)