is employed to find an optimal solution.

[@Ng2005263; @doi:10.1080/03052150500323849] studied the problem of scheduling a YC that has to load/unload a given set of containers with different ready times. The objective is to minimize the sum of waiting times. The problem is formulated as mixed integer programming problem, and a branch-and-bound algorithm is developed for its solution. [@RePEc:eee:ejores:v:164:y:2005:i:1:p:64-78] expands the study to the scheduling of multiple YCs in order to minimize the total loading time or the sum of truck waiting times. Because more than one YC can serve a storage block, a no-passing constraint has to be enforced. A dynamic programming based heuristic is proposed to solve the problem and a lower bound is derived to be able to assess the quality of the solutions produced by the heuristic.

[@petering2009effect] investigates how the width of the storage blocks affects the efficiency of the operations at a container terminal, given that the number of prime movers, the number of YCs, the service rates of the YCs remain unchanged. A simulation study indicates that the optimal storage block width ranges form 6 to 12 rows, depending on the size and shape of the terminal and the annual number of containers handled 