A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal

• Published in: Naval research logistics 2006-02, Vol.53 (1), p.45-59
• Main Authors: Moccia, Luigi, Cordeau, Jean-François, Gaudioso, Manlio, Laporte, Gilbert
• Format: Article
• Language: English
• Subjects: branch-and-cut; maritime container terminal; quay crane scheduling
• ISSN: 0894-069X; 1520-6750
• DOI: 10.1002/nav.20121

The quay crane scheduling problem consists of determining a sequence of unloading and loading movements for cranes assigned to a vessel in order to minimize the vessel completion time as well as the crane idle times. Idle times originate from interferences between cranes since these roll on the same rails and a minimum safety distance must be maintained between them. The productivity of container terminals is often measured in terms of the time necessary to load and unload vessels by quay cranes, which are the most important and expensive equipment used in ports. We formulate the quay crane scheduling problem as a vehicle routing problem with side constraints, including precedence relationships between vertices. For small size instances our formulation can be solved by CPLEX. For larger ones we have developed a branch‐and‐cut algorithm incorporating several families of valid inequalities, which exploit the precedence constraints between vertices. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006