A 5/3-approximation algorithm for scheduling vehicles on a path with release and handling times

Authors:
Daya Ram Gaur;Arvind Gupta;Ramesh Krishnamurti
Affiliations:
Department of Math & Computer Science, University of Lethbridge, Lethbridge, AB, Canada, T1K 3M4;School of Computing Science, Simon Fraser University, Burnaby, BC, Canada, V5A 1S6;School of Computing Science, Simon Fraser University, Burnaby, BC, Canada, V5A 1S6
Venue:
Information Processing Letters
Year:
2003

Citing 1
Cited 4

Routing and scheduling on a shoreline with release times

Management Science

An approximability result of the multi-vehicle scheduling problem on a path with release and handling times

Theoretical Computer Science
Improved approximation algorithms for routing shop scheduling

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle

Theoretical Computer Science
Vehicle routing problems on a line-shaped network with release time constraints

Operations Research Letters

Quantified Score

Hi-index	0.89

Visualization

Abstract

In this paper we study a particular type of vehicle routing problem that arises in the context of scheduling an automatic guided vehicle (AGV) in the Flexible Manufacturing paradigm. Here we consider the problem of scheduling the vehicle when the sites are located on a path and the depot is at some arbitrary location. The objective is to determine the schedule with minimum completion time such that each site is visited only after its release time and handling times are taken into consideration. We provide a 5/3-approximation algorithm for the same. This improves the previous approximation ratio of 2 due to Karuno, Nagamochi and Ibaraki [Ann. Oper. Res. 69 (1997) 193-207].