Date of Award
2013
Document Type
Thesis
Publication Status
Version of Record
Submission Date
October 2026
Abstract
Ports and container terminals have very complex and dynamic operations. Effective and efficient berth schedules are essential for profitable and sustainable operations. This research studies berth scheduling under uncertainties in arrival and handling times. Port operators usually face challenges in the development of berth schedules. This thesis presents a model formulation of discrete berth space that accounts for uncertainty in arrival and handling times. The problem is reformulated as a biobjective bi-level optimization berth scheduling problem. A solution approach is presented using evolutionary algorithms and heuristics. The objective of the formulation is to provide a robust berth schedule by minimizing the average and the range of the total service times for all vessels served at the terminal. Simulation is utilized to evaluate the proposed berth scheduling policy and compare it to two first-come-first-served policies. Results showed that the proposed berth schedules outperform under high congestion.
Extent
xiv, 91 p. : ill. (some col.)
Recommended Citation
Portal, Palomo Maria I, "Berth scheduling in container terminals" (2013). Electronic Theses and Dissertations 2010 - 2019. 702.
https://digitalcommons.fau.edu/etd_general_6/702
Identifier
FADT3360960
Comments
by Maria Isabel Portal Palomo.|Vita.|Thesis (M.S.C.S.)--Florida Atlantic University, 2013.|Includes bibliography.|Mode of access: World Wide Web.|System requirements: Adobe Reader.|by Maria Isabel Portal Palomo.