Investigating the Recoverable Robust Single Machine Scheduling Problem Under Interval Uncertainty

DOI10.1016/J.DAM.2022.02.005MaRDI QIDQ6373252arXivFDO

Authors Matthew Bold, Marc Goerigk

Publication date 20 July 2021

Published in arXiv

Full work available at URL https://doi.org/10.1016/J.DAM.2022.02.005

Mathematics Subject Classification ID

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

arXiv classification

cs.DMcs.DSmath.OC

Abstract: We investigate the recoverable robust single machine scheduling problem under interval uncertainty. In this setting, jobs have first-stage processing times p and second-stage processing times q and we aim to find a first-stage and second-stage schedule with a minimum combined sum of completion times, such that at least Delta jobs share the same position in both schedules. We provide positive complexity results for some important special cases of this problem, as well as derive a 2-approximation algorithm to the full problem. Computational experiments examine the performance of an exact mixed-integer programming formulation and the approximation algorithm, and demonstrate the strength of a proposed polynomial time greedy heuristic.

This page was built for publication: Investigating the Recoverable Robust Single Machine Scheduling Problem Under Interval Uncertainty

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