Department of Economics and Business Economics

Simon Emde

Determining crane areas for balancing workload among interfering and noninterfering cranes

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

Standard

Determining crane areas for balancing workload among interfering and noninterfering cranes. / Boysen, Nils; Emde, Simon; Fliedner, Malte.

In: Naval Research Logistics, Vol. 59, No. 8, 01.01.2012, p. 656-662.

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

Harvard

Boysen, N, Emde, S & Fliedner, M 2012, 'Determining crane areas for balancing workload among interfering and noninterfering cranes', Naval Research Logistics, vol. 59, no. 8, pp. 656-662. https://doi.org/10.1002/nav.21512

APA

CBE

MLA

Vancouver

Author

Boysen, Nils ; Emde, Simon ; Fliedner, Malte. / Determining crane areas for balancing workload among interfering and noninterfering cranes. In: Naval Research Logistics. 2012 ; Vol. 59, No. 8. pp. 656-662.

Bibtex

@article{ccd4a7b84f5a4f21bb40a743990c443c,
title = "Determining crane areas for balancing workload among interfering and noninterfering cranes",
abstract = "This article treats the problem of subdividing an area for storing containers such that the workload is evenly shared among the cranes operating the resulting subareas. We consider two crane sets: while noncrossing constraints between cranes of the same set need to be observed, cranes of different sets do not interfere. Such a problem setting is, for instance, relevant for scheduling the (un-)loading of vessels by parallel quay cranes operating on opposing berths or in container yards with cross-over cranes. We formalize the resulting optimization problem, prove computational complexity, and present exact and heuristic solution procedures. {\textcopyright} 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012",
keywords = "container logistics, crane scheduling, dynamic programming, noncrossing constraints",
author = "Nils Boysen and Simon Emde and Malte Fliedner",
year = "2012",
month = jan,
day = "1",
doi = "10.1002/nav.21512",
language = "English",
volume = "59",
pages = "656--662",
journal = "Naval Research Logistics",
issn = "0894-069X",
publisher = "JohnWiley & Sons, Inc.",
number = "8",

}

RIS

TY - JOUR

T1 - Determining crane areas for balancing workload among interfering and noninterfering cranes

AU - Boysen, Nils

AU - Emde, Simon

AU - Fliedner, Malte

PY - 2012/1/1

Y1 - 2012/1/1

N2 - This article treats the problem of subdividing an area for storing containers such that the workload is evenly shared among the cranes operating the resulting subareas. We consider two crane sets: while noncrossing constraints between cranes of the same set need to be observed, cranes of different sets do not interfere. Such a problem setting is, for instance, relevant for scheduling the (un-)loading of vessels by parallel quay cranes operating on opposing berths or in container yards with cross-over cranes. We formalize the resulting optimization problem, prove computational complexity, and present exact and heuristic solution procedures. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012

AB - This article treats the problem of subdividing an area for storing containers such that the workload is evenly shared among the cranes operating the resulting subareas. We consider two crane sets: while noncrossing constraints between cranes of the same set need to be observed, cranes of different sets do not interfere. Such a problem setting is, for instance, relevant for scheduling the (un-)loading of vessels by parallel quay cranes operating on opposing berths or in container yards with cross-over cranes. We formalize the resulting optimization problem, prove computational complexity, and present exact and heuristic solution procedures. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012

KW - container logistics

KW - crane scheduling

KW - dynamic programming

KW - noncrossing constraints

UR - http://www.scopus.com/inward/record.url?scp=84869097099&partnerID=8YFLogxK

U2 - 10.1002/nav.21512

DO - 10.1002/nav.21512

M3 - Journal article

AN - SCOPUS:84869097099

VL - 59

SP - 656

EP - 662

JO - Naval Research Logistics

JF - Naval Research Logistics

SN - 0894-069X

IS - 8

ER -