期刊
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
卷 62, 期 7, 页码 1189-1197出版社
TAYLOR & FRANCIS LTD
DOI: 10.1057/jors.2010.54
关键词
berth allocation; quay crane allocation; moldable task; resource allocation; parallel computing
资金
- Research Grant Council of Hong Kong [PolyU 5193/01E]
- KBN
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. Journal of the Operational Research Society (2011) 62, 1189-1197. doi: 10.1057/jors.2010.54 Published online 16 June 2010
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据