Setting optimal due dates in a basic safe-scheduling model

DOI10.1016/j.cor.2013.07.022zbMath1348.90340OpenAlexW2082762128MaRDI QIDQ336772

Kenneth R. Baker

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2013.07.022

zbMATH Keywords

due-date settingsafe schedulingservice levelsstochastic sequencing

Mathematics Subject Classification ID

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

Related Items (3)

Evaluation of the quantiles and superquantiles of the makespan in interval valued activity networks ⋮ Due-window assignment scheduling problem with stochastic processing times ⋮ Minimizing earliness and tardiness costs in stochastic scheduling

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
• On the minimization of the weighted number of tardy jobs with random processing times and deadline
• 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
• Sequencing with Earliness and Tardiness Penalties: A Review
• Principles of Sequencing and Scheduling
• Note—On Baluts Algorithm and NP-Completeness for a Chance-Constrained Scheduling Problem
• Stochastic Scheduling with Release Dates and Due Dates
• Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
• Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
• Single machine sequencing with random processing times and random due‐dates
• Scheduling with Random Service Times
• Scheduling to Minimize the Number of Late Jobs When Set-Up and Processing Times are Uncertain

This page was built for publication: Setting optimal due dates in a basic safe-scheduling model