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

Information Processing Letters

Volumn 86, Issue 2, 2003, Pages 87-91

  Gaur, Daya Ram ^a   Gupta, Arvind ^b   Krishnamurti, Ramesh ^b  

^a UNIVERSITY OF LETHBRIDGE   (Canada)

^b SIMON FRASER UNIVERSITY   (Canada)

Author keywords

Approximation algorithms; Design of algorithms

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; FLEXIBLE MANUFACTURING SYSTEMS; SCHEDULING;

AUTOMATIC GUIDED VEHICLES (AGV); VEHICLE ROUTING;

VEHICLES;

EID: 0037473391     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(02)00474-X     Document Type: Article

References (8)

1. Karuno Y., Nagamochi H., Ibaraki T. A 1.5-approximation for single vehicle scheduling problem on a line with release and handling times. Proc. ISCIE/ASME 1998 Japan-USA Symposium on Flexible Automation. 3:1998;1363-1368.
2. Karuno Y., Nagamochi H., Ibaraki T. Vehicle scheduling on a tree with release and handling time. Ann. Oper. Res. 69:1997;193-207.
3. Karuno Y., Nagamochi H. A 2-approximation algorithm for multi-vehicle scheduling problem on a path with release and handling times. Proc. 9th Annual European Symposium on Algorithms (ESA). 2001;218-229.
4. Karuno Y., Nagamochi H. A polynomial time approximation scheme for the multi-vehicle scheduling problem on a path with release and handling times. Proc. International Symposium on Algorithms and Computation (ISAAC). 2001;36-47.
5. Psaraftis H., Solomon M., Magnanti T., Kim T.-U. Routing and scheduling on a shoreline with release times. Management Sci. 36:1990;212-223.
6. Talavage J., Hannam R.G. Flexible Manufacturing Systems in Practice. 1988;Marcel Dekker, New York.
7. Tsitsiklis J.N. Special cases of traveling salesman and repairman problems with time windows. Networks. 22:1992;263-282.
8. Savik T. Production Planning and Scheduling in Flexible Assembly Systems. 1999;Springer, Berlin.