Decomposition algorithms for the robust unidirectional quay crane scheduling problems

Our study focuses on a two-stage robust optimization model for the unidirectional quay crane scheduling problem with uncertain handling times at container terminals. We first implement two classical algorithms adopted in Li and Zhang (2021), the Benders decomposition algorithm and the column-and-constraint generation algorithm, to solve the robust model. Based on analytical and numerical comparisons of them, we design an exact hybrid algorithm to leverage capabilities of both algorithms by alternatively adding cuts of both kinds. Extensive experiments validate the effectiveness of this mechanism. Numerical experiments also reveal that the benefit and the cost of robustness fade away as the uncertainty budget increases and highlight the advantage of our robust approach to deal with uncertainty over a two-stage stochastic program under extreme situations.