A Lagrangian relaxation-based heuristic for the multi-ship quay crane scheduling problem with ship stability constraints.

The quay crane scheduling problem is one of the major problems of quayside operational planning in container terminals. The operational efficiency of quay cranes is a large determinant of the overall container terminal efficiency; thus, in an effort to maximize throughput, more and more emphasis is placed on systematically addressing and improving quay crane operations. However, the resulting formulations are highly complex and thus not solvable using commercial software. In the first part of the present paper, we develop a formulation that overcomes this challenge. This allows for solving the model using CPLEX, even for large size instances, which other notable work from the literature fails to solve. The second part of this paper addresses a crucial point which has rarely been accounted for, which is ship stability. A heuristic is developed to solve the extended problem, as it is no longer solvable in CPLEX. The remaining objective of this work is to extend this problem to the multi-ship case. However, once again the problem is insolvable for large instances using CPLEX, even without accounting for stability constraints. We develop a Lagrangian relaxation based algorithm that decomposes the problem by ship, which is solved efficiently as a single ship case. The Lagrangian multipliers are updated using the cutting plane method and the solution of the Lagrangian master problem provides an upper bound on the optimal value of the Lagrangian lower bound. Upper bounds on the optimal value of the original problem are obtained using a constructive heuristic, and through computational experiments we demonstrate the performance of the Lagrangian relaxation-based procedures. [ABSTRACT FROM AUTHOR]