Department of Economics and Business Economics

A decomposition heuristic for the twin robots scheduling problem

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


  • Nils Boysen, Friedrich Schiller University Jena
  • ,
  • Dirk Briskorn, University of Wuppertal
  • ,
  • Simon Emde

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.

Original languageEnglish
JournalNaval Research Logistics
Pages (from-to)16-22
Number of pages7
Publication statusPublished - 1 Feb 2015
Externally publishedYes

    Research areas

  • Dynamic programming, Noncrossing constraints, Twin robots scheduling

See relations at Aarhus University Citationformats

ID: 167801127