Single machine robust scheduling with budgeted uncertainty

DOI10.1016/j.orl.2023.01.007zbMath1525.90188OpenAlexW4315642873MaRDI QIDQ6161900

Marin Bougeret, Artur Alves Pessoa, Michael Poss

Publication date: 28 June 2023

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2023.01.007

zbMATH Keywords

approximation algorithmsrobust scheduling\(\mathcal{NP}\)-hardness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (1)

A single representative min-max-min robust selection problem with alternatives and budgeted uncertainty

Cites Work

• Approximating a two-machine flow shop scheduling under discrete scenario uncertainty
• Algorithms and complexity analysis for robust single-machine scheduling problems
• Complexity of single machine scheduling problems under scenario-based uncertainty
• Fast approximation algorithm for job sequencing with deadlines
• Robust discrete optimization and its applications
• Robust discrete optimization and network flows
• Robust combinatorial optimization with knapsack uncertainty
• Robust scheduling with budgeted uncertainty
• Optimization over Integers with Robustness in Cost and Few Constraints
• Approximating Single Machine Scheduling with Scenarios
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
• Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• A Functional Equation and its Application to Resource Allocation and Sequencing Problems
• Approximation results for makespan minimization with budgeted uncertainty

This page was built for publication: Single machine robust scheduling with budgeted uncertainty