Räbiger, Dirk and Schrader, Rainer (2009). Semi-preemptive routing on a linear and circular track. Discrete Optimization, 6 (3). pp. 223-230. Elsevier.

[img]
Preview
 PDF
zaik2007-530.pdf - Draft Version
Download (144kB) | Preview

Abstract

The problem of routing a robot (or vehicle) between n stations in the plane in order to transport objects is well studied, even if the stations are specially arranged, e.g. on a linear track or circle. The robot may use either all or none of the stations for reloading. We will generalize these concepts of preemptiveness/nonpreemptiveness and emancipate the robot by letting it choose k le n reload-stations. We will show that the problem on the linear and circular track remains polynomial solvable.

Item Type: Journal Article
Creators:
CreatorsEmailORCIDORCID Put Code
Räbiger, DirkUNSPECIFIEDUNSPECIFIEDUNSPECIFIED
Schrader, RainerUNSPECIFIEDUNSPECIFIEDUNSPECIFIED
URN: urn:nbn:de:hbz:38-549044
Journal or Publication Title: Discrete Optimization
Volume: 6
Number: 3
Page Range: pp. 223-230
Date: 2009
Publisher: Elsevier
Language: English
Faculty: Faculty of Mathematics and Natural Sciences
Divisions: Faculty of Mathematics and Natural Sciences > Department of Mathematics and Computer Science > Institute of Computer Science
Subjects: Data processing Computer science
Refereed: No
URI: http://kups.ub.uni-koeln.de/id/eprint/54904

Downloads

Downloads per month over past year

Export

Actions (login required)

View Item View Item