Department of Economics and Business Economics

Simon Emde

The parallel stack loading problem to minimize blockages

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

Standard

The parallel stack loading problem to minimize blockages. / Boysen, Nils; Emde, Simon.

In: European Journal of Operational Research, Vol. 249, No. 2, 01.03.2016, p. 618-627.

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

Harvard

Boysen, N & Emde, S 2016, 'The parallel stack loading problem to minimize blockages', European Journal of Operational Research, vol. 249, no. 2, pp. 618-627. https://doi.org/10.1016/j.ejor.2015.09.033

APA

Boysen, N., & Emde, S. (2016). The parallel stack loading problem to minimize blockages. European Journal of Operational Research, 249(2), 618-627. https://doi.org/10.1016/j.ejor.2015.09.033

CBE

Boysen N, Emde S. 2016. The parallel stack loading problem to minimize blockages. European Journal of Operational Research. 249(2):618-627. https://doi.org/10.1016/j.ejor.2015.09.033

MLA

Boysen, Nils and Simon Emde. "The parallel stack loading problem to minimize blockages". European Journal of Operational Research. 2016, 249(2). 618-627. https://doi.org/10.1016/j.ejor.2015.09.033

Vancouver

Boysen N, Emde S. The parallel stack loading problem to minimize blockages. European Journal of Operational Research. 2016 Mar 1;249(2):618-627. https://doi.org/10.1016/j.ejor.2015.09.033

Author

Boysen, Nils ; Emde, Simon. / The parallel stack loading problem to minimize blockages. In: European Journal of Operational Research. 2016 ; Vol. 249, No. 2. pp. 618-627.

Bibtex

@article{ae978f10a60347edbd71d6c1bc19aa99,
title = "The parallel stack loading problem to minimize blockages",
abstract = "This paper treats an elementary optimization problem, which arises whenever an inbound stream of items is to be intermediately stored in a given number of parallel stacks, so that blockages during their later retrieval are avoided. A blockage occurs whenever an item to be retrieved earlier is blocked by another item with lower priority stored on top of it in the same stack. Our stack loading problem arises, for instance, if containers arriving by vessel are intermediately stored in a container yard of a port or if, during nighttime, successively arriving wagons are to be parked in multiple parallel dead-end rail tracks of a tram depot. We formalize the resulting basic stack loading problem, investigate its computational complexity, and present suited exact and heuristic solution procedures.",
keywords = "Container storage, Dynamic programming, Stack loading, Stacking yard",
author = "Nils Boysen and Simon Emde",
year = "2016",
month = mar,
day = "1",
doi = "10.1016/j.ejor.2015.09.033",
language = "English",
volume = "249",
pages = "618--627",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier BV",
number = "2",

}

RIS

TY - JOUR

T1 - The parallel stack loading problem to minimize blockages

AU - Boysen, Nils

AU - Emde, Simon

PY - 2016/3/1

Y1 - 2016/3/1

N2 - This paper treats an elementary optimization problem, which arises whenever an inbound stream of items is to be intermediately stored in a given number of parallel stacks, so that blockages during their later retrieval are avoided. A blockage occurs whenever an item to be retrieved earlier is blocked by another item with lower priority stored on top of it in the same stack. Our stack loading problem arises, for instance, if containers arriving by vessel are intermediately stored in a container yard of a port or if, during nighttime, successively arriving wagons are to be parked in multiple parallel dead-end rail tracks of a tram depot. We formalize the resulting basic stack loading problem, investigate its computational complexity, and present suited exact and heuristic solution procedures.

AB - This paper treats an elementary optimization problem, which arises whenever an inbound stream of items is to be intermediately stored in a given number of parallel stacks, so that blockages during their later retrieval are avoided. A blockage occurs whenever an item to be retrieved earlier is blocked by another item with lower priority stored on top of it in the same stack. Our stack loading problem arises, for instance, if containers arriving by vessel are intermediately stored in a container yard of a port or if, during nighttime, successively arriving wagons are to be parked in multiple parallel dead-end rail tracks of a tram depot. We formalize the resulting basic stack loading problem, investigate its computational complexity, and present suited exact and heuristic solution procedures.

KW - Container storage

KW - Dynamic programming

KW - Stack loading

KW - Stacking yard

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

U2 - 10.1016/j.ejor.2015.09.033

DO - 10.1016/j.ejor.2015.09.033

M3 - Journal article

AN - SCOPUS:84952985033

VL - 249

SP - 618

EP - 627

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 2

ER -