Scheduling twin robots on a line. (3rd February 2014)

• Record Type: Journal Article
• Authors: Erdoğan, Güneş; Battarra, Maria; Laporte, Gilbert
• Is Part Of: Naval research logistics. Volume 61:Number 2(2014:Mar.)
• Page Start: 119
• Page End: 130
• Publication Date: 2014-02-03
• Subjects: Logistics, Naval -- Periodicals; Supplies and stores -- Periodicals; 359.07
• DOI: 10.1002/nav.21570
• Languages: English
• ISSNs: 0894-069X

Abstract

<abstract abstract-type="main"> <title>Abstract</title> <p>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 <alternatives><inline-graphic mimetype="image" xlink:href="ark:/27927/pgg4sw14p4s" xlink:type="simple" xmlns:xlink="http://www.w3.org/1999/xlink" /><mml:math display="inline" altimg="urn:x-wiley::media:nav21570:nav21570-math-0001" overflow="scroll" xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mo> </mml:mo></mml:math></alternatives>‐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</p> </abstract>