Title:
Berth and quay crane scheduling: problems, models and solution methods

Simple item page
dc.contributor.advisor Erera, Alan L.
dc.contributor.author Ak, Aykagan en_US
dc.contributor.committeeMember Ergun, Özlem
dc.contributor.committeeMember Savelsbergh, Martin W. P.
dc.contributor.committeeMember Tetali, Prasad
dc.contributor.committeeMember White, Chelsea C., III
dc.contributor.department Industrial and Systems Engineering en_US
dc.date.accessioned 2009-01-22T15:54:03Z
dc.date.available 2009-01-22T15:54:03Z
dc.date.issued 2008-11-17 en_US
dc.description.abstract A comprehensive study on berth and quay crane scheduling problems at container terminals at seaports is provided. Problems related to both multi-user terminals, where the terminal operator and liner carriers are different parties, and dedicated terminals, where liner carriers lease the terminal, are considered. A lower bound and an effective meta-heuristic algorithm are proposed for a dynamic variant of the Berth Allocation Problem (BAP). The Multiple Berth Allocation Problem (MBAP) is also introduced. Different crane scheduling methods used by terminal operators are analyzed and a tabu search algorithm is designed for a new variant of the Quay Crane Scheduling Problem (QCSP). The Simultaneous Berth and Quay Crane Scheduling Problem (BQCSP) is introduced with a lower bound analysis and an efficient solution method. A computational analysis is performed which exposes the substantial benefit of simultaneous planning over the hierarchical approach currently used by terminal operators. The tactical level Voyage and Berth Scheduling Problem (VBSP) is defined and a mathematical model based on multi-commodity network flow is presented. Constraints related to transshipments, terminal time windows and service level requirements are incorporated into the model, and how to modify instance data to increase schedule reliability is discussed. en_US
dc.description.degree Ph.D. en_US
dc.identifier.uri http://hdl.handle.net/1853/26652
dc.publisher Georgia Institute of Technology en_US
dc.subject Simultaneous berth and crane scheduling en_US
dc.subject Berth allocation en_US
dc.subject Multiple berth allocation en_US
dc.subject Crane schedling en_US
dc.subject Voyage scheduling en_US
dc.subject Quay crane assignment en_US
dc.subject.lcsh Cranes, derricks, etc.
dc.subject.lcsh Scheduling
dc.subject.lcsh Mathematical optimization
dc.title Berth and quay crane scheduling: problems, models and solution methods en_US
dc.type Text
dc.type.genre Dissertation
dspace.entity.type Publication
local.contributor.advisor Erera, Alan L.
local.contributor.corporatename H. Milton Stewart School of Industrial and Systems Engineering
local.contributor.corporatename College of Engineering
relation.isAdvisorOfPublication 9c57adb1-12eb-40c7-bc1a-b77b6871cc03
relation.isOrgUnitOfPublication 29ad75f0-242d-49a7-9b3d-0ac88893323c
relation.isOrgUnitOfPublication 7c022d60-21d5-497c-b552-95e489a06569
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
ak_aykagan_200812_phd.pdf
Size:
1.39 MB
Format:
Adobe Portable Document Format
Description:
Download
Collections
Theses and Dissertations