Bold, Matthew; Goerigk, Marc - In: Journal of Scheduling 28 (2024) 3, pp. 269-287
This paper considers a recoverable robust single-machine scheduling problem under polyhedral uncertainty with the objective of minimising the total flow time. In this setting, a decision-maker must determine a first-stage schedule subject to the uncertain job processing times. Then following the...