Fast solution of single-machine scheduling problem with embedded jobs
From MaRDI portal
Recommendations
- Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time
- A study of single-machine scheduling problem to maximize throughput
- Minimization of the maximal lateness for a single machine
- The Pareto-optimal set of the NP-hard problem of minimization of the maximum lateness for a single machine
- Single-machine scheduling with release times and tails
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A note on scheduling equal-length jobs to maximize throughput
- A study of single-machine scheduling problem to maximize throughput
- Constrained \(k\)-center and movement to independence
- Interval scheduling: A survey
- Minimization of the maximal lateness for a single machine
- Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines
- Single-machine scheduling with release times and tails
- Some simple scheduling algorithms
Cited in
(1)
This page was built for publication: Fast solution of single-machine scheduling problem with embedded jobs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2420645)