Scheduling with uncertain durations: Modeling \(\beta \)-robust scheduling with constraints

DOI10.1016/J.COR.2008.08.008zbMath1179.90164OpenAlexW2025389484MaRDI QIDQ1010287

Christine Wei Wu, J. Christopher Beck, Kenneth N. Brown

Publication date: 3 April 2009

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

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

zbMATH Keywords

uncertaintyschedulingrobust optimizationconstraints

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (9)

Robustness-based approach for fuzzy multi-objective problems ⋮ Setting optimal due dates in a basic safe-scheduling model ⋮ The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective ⋮ Maximizing the service level on the makespan in the stochastic flexible job-shop scheduling problem ⋮ Exact Algorithms for Distributionally β-Robust Machine Scheduling with Uncertain Processing Times ⋮ Minimizing value-at-risk in single-machine scheduling ⋮ Two branch-and-bound algorithms for the robust parallel machine scheduling problem ⋮ Trading off due-date tightness and job tardiness in a basic scheduling model ⋮ Minimizing earliness and tardiness costs in stochastic scheduling

Cites Work

• Branching constraint satisfaction problems and Markov decision problems compared
• Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Scheduling with uncertain durations: Modeling \(\beta \)-robust scheduling with constraints