Scheduling twin robots on a line |
| |
| Authors: | Güneş Erdoğan Maria Battarra Gilbert Laporte |
| |
| Affiliation: | 1. School of Management, University of Southampton, , Highfield, Southampton, SO17 1BJ United Kingdom;2. School of Mathematics, University of Southampton, , Highfield, Southampton, SO17 1BJ United Kingdom;3. Canada Research Chair in Distribution Management, HEC Montréal, 3000 chemin de la C?te‐Sainte‐Catherine, , Montreal, Canada, H3T 2A7 |
| |
| Abstract: | This article introduces the twin robots scheduling problem (TRSP), in which two robots positioned at the opposite ends of a rail are required to deliver items to positions along the rail, and the objective is to minimize the makespan. A proof of  ‐hardness of the TRSP is presented, along with exact and heuristic algorithms. Computational results on challenging instances are provided.Copyright © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 119–130, 2014 |
| |
| Keywords: | scheduling robots exact algorithms approximation algorithms Gantt chart |
|
|
