Scheduling twin robots on a line

Güneş Erdoğan, Maria Battarra and Gilbert Laporte

Naval Research Logistics (NRL), 2014, vol. 61, issue 2, 119-130

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

Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
https://doi.org/10.1002/nav.21570

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navres:v:61:y:2014:i:2:p:119-130

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().