Heuristics for quay crane scheduling at indented berth

2011 ◽  
Vol 47 (6) ◽  
pp. 1005-1020 ◽  
Author(s):  
Jiang Hang Chen ◽  
Der-Horng Lee ◽  
Jin Xin Cao
Keyword(s):  
Quay Crane Scheduling ◽  
Crane Scheduling

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

Quay crane scheduling with dual cycling

2014 ◽  
Vol 47 (10) ◽  
pp. 1343-1360 ◽  
Author(s):  
Dandan Wang ◽  
Xiaoping Li
Keyword(s):  
Quay Crane Scheduling ◽  
Crane Scheduling

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

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.

Sign in / Sign up

Export Citation Format

Share Document