Please use this identifier to cite or link to this item:

On dynamic crane deployment in container terminals

Authors Lin, Wuqin
Issue Date 2000
Summary This thesis studies the problem of scheduling the movements of cranes in a container storage yard so as to minimize the total unfinished workload at the end of each time period. The problem is formulated as a mixed integer linear program, and the computational complexity of the problem is analyzed. A Lagrangian decomposition solution procedure is described. A new solution approach, called the successive piecewise-linear approximation method, is also developed. Through computational experiments, we show that our proposed solution methods are both efficient and effective for large size problems.
Note Thesis (M.Phil.)--Hong Kong University of Science and Technology, 2000
Language English
Format Thesis
Access View full-text via DOI
Files in this item:
File Description Size Format
th_redirect.html 339 B HTML
Copyrighted to the author. Reproduction is prohibited without the author’s prior written consent.