Stochastic programming approach for unidirectional quay crane scheduling problem with uncertainty

Abstract

Quay crane scheduling is a key aspect of container terminal operation, which can be regarded as a decision-making process with uncertainty. Each task involves stochastic loading and unloading operation times owing to the existence of uncertainty. In this study, we investigate the unidirectional quay crane scheduling problem for a stochastic processing time, which requires that all the quay cranes move in the same direction either from bow to stern, or vice versa, throughout the planning horizon. The problem is formulated as a two-stage stochastic mixed-integer programming model, where the binary first-stage decision variables correspond to the assignment of tasks to quay cranes, and the mixed-integer second-stage decision variables are related to the generation of detailed schedules. To make the model solvable, we develop an alternative equivalent reformulation with a special structure that involves binary variables in the first stage and continuous variables in the second stage. To solve this reformulated model, an integer L-shaped method is presented for small-size instances, and a simulated annealing algorithm is presented for large-size instances to obtain near-optimal solutions. Numerical experiments show that the integer L-shaped method and simulated annealing algorithm could efficiently solve the unidirectional quay crane scheduling problem with uncertainty. The results also indicate that the stochastic model has distinct advantages in terms of shortening the completion time of vessels and improving the service level of container terminals compared with the expected value problem solutions.