Setting optimal due dates in a basic safe-scheduling model
From MaRDI portal
(Redirected from Publication:336772)
Recommendations
- Safe scheduling: Setting due dates in single-machine problems
- On the Assignment of Optimal Due Dates
- Optimal due-date assignment and sequencing
- Trading off due-date tightness and job tardiness in a basic scheduling model
- Optimal restricted due date assignment in scheduling
- A Generalized Model of Optimal Due-Date Assignment by Linear Programming
- Optimal constant due-date assignment and sequencing
- On Optimal Common Due-Date Determination
- Setting due dates in a stochastic single machine environment
- Optimal due-date assignment in a job shop†
Cites work
- scientific article; zbMATH DE number 1061797 (Why is no real title available?)
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Dynamic scheduling of stochastic jobs on a single machine
- Note—On Baluts Algorithm and NP-Completeness for a Chance-Constrained Scheduling Problem
- On the minimization of the weighted number of tardy jobs with random processing times and deadline
- Principles of Sequencing and Scheduling
- Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
- Safe scheduling: Setting due dates in single-machine problems
- Scheduling to Minimize the Number of Late Jobs When Set-Up and Processing Times are Uncertain
- Scheduling with Random Service Times
- Scheduling with uncertain durations: Modeling \(\beta \)-robust scheduling with constraints
- Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs
- Sequencing jobs on a single machine with a common due data and stochastic processing times
- Sequencing with Earliness and Tardiness Penalties: A Review
- Setting due dates in a stochastic single machine environment
- Single machine sequencing with random processing times and random due‐dates
- Stochastic Scheduling with Release Dates and Due Dates
- Survey of scheduling research involving due date determination decisions
- The stochastic single machine scheduling problem with earliness and tardiness costs
Cited in
(5)- Trading off due-date tightness and job tardiness in a basic scheduling model
- Safe scheduling: Setting due dates in single-machine problems
- Due-window assignment scheduling problem with stochastic processing times
- Minimizing earliness and tardiness costs in stochastic scheduling
- Evaluation of the quantiles and superquantiles of the makespan in interval valued activity networks
This page was built for publication: Setting optimal due dates in a basic safe-scheduling model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336772)
