Please use this identifier to cite or link to this item:
https://hdl.handle.net/10356/2457
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chen, Chuanyu | en |
dc.date.accessioned | 2008-09-17T09:03:28Z | en |
dc.date.available | 2008-09-17T09:03:28Z | en |
dc.date.copyright | 2005 | en |
dc.date.issued | 2005 | en |
dc.identifier.citation | Chen, C. (2005). Efficient system and algorithms for container storage. Master’s thesis, Nanyang Technological University, Singapore. | en |
dc.identifier.uri | https://hdl.handle.net/10356/2457 | en |
dc.description.abstract | Due to the ever-growing transport demand and the increasing rcgional competition, container port operators nowadays are facing great challenges to stay competitive and relevant to their customers. Effective and efficient management of container terminal operations has therefore becornc one of their main concerns and not surprisingly attracts tremendous research interests. The planning of operations at storage yard, where inbound and outbound container flows are handled simultaneously, determincs the port efficiency to a great extent. | en |
dc.rights | Nanyang Technological University | en |
dc.subject | DRNTU::Engineering::Computer science and engineering::Computer applications::Physical sciences and engineering | en |
dc.title | Efficient system and algorithms for container storage | en |
dc.type | Thesis | en |
dc.contributor.supervisor | Huang Shell Ying | en |
dc.contributor.school | School of Computer Engineering | en |
dc.description.degree | MASTER OF ENGINEERING (SCE) | en |
dc.identifier.doi | 10.32657/10356/2457 | en |
item.fulltext | With Fulltext | - |
item.grantfulltext | open | - |
Appears in Collections: | SCSE Theses |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
ChenChuanyu05.pdf | Main report | 7.59 MB | Adobe PDF | View/Open |
Page view(s) 50
554
Updated on Mar 28, 2024
Download(s) 10
365
Updated on Mar 28, 2024
Google ScholarTM
Check
Altmetric
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.