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

2005 ◽  
Vol 53 (1) ◽  
pp. 45-59 ◽  
Author(s):  
Luigi Moccia ◽  
Jean-François Cordeau ◽  
Manlio Gaudioso ◽  
Gilbert Laporte
Keyword(s):  
Container Terminal ◽  
Branch And Cut ◽  
Scheduling Problem ◽  
Quay Crane Scheduling ◽  
Crane Scheduling

Review on the Berth Allocation and Quay Cranes Assignment Problems in Container Terminal

2014 ◽  
Vol 587-589 ◽  
pp. 1789-1792
Author(s):  
Yong Liang Zhou ◽  
Ri Dong Wang ◽  
Qing Yu Zhao ◽  
Jin Xin Cao
Keyword(s):  
Container Terminal ◽  
Recent Decade ◽  
Scheduling Problem ◽  
Berth Allocation ◽  
Quay Crane Scheduling ◽  
Assignment Problems ◽  
Crane Scheduling ◽  
Quay Cranes ◽  
Container Ports

In recent decade, containers become an important part of the world's economy. With the growth in offshore trade, problems about container and port are attention by research scholars in many countries. In the study on the problem in container ports, Berth Allocation and Quay Crane Scheduling problem are very important; optimization of the two problems can improve the efficient of container ports. In this paper, we describe and classify the main Berth Allocation Processes and Quay Crane Scheduling and present a survey of methods for their single optimization and integrate optimization.

scholarly journals Planning of one-way quay cranes using the genetic algorithm

2021 ◽  
Vol 119 ◽  
pp. 07005
Author(s):  
Sanaa Aidi ◽  
Imane Torbi ◽  
Mohamed Mazouzi ◽  
Imad Belassiria
Keyword(s):  
Essential Role ◽  
Container Terminal ◽  
Optimal Time ◽  
Scheduling Problem ◽  
Quay Crane Scheduling ◽  
Crane Scheduling ◽  
Quay Cranes ◽  
The One ◽  
Container Terminal Management ◽  
Special Strategy

The quay crane scheduling problem plays an essential role in the port container terminal management paradigm, as it is closely related to the berthing time of ships. In this article, we focus on the quay crane scheduling problem based on a special strategy, which forces the quay crane to move in one direction during the process of unloading and loading the containers. The scheduling problem that arises when this strategy is applied is called the one-way scheduling problem of quay cranes in the literature. In this article, we seek a mathematical formula for the unidirectional scheduling problem of quay cranes that can be easily solved by genetic algorithms. This algorithm provides us with the best combination of containers to unload and load at the optimal time.

The Quay Crane Scheduling Problem With Stability Constraints

2018 ◽  
Vol 15 (3) ◽  
pp. 1399-1412 ◽  
Author(s):  
Zizhen Zhang ◽  
Ming Liu ◽  
Chung-Yee Lee ◽  
Jiahai Wang
Keyword(s):  
Scheduling Problem ◽  
Quay Crane Scheduling ◽  
Crane Scheduling

A heuristic for the quay crane scheduling problem based on contiguous bay crane operations

2012 ◽  
Vol 39 (12) ◽  
pp. 2915-2928 ◽  
Author(s):  
Zhiqiang Lu ◽  
Xiaole Han ◽  
Lifeng Xi ◽  
Alan L. Erera
Keyword(s):  
Scheduling Problem ◽  
Quay Crane Scheduling ◽  
Crane Scheduling

A tabu search heuristic for the quay crane scheduling problem

2007 ◽  
Vol 10 (4-5) ◽  
pp. 327-336 ◽  
Author(s):  
Marcello Sammarra ◽  
Jean-François Cordeau ◽  
Gilbert Laporte ◽  
M. Flavia Monaco
Keyword(s):  
Tabu Search ◽  
Scheduling Problem ◽  
Quay Crane Scheduling ◽  
Crane Scheduling ◽  
Search Heuristic

The Quay Crane Scheduling Problem

2015 ◽  
Vol 36 ◽  
pp. 87-94 ◽  
Author(s):  
Noura Al-Dhaheri ◽  
Ali Diabat
Keyword(s):  
Scheduling Problem ◽  
Quay Crane Scheduling ◽  
Crane Scheduling
Sign in / Sign up

Export Citation Format

Share Document