Simon Emde

Cooperative twin-crane scheduling

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaper › Journal article › Research › peer-review

Standard

Cooperative twin-crane scheduling. / Briskorn, Dirk; Emde, Simon; Boysen, Nils.

In: Discrete Applied Mathematics, Vol. 211, 01.10.2016, p. 40-57.

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaper › Journal article › Research › peer-review

Harvard

Briskorn, D, Emde, S & Boysen, N 2016, 'Cooperative twin-crane scheduling', Discrete Applied Mathematics, vol. 211, pp. 40-57. https://doi.org/10.1016/j.dam.2016.04.006

Author

Briskorn, Dirk ; Emde, Simon ; Boysen, Nils. / Cooperative twin-crane scheduling. In: Discrete Applied Mathematics. 2016 ; Vol. 211. pp. 40-57.

Bibtex

@article{950863e3adc04c2c85626391e67b3d10,

title = "Cooperative twin-crane scheduling",

abstract = "This paper treats the crane scheduling in a container port where two cooperative gantry cranes (denoted as twin cranes) jointly store import containers arriving from the seaside in a storage yard. We aim to minimize the makespan while non-crossing constraints among cranes need to be considered and preemptive container moves are allowed, i.e., the seaside crane sets down a container in some intermediate position where the landside crane takes over and delivers the container to its final storage position in the yard. Elementary complexity proofs are provided and efficient heuristic solution procedures are introduced and tested.",

keywords = "Container logistics, Crane scheduling, Port operations, Twin cranes",

author = "Dirk Briskorn and Simon Emde and Nils Boysen",

year = "2016",

month = oct,

day = "1",

doi = "10.1016/j.dam.2016.04.006",

language = "English",

volume = "211",

pages = "40--57",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier BV * North-Holland",

}

RIS

TY - JOUR

T1 - Cooperative twin-crane scheduling

AU - Briskorn, Dirk

AU - Emde, Simon

AU - Boysen, Nils

PY - 2016/10/1

Y1 - 2016/10/1

N2 - This paper treats the crane scheduling in a container port where two cooperative gantry cranes (denoted as twin cranes) jointly store import containers arriving from the seaside in a storage yard. We aim to minimize the makespan while non-crossing constraints among cranes need to be considered and preemptive container moves are allowed, i.e., the seaside crane sets down a container in some intermediate position where the landside crane takes over and delivers the container to its final storage position in the yard. Elementary complexity proofs are provided and efficient heuristic solution procedures are introduced and tested.

AB - This paper treats the crane scheduling in a container port where two cooperative gantry cranes (denoted as twin cranes) jointly store import containers arriving from the seaside in a storage yard. We aim to minimize the makespan while non-crossing constraints among cranes need to be considered and preemptive container moves are allowed, i.e., the seaside crane sets down a container in some intermediate position where the landside crane takes over and delivers the container to its final storage position in the yard. Elementary complexity proofs are provided and efficient heuristic solution procedures are introduced and tested.

KW - Container logistics

KW - Crane scheduling

KW - Port operations

KW - Twin cranes

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

U2 - 10.1016/j.dam.2016.04.006

DO - 10.1016/j.dam.2016.04.006

M3 - Journal article

AN - SCOPUS:84992312411

VL - 211

SP - 40

EP - 57

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

SN - 0166-218X

ER -

Department of Economics and Business Economics