Constraint Programming for the Robust Two-Machine Flow-Shop Scheduling Problem with Budgeted Uncertainty

Download PDF
Open Webpage

Carla Juvin, Laurent Houssin, Pierre Lopez

Published: 2023, Last Modified: 11 Dec 2025CPAIOR 2023EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: This paper addresses the robust two-machine permutation flow-shop scheduling problem considering non-deterministic operation processing times associated with an uncertainty budget. The objective is to minimize the makespan of the schedule.