Trading off due-date tightness and job tardiness in a basic scheduling model
From MaRDI portal
Publication:2356123
DOI10.1007/S10951-014-0394-9zbMath1320.90023OpenAlexW1994023138MaRDI QIDQ2356123
Kenneth R. Baker, Dan Trietsch
Publication date: 28 July 2015
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-014-0394-9
Cites Work
- Unnamed Item
- Scheduling with uncertain durations: Modeling \(\beta \)-robust scheduling with constraints
- Survey of scheduling research involving due date determination decisions
- Sequencing jobs on a single machine with a common due data and stochastic processing times
- The stochastic single machine scheduling problem with earliness and tardiness costs
- Dynamic scheduling of stochastic jobs on a single machine
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs
- Safe scheduling: Setting due dates in single-machine problems
- Setting due dates in a stochastic single machine environment
- Principles of Sequencing and Scheduling
- Due-Date Setting and Priority Sequencing in a Multiclass M/G/1 Queue
- Scheduling to Minimize the Number of Late Jobs When Set-Up and Processing Times are Uncertain
This page was built for publication: Trading off due-date tightness and job tardiness in a basic scheduling model