Berth allocation with service priorities: a linear reformulation

Authors:
Maria Boile;Sotirios Theofanis;Mihalis Golias
Affiliations:
Department of Civil and Environmental Engineering, Rutgers, The State University of New Jersey, Piscataway, NJ;Department of Civil and Environmental Engineering, Rutgers, The State University of New Jersey, Piscataway, NJ;Department of Civil and Environmental Engineering, Rutgers, The State University of New Jersey, Piscataway, NJ
Venue:
ICOSSE'06 Proceedings of the 5th WSEAS international conference on System science and simulation in engineering
Year:
2006

Citing 4
Cited 0

A stochastic beam search for the berth allocation problem

Decision Support Systems
Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems
The berth planning problem11This research is part of a project the author has with the Port of Singapore Authority. The author was a senior technical consultant in that project. This research was supported in part by the NUS Research Front RP3972679.

Operations Research Letters
A multiprocessor task scheduling model for berth allocation: heuristic and worst-case analysis

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

The berth-allocation problem (BAP) aims to optimally schedule and assign ships to berthing areas along a quay. The vessels arrive at the port over a period of time and normally request and compete for early service start and departure. Berth allocation policies with service priority are important in terminal operations and are applicable in situations involving various vessel sizes, different handling volumes and different service strings. In this paper the discrete and dynamic BAP is formulated as a linear MIP problem with linear constraints, with the objective to minimize the weighted total service time. A heuristic is also presented for large instances of the problem.