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 …
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…