Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/19773
Title: Berth and quay crane allocation: A moldable task scheduling model
Authors: Blazewicz, J
Cheng, TCE 
Machowiak, M
Oguz, C
Keywords: Berth allocation
Moldable task
Parallel computing
Quay crane allocation
Resource allocation
Issue Date: 2011
Publisher: Palgrave Macmillan
Source: Journal of the Operational Research Society, 2011, v. 62, no. 7, p. 1189-1197 How to cite?
Journal: Journal of the Operational Research Society 
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.
URI: http://hdl.handle.net/10397/19773
ISSN: 0160-5682
EISSN: 1476-9360
DOI: 10.1057/jors.2010.54
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

16
Last Week
0
Last month
2
Citations as of Sep 11, 2017

WEB OF SCIENCETM
Citations

13
Last Week
0
Last month
0
Citations as of Sep 21, 2017

Page view(s)

50
Last Week
0
Last month
Checked on Sep 17, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.