Department of Economics and Business Economics

Simon Emde

Optimally scheduling interfering and non-interfering cranes

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

Standard

Optimally scheduling interfering and non-interfering cranes. / Emde, Simon.

In: Naval Research Logistics, Vol. 64, No. 6, 01.09.2017, p. 476-489.

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

Harvard

Emde, S 2017, 'Optimally scheduling interfering and non-interfering cranes', Naval Research Logistics, vol. 64, no. 6, pp. 476-489. https://doi.org/10.1002/nav.21768

APA

CBE

MLA

Vancouver

Author

Emde, Simon. / Optimally scheduling interfering and non-interfering cranes. In: Naval Research Logistics. 2017 ; Vol. 64, No. 6. pp. 476-489.

Bibtex

@article{8d1829d2ec37485baaf944dd9cdfb1b9,
title = "Optimally scheduling interfering and non-interfering cranes",
abstract = "This article treats the problem of scheduling multiple cranes processing jobs along a line, where cranes are divided into different groups and only cranes in the same group can interfere with each other. Such crane scheduling problems occur, for example, at indented berths or in container yards where double rail-mounted gantry cranes stack containers such that cranes of the same size can interfere with each other but small cranes can pass underneath larger ones. We propose a novel algorithm based on Benders decomposition to solve this problem to optimality. In a computational study, it is shown that this algorithm solves small and medium-sized instances and even many large instances within a few seconds or minutes. Moreover, it improves several best known solutions from the literature with regard to the simpler problem version with only one crane group. We also look into whether investment in more complicated crane configurations with multiple crane groups is actually worthwhile.",
keywords = "benders decomposition, container logistics, crane scheduling, non-crossing constraints",
author = "Simon Emde",
year = "2017",
month = sep,
day = "1",
doi = "10.1002/nav.21768",
language = "English",
volume = "64",
pages = "476--489",
journal = "Naval Research Logistics",
issn = "0894-069X",
publisher = "JohnWiley & Sons, Inc.",
number = "6",

}

RIS

TY - JOUR

T1 - Optimally scheduling interfering and non-interfering cranes

AU - Emde, Simon

PY - 2017/9/1

Y1 - 2017/9/1

N2 - This article treats the problem of scheduling multiple cranes processing jobs along a line, where cranes are divided into different groups and only cranes in the same group can interfere with each other. Such crane scheduling problems occur, for example, at indented berths or in container yards where double rail-mounted gantry cranes stack containers such that cranes of the same size can interfere with each other but small cranes can pass underneath larger ones. We propose a novel algorithm based on Benders decomposition to solve this problem to optimality. In a computational study, it is shown that this algorithm solves small and medium-sized instances and even many large instances within a few seconds or minutes. Moreover, it improves several best known solutions from the literature with regard to the simpler problem version with only one crane group. We also look into whether investment in more complicated crane configurations with multiple crane groups is actually worthwhile.

AB - This article treats the problem of scheduling multiple cranes processing jobs along a line, where cranes are divided into different groups and only cranes in the same group can interfere with each other. Such crane scheduling problems occur, for example, at indented berths or in container yards where double rail-mounted gantry cranes stack containers such that cranes of the same size can interfere with each other but small cranes can pass underneath larger ones. We propose a novel algorithm based on Benders decomposition to solve this problem to optimality. In a computational study, it is shown that this algorithm solves small and medium-sized instances and even many large instances within a few seconds or minutes. Moreover, it improves several best known solutions from the literature with regard to the simpler problem version with only one crane group. We also look into whether investment in more complicated crane configurations with multiple crane groups is actually worthwhile.

KW - benders decomposition

KW - container logistics

KW - crane scheduling

KW - non-crossing constraints

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

U2 - 10.1002/nav.21768

DO - 10.1002/nav.21768

M3 - Journal article

AN - SCOPUS:85034230631

VL - 64

SP - 476

EP - 489

JO - Naval Research Logistics

JF - Naval Research Logistics

SN - 0894-069X

IS - 6

ER -