Investigating the recoverable robust single machine scheduling problem under interval uncertainty

DOI10.1016/j.dam.2022.02.005zbMath1485.90050OpenAlexW4220760292MaRDI QIDQ833004

Matthew Bold, Marc Goerigk

Publication date: 28 March 2022

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2022.02.005

zbMATH Keywords

schedulingrecoverable robustnessoptimisation under uncertainty

Mathematics Subject Classification ID

Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Stochastic scheduling theory in operations research (90B36) Approximation algorithms (68W25)

Related Items (1)

On the complexity of robust multi-stage problems with discrete recourse

Cites Work

• Single machine scheduling problems with uncertain parameters and the OWA criterion
• Exact and heuristic algorithms for the interval data robust assignment problem
• On the robust single machine scheduling problem
• Complexity of single machine scheduling problems under scenario-based uncertainty
• A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion
• Robust discrete optimization and its applications
• Single machine scheduling with scenarios
• A family of inequalities valid for the robust single machine scheduling polyhedron
• Risk-averse single machine scheduling: complexity and approximation
• The recoverable robust spanning tree problem with interval costs is polynomially solvable
• Recoverable robust spanning tree problem under interval uncertainty representations
• Robust recoverable and two-stage selection problems
• Robust scheduling with budgeted uncertainty
• Complexity of minimizing the total flow time with interval data and minmax regret criterion
• A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data
• Recoverable robust shortest path problems
• The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production

This page was built for publication: Investigating the recoverable robust single machine scheduling problem under interval uncertainty