Single machine scheduling problem with common due date
From MaRDI portal
algorithmscombinatoricsdispatchingdue dateearlinessjob scheduling problemmathematical programmingoptimizationsequencingtardiness
Deterministic scheduling theory in operations research (90B35) Combinatorics (educational aspects) (97K20) Operations research, economics (aspects of mathematics education) (97M40) Physics, astronomy, technology, engineering (aspects of mathematics education) (97M50) Mathematical programming (educational aspects) (97N60)
Recommendations
- On Optimal Common Due-Date Determination
- Multiple common due dates
- A single machine scheduling problem with earliness/tardiness and starting time penalties under a common due date
- Optimal scheduling of jobs about a common due date on a single machine
- Single-machine scheduling to minimize earliness and number of tardy jobs
Cited in
(9)- On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date
- Single machine \(\text{MAD}/T_{\max}\) problem with a common due date
- The weighted common due date single machine scheduling problem revisited
- Single machine batch just-in-time scheduling problems with common batch size and common due date of jobs
- scientific article; zbMATH DE number 6830974 (Why is no real title available?)
- Minimization of total absolute deviation for a common due date
- Optimal scheduling of jobs about a common due date on a single machine
- Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates
- Two due date assignment problems in scheduling a single machine
This page was built for publication: Single machine scheduling problem with common due date
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5310156)
