Berth and quay crane allocation: A moldable task scheduling model

J. Blazewicz, Edwin Tai Chiu Cheng, M. MacHowiak, C. Oguz

Research output: Journal article publicationJournal articleAcademic researchpeer-review

31 Citations (Scopus)

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.
Original languageEnglish
Pages (from-to)1189-1197
Number of pages9
JournalJournal of the Operational Research Society
Volume62
Issue number7
DOIs
Publication statusPublished - 1 Jul 2011

Keywords

  • berth allocation
  • moldable task
  • parallel computing
  • quay crane allocation
  • resource allocation

ASJC Scopus subject areas

  • Management Science and Operations Research
  • Management Information Systems
  • Marketing
  • Strategy and Management

Cite this