| Article ID: | iaor201524012 |
| Volume: | 61 |
| Issue: | 2 |
| Start Page Number: | 119 |
| End Page Number: | 130 |
| Publication Date: | Mar 2014 |
| Journal: | Naval Research Logistics (NRL) |
| Authors: | Laporte Gilbert, Erdoan Gnes, Battarra Maria |
| Keywords: | production |
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.Copyrigh.