A crane scheduling method for port container terminals
European Journal Of Operational Research (2004)
- ISSN: 03772217
- DOI: 10.1016/S0377-2217(03)00133-4
Available from linkinghub.elsevier.com
or
Abstract
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.
Author-supplied keywords
Sign up today - FREE
Mendeley saves you time finding and organizing research. Learn more
- All your research in one place
- Add and import papers easily
- Access it anywhere, anytime
Start using Mendeley in seconds!
Readership Statistics
9 Readers on Mendeley
by Discipline
22% Engineering
by Academic Status
56% Ph.D. Student
33% Student (Master)
11% Assistant Professor
by Country
22% India
11% South Korea
11% Germany