Safe scheduling: Setting due dates in single-machine problems

DOI10.1016/J.EJOR.2008.02.009zbMath1161.90403OpenAlexW2019121312MaRDI QIDQ2378451

Dan Trietsch, Kenneth R. Baker

Publication date: 8 January 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2008.02.009

zbMATH Keywords

heuristicsschedulingstochastic schedulingdue-date setting

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Stochastic scheduling theory in operations research (90B36)

Related Items (6)

Setting optimal due dates in a basic safe-scheduling model ⋮ Solving a stochastic single machine problem with initial idle time and quadratic objective ⋮ Analysis of computer job control under uncertainty ⋮ Due-window assignment scheduling problem with stochastic processing times ⋮ Trading off due-date tightness and job tardiness in a basic scheduling model ⋮ Minimizing earliness and tardiness costs in stochastic scheduling

Cites Work

• Unnamed Item
• Minimizing the number of tardy jobs with stochastically-ordered processing times
• Minimizing the number of late jobs in a stochastic setting using a chance constraint
• Survey of scheduling research involving due date determination decisions
• The stochastic single machine scheduling problem with earliness and tardiness costs
• Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs
• Setting due dates in a stochastic single machine environment

This page was built for publication: Safe scheduling: Setting due dates in single-machine problems