Premium
Scheduling twin robots on a line
Author(s) -
Erdoğan Güneş,
Battarra Maria,
Laporte Gilbert
Publication year - 2014
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/nav.21570
Subject(s) - robot , job shop scheduling , computer science , scheduling (production processes) , heuristic , mathematical optimization , operations research , distributed computing , artificial intelligence , mathematics , computer network , routing (electronic design automation)
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