Approximation algorithm for uniform quay crane scheduling at container ports

2016 ◽  
Vol 08 (02) ◽  
pp. 1650018 ◽  
Author(s):  
Ming Liu ◽  
Feifeng Zheng ◽  
Yinfeng Xu ◽  
Chengbin Chu
Keyword(s):  
Approximation Algorithm ◽  
Container Terminals ◽  
Container Port ◽  
Quay Crane Scheduling ◽  
Processing Efficiency ◽  
Crane Scheduling ◽  
Quay Cranes ◽  
Container Ports ◽  
Loading And Unloading ◽  
Turn Around Time

At a container port, container vessels are served by quay cranes for loading and unloading containers. Each vessel is typically split into bays from head to tail where containers are stored. Parallel quay cranes can process different bays simultaneously, and their processing efficiency significantly affects the turn-around time of a container vessel. Sharing a single traveling rail, the quay cranes cannot crossover each other, and this phenomenon is referred as the non-crossing constraint. In addition, the quay cranes may have different processing speeds due to gradual equipment updates. Inspired by updating activities of cranes in modern container terminals, this paper studies a scheduling problem with two uniform quay cranes, aiming at minimizing the turn-around time of a vessel, i.e., the makespan. We mainly develop an integrated approximation algorithm which is [Formula: see text]-approximation, where the two quay cranes are of processing speeds 1 and [Formula: see text], respectively.

The AFSA-GA Algorithm for the Quay Crane Scheduling Problem of the Loading and Unloading Operations

2017 ◽  
Vol 9 (3) ◽  
pp. 59-71
Author(s):  
Yi Liu ◽  
Sabina Shahbazzade ◽  
Jian Wang
Keyword(s):  
Programming Model ◽  
Global Optimum ◽  
Container Terminals ◽  
Mixed Integer ◽  
Quay Crane Scheduling ◽  
Crane Scheduling ◽  
Ga Algorithm ◽  
Simultaneous Loading ◽  
Loading And Unloading ◽  
Dual Cycle

In order to improve the efficiency of container terminals, eliminate the empty quay cranes movements, the simultaneous loading and unloading operations in same ship-bay is advanced. The AFSA-GA algorithm is proposed to solve the mixed integer programming model of the dual-cycle operation, which take advantage of the strong local search ability of GA and the global optimum search ability of AFSA. The experiment shows that AFSA-GA algorithm can improve the operation efficiency of quay crane significantly.

The Integrated Berth and Quay Crane Scheduling Problem in Container Terminals

2014 ◽  
Vol 587-589 ◽  
pp. 1793-1796
Author(s):  
Chun Ji Wu ◽  
Li Hua Chen ◽  
Qing Yu Zhao ◽  
Jin Xin Cao
Keyword(s):  
Programming Model ◽  
Container Terminals ◽  
Utilization Rate ◽  
Scheduling Problem ◽  
Current Development ◽  
Quay Crane Scheduling ◽  
Crane Scheduling ◽  
Operation Efficiency ◽  
Quay Cranes ◽  
Practical Operation

With the current development of the berth and quay crane in China, minimizing the total time of all ships stopping at the port, and maximizing the utilization rate of quay cranes to reduce the waiting time in the queue at the anchorage are the key to success in the field of container terminals. The objective of this paper is to minimize the total time of all stopped ships at the port and to maximize the operation efficiency of quay cranes. Compared with single berth and quay crane allocation, this paper analyzes the berth-quay crane as a whole, and an integer programming model with some constraints is built for this problem. Then the heuristic algorithm is used in this paper to optimize the problem and gain the solution. This paper provides a guide for practical operation.

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.

A Method of Quay Crane Scheduling For Container Terminals

2012 ◽  
Vol 524-527 ◽  
pp. 824-827
Author(s):  
Ning Zhao ◽  
Wei Jian Mi ◽  
Xue Bao
Keyword(s):  
Decision Making ◽  
Container Terminals ◽  
The Other ◽  
Scheduling Problem ◽  
Quay Crane Scheduling ◽  
Crane Scheduling ◽  
Heuristic Rule ◽  
Quay Cranes ◽  
Scheduling Model ◽  
Decision Making System

This paper discusses the problem of allocating and scheduling quay cranes (QCs). The problem is decomposed into two sub problems. One is QCs-allocation problem, the other is QCs-scheduling problem. The objective is to find an optimal QCs-to-tasks matching and the QCs’ work sequence so as to ensure the synchronous among QCs and then maximizes container terminal’s throughput ultimately. And then for solving the QCs-scheduling model, a novel search methodology based on heuristic rule-modules with different priority is studied. Through experiments the decision-making system for QCs allocating and scheduling is proved efficient and applied.

Quay crane scheduling in container terminals

2006 ◽  
Vol 38 (6) ◽  
pp. 723-737 ◽  
Author(s):  
W. C. Ng ◽  
K. L. Mak
Keyword(s):  
Container Terminals ◽  
Quay Crane Scheduling ◽  
Crane Scheduling
Sign in / Sign up

Export Citation Format

Share Document