The problem of scheduling identical quay cranes moving along a common linear rail to handle containers for a ship is studied. The ship has a number of container-stacking compartments called bays, and only one quay crane can work on a bay at the same time. The objective of the scheduling problem is to find the work schedule for each quay crane which minimizes the ship’s stay time in port. Find…
The competitiveness of a container terminal is highly conditioned by the time that container vessels spend on it. The proper scheduling of the quay cranes can reduce this time and allows a container terminal to be more attractive to shipping companies. The goal of the Quay Crane Scheduling Problem (QCSP) is to minimize the handling time of the available quay cranes when performing the tasks of …
Dual cycling is an operation technique whereby quay cranes perform loading and unloading operations simultaneously in the same ship bay. In this article, a mixedinteger programming model for quay crane dual-cycling scheduling is developed. The model considers the stowage plan of outbound containers and the operation sequence of quay cranes. To solve the model, a heuristic method, called bi-leve…
One of the most important operations in marine container terminals is quay crane scheduling. The quay crane scheduling problem (QCSP) involves scheduling groups of containers to be loaded and unloaded by each quay crane. It also requires addressing practical issues such as minimum spacing between quay cranes and precedence relationships between container groups. This study addresses the QCSP wi…
In this work we describe some decisional problems arising in the management of maritime container ports, together with optimisation models and algorithms suitably designed for their solution. We refer to the Gioia Tauro container terminal which recently has reached a high stage of growth, becoming one of the most important transhipment ports in the Mediterranean Sea. In particular, we focus on …
Most of the operational problems in container terminals are strongly interconnected. In this paper, we study the integrated Berth Allocation and Quay Crane Assignment Problem in seaport container terminals. We will extend the current state-of-the-art by proposing novel set partitioning models. To improve the performance of the set partitioning formulations, a number of variable reduction techni…
This paper studies two tactical level decision problems arising in transshipment hubs: berth template planning that is concerned with allocating berths and quay cranes to arriving vessels, and yard template planning that is concerned with assigning yard storage locations to vessels. These two tactical level decisions interact with each other. A mixed-integer programming model is proposed to int…