Flow-shop and job-shop robust scheduling problems with budgeted uncertainty

Carla Juvin, Laurent Houssin, Pierre Lopez

Abstract: Highlights•Robust scheduling problems under uncertainty budget can be modelled in a compact way.•Several decomposition schemes are possible, enabling solutions to be found quickly.•The use of constraint programming to solve robust scheduling problems is efficient.•Acceleration methods for column and constraint generation are investigated.

External IDs:doi:10.1016/j.ejor.2025.04.012