Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 156, Issue 3, Pages 752-768Publisher
ELSEVIER
DOI: 10.1016/S0377-2217(03)00133-4
Keywords
scheduling; branch and bound; transportation; container terminal; combinatorial optimization
Ask authors/readers for more resources
This paper discusses the problem of scheduling quay cranes (QCs), the most important equipment in port terminals. A mixed-integer programming model, which considers various constraints related to the operation of QCs, was formulated. This study proposes a branch and bound (B & B) method to obtain the optimal solution of the QC scheduling problem and a heuristic search algorithm, called greedy randomized adaptive search procedure (GRASP), to overcome the computational difficulty of the B & B method. The performance of GRASP is compared with that of the B & B method. (C) 2003 Published by Elsevier B.V.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available