Publication:
Berth and quay crane allocation: a moldable task scheduling model

Placeholder

School / College / Institute

Program

KU-Authors

KU Authors

Co-Authors

Blazewicz, Jacek
Cheng, T. C. E.
Machowiak, Maciej

Publication Date

Language

Embargo Status

Journal Title

Journal ISSN

Volume Title

Alternative Title

Abstract

We study the problem of allocating berths to incoming ships and assigning the necessary quay cranes to the ships at a port container terminal. We formulate the problem as the moldable task scheduling problem by considering the tasks as ships and processors as quay cranes assigned to the ships based on the observation that the berthing duration of a ship depends on the number of quay cranes allocated to it. In the model, the processing speed of a task is considered to be a non-linear function of the number of processors allocated to it. We present a suboptimal algorithm that obtains a feasible solution to the discrete version of the problem from the continuous version, that is, where the tasks may require fractional quantities of the resources. We conducted computational experiments to evaluate the performance of the algorithm. The computational results show that the average behaviour of the algorithm is very good.

Source

Publisher

Taylor & Francis

Subject

Management, Operations research, Management science

Citation

Has Part

Source

Journal of the Operational Research Society

Book Series Title

Edition

DOI

10.1057/jors.2010.54

item.page.datauri

Link

Rights

Copyrights Note

Endorsement

Review

Supplemented By

Referenced By

0

Views

0

Downloads

View PlumX Details