Single machine robust scheduling with budgeted uncertainty

DOI10.1016/J.ORL.2023.01.007zbMATH Open1525.90188OpenAlexW4315642873MaRDI QIDQ6161900FDOQ6161900

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

Cites Work

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

Cited In (6)

• Robust scheduling for minimizing maximum lateness on a serial-batch processing machine
• Robust single machine makespan scheduling with release date uncertainty
• Single machine scheduling problems with uncertain parameters and the OWA criterion
• A single-machine scheduling problem with uncertainty in processing times and outsourcing costs
• A robust approach for the single machine scheduling problem
• A single representative min-max-min robust selection problem with alternatives and budgeted uncertainty

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6161900)