Department of Economics and Business Economics

Simon Emde

A decomposition heuristic for the twin robots scheduling problem

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

Standard

A decomposition heuristic for the twin robots scheduling problem. / Boysen, Nils; Briskorn, Dirk; Emde, Simon.

In: Naval Research Logistics, Vol. 62, No. 1, 01.02.2015, p. 16-22.

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

Harvard

Boysen, N, Briskorn, D & Emde, S 2015, 'A decomposition heuristic for the twin robots scheduling problem', Naval Research Logistics, vol. 62, no. 1, pp. 16-22. https://doi.org/10.1002/nav.21610

APA

Boysen, N., Briskorn, D., & Emde, S. (2015). A decomposition heuristic for the twin robots scheduling problem. Naval Research Logistics, 62(1), 16-22. https://doi.org/10.1002/nav.21610

CBE

MLA

Boysen, Nils, Dirk Briskorn, and Simon Emde. "A decomposition heuristic for the twin robots scheduling problem". Naval Research Logistics. 2015, 62(1). 16-22. https://doi.org/10.1002/nav.21610

Vancouver

Boysen N, Briskorn D, Emde S. A decomposition heuristic for the twin robots scheduling problem. Naval Research Logistics. 2015 Feb 1;62(1):16-22. https://doi.org/10.1002/nav.21610

Author

Boysen, Nils ; Briskorn, Dirk ; Emde, Simon. / A decomposition heuristic for the twin robots scheduling problem. In: Naval Research Logistics. 2015 ; Vol. 62, No. 1. pp. 16-22.

Bibtex

@article{edadb38eb85c4f8eacb24a8759e2775c,
title = "A decomposition heuristic for the twin robots scheduling problem",
abstract = "This article provides an efficient heuristic based on decomposition for the twin robots scheduling problem (TRSP). TRSP concerns two moving robots executing storage and retrieval requests in parallel along a shared pathway. The depots are located at both ends of the line and a dedicated robot is assigned to each of them. While moving goods between their respective depots and some storage locations on the line, noncrossing constraints among robots need to be considered. Our heuristic uses a dynamic programming framework to determine the schedule of one robot while keeping the other one's fixed. It finds near-optimal solutions even for large problem instances with hundreds of jobs in a short time span.",
keywords = "Dynamic programming, Noncrossing constraints, Twin robots scheduling",
author = "Nils Boysen and Dirk Briskorn and Simon Emde",
year = "2015",
month = feb,
day = "1",
doi = "10.1002/nav.21610",
language = "English",
volume = "62",
pages = "16--22",
journal = "Naval Research Logistics",
issn = "0894-069X",
publisher = "JohnWiley & Sons, Inc.",
number = "1",

}

RIS

TY - JOUR

T1 - A decomposition heuristic for the twin robots scheduling problem

AU - Boysen, Nils

AU - Briskorn, Dirk

AU - Emde, Simon

PY - 2015/2/1

Y1 - 2015/2/1

N2 - This article provides an efficient heuristic based on decomposition for the twin robots scheduling problem (TRSP). TRSP concerns two moving robots executing storage and retrieval requests in parallel along a shared pathway. The depots are located at both ends of the line and a dedicated robot is assigned to each of them. While moving goods between their respective depots and some storage locations on the line, noncrossing constraints among robots need to be considered. Our heuristic uses a dynamic programming framework to determine the schedule of one robot while keeping the other one's fixed. It finds near-optimal solutions even for large problem instances with hundreds of jobs in a short time span.

AB - This article provides an efficient heuristic based on decomposition for the twin robots scheduling problem (TRSP). TRSP concerns two moving robots executing storage and retrieval requests in parallel along a shared pathway. The depots are located at both ends of the line and a dedicated robot is assigned to each of them. While moving goods between their respective depots and some storage locations on the line, noncrossing constraints among robots need to be considered. Our heuristic uses a dynamic programming framework to determine the schedule of one robot while keeping the other one's fixed. It finds near-optimal solutions even for large problem instances with hundreds of jobs in a short time span.

KW - Dynamic programming

KW - Noncrossing constraints

KW - Twin robots scheduling

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

U2 - 10.1002/nav.21610

DO - 10.1002/nav.21610

M3 - Journal article

AN - SCOPUS:84921434772

VL - 62

SP - 16

EP - 22

JO - Naval Research Logistics

JF - Naval Research Logistics

SN - 0894-069X

IS - 1

ER -