Approximation Schemes for the Crane Scheduling Problem
Publication Type
Conference Proceeding Article
Publication Date
2004
Abstract
Maximizing crane efficiency of shipping loading and unloading plays an important role in order for the modern sea transportation system to increase its port throughput with respect to pressures derived from the limited port size, high cargo transhipment volumes and limited physical facilities and equipments. This can explain the concerns with the crane scheduling and management aroused from the Port of Singapore Authority (PSA) and other world busiest ports (like Hong Kong and Australia).
Keywords
Algorithm Analysis and Problem Complexity, Computer Communication Networks
Discipline
Operations and Supply Chain Management | Transportation
Research Areas
Operations Management
Publication
Algorithm Theory - SWAT 2004: 9th Scandinavian Workshop on Algorithm Theory, Humlebæk, Denmark, July 8-10, 2004. Proceedings
Volume
3111
First Page
323
Last Page
335
ISSN
0302-9743
ISBN
9783540278108
Identifier
10.1007/978-3-540-27810-8_28
Publisher
Springer
City or Country
Humlebæk, Denmark
Citation
LIM, Andrew; RODRIGUES, Brian; and XU, Zou.
Approximation Schemes for the Crane Scheduling Problem. (2004). Algorithm Theory - SWAT 2004: 9th Scandinavian Workshop on Algorithm Theory, Humlebæk, Denmark, July 8-10, 2004. Proceedings. 3111, 323-335.
Available at: https://ink.library.smu.edu.sg/lkcsb_research/2384