Single machine robust scheduling with budgeted uncertainty

DOI10.1016/J.ORL.2023.01.007MaRDI QIDQ6161900zbMATHOpenAlexFDO

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)

Recommendations

• Robust scheduling with budgeted uncertainty
• Minimizing the weighted sum of completion times under processing time uncertainty
• Single machine scheduling with scenarios
• Approximating Single Machine Scheduling with Scenarios
• Algorithms and complexity analysis for robust single-machine scheduling problems

Cites work

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