The integrated yard truck and yard crane scheduling problem: Benders’ decomposition-based methods

This paper proposes a novel integrated model for yard truck and yard crane scheduling problems for loading operations in container terminal. The problem is formulated as a mixed-integer programming model. Due to the computational intractability, two efficient solution methods, based on Benders’ decomposition, are developed for problem solution; namely, the general Benders’ cut-based method and the combinatorial Benders’ cut-based method. Computational experiments are conducted to evaluate the effectiveness of the proposed solution methods.