Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/13236
Title: Berth allocation and quay crane scheduling in port container terminals
Authors: WANG HUIQIU
Keywords: berth allocation, quay crane scheduling, NP-completeness, approximation algorithm, genetic algorithm, port container terminals
Issue Date: 25-Mar-2008
Source: WANG HUIQIU (2008-03-25). Berth allocation and quay crane scheduling in port container terminals. ScholarBank@NUS Repository.
Abstract: Nowadays competition between port container terminals, especially between geographically close ones, is rapidly increasing. How to improve the competitiveness of port container terminals is, therefore, an immediate challenge, with which port operators are confronted. In terms of port competitiveness, the efficiency of the port container terminal is a critical success factor. Berth allocation and quay crane scheduling affect the efficiency of the port container terminal significantly since berths and quay cranes are the interface between land side and water side in any port container terminal. In practice, berth allocation and quay crane scheduling are based on experience and simulation techniques in port container terminals. Analytic models are an advantage and are not limited by experience-generated rules-of-thumbs or simulation, and thus this research attempts to develop analytic models considering various practical constraints for berth allocation and quay crane scheduling to enhance the competitiveness of port container terminals.
URI: http://scholarbank.nus.edu.sg/handle/10635/13236
Appears in Collections:Ph.D Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
Phd thesis_wang huiqiu.pdf508.44 kBAdobe PDF

OPEN

NoneView/Download

Page view(s)

434
checked on Dec 11, 2017

Download(s)

505
checked on Dec 11, 2017

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.