Setting optimal due dates in a basic safe-scheduling model

DOI10.1016/J.COR.2013.07.022zbMATH Open1348.90340OpenAlexW2082762128MaRDI QIDQ336772FDOQ336772

Authors: 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

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†

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)

Cites Work

• 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
• Survey of scheduling research involving due date determination decisions
• Principles of Sequencing and Scheduling
• Dynamic scheduling of stochastic jobs on a single machine
• Sequencing with Earliness and Tardiness Penalties: A Review
• Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
• Scheduling with uncertain durations: Modeling \(\beta \)-robust scheduling with constraints
• 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
• 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
• Note—On Baluts Algorithm and NP-Completeness for a Chance-Constrained Scheduling Problem
• Stochastic Scheduling with Release Dates and Due Dates
• Title not available (Why is that?)
• 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

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
• Minimizing earliness and tardiness costs in stochastic scheduling
• Due-window assignment scheduling problem with stochastic processing times
• 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)