A decomposition heuristic for the twin robots scheduling problem |
| |
| Authors: | Nils Boysen Dirk Briskorn Simon Emde |
| |
| Affiliation: | 1. Friedrich‐Schiller‐Universit?t Jena, Lehrstuhl für Operations Management, Jena, Germany;2. Bergische Universit?t Wuppertal, Professur für BWL, insbesondere Produktion und Logistik, Wuppertal, Germany |
| |
| 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. © 2014 Wiley Periodicals, Inc. 62:16–22, 2015 |
| |
| Keywords: | twin robots scheduling noncrossing constraints dynamic programming |
|
|
