A Polynomial Time Approximation Scheme for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2223 LNCS, Issue , 2001, Pages 36-48

  Karuno, Yoshiyuki ^a   Nagamochi, Hiroshi ^b  

^a KYOTO INSTITUTE OF TECHNOLOGY   (Japan)

^b TOYOHASHI UNIVERSITY OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLETION TIME; HANDLING TIME; MULTI-VEHICLES; NP-HARD; OPTIMAL SCHEDULE; POLYNOMIAL TIME APPROXIMATION SCHEMES; RELEASE TIME; SCHEDULING PROBLEM; TRAVEL TIME;

APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY; POLYNOMIAL APPROXIMATION; VEHICLES; ALGORITHMS; APPROXIMATION THEORY; JOB SHOP SCHEDULING; POLYNOMIALS; SCHEDULING; TRAVEL TIME; TREES (MATHEMATICS);

SET THEORY; POLYNOMIAL APPROXIMATION;

EID: 70350655195     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45678-3_4     Document Type: Conference Paper

References (13)

1. Averbakh, I. and Berman, O.: Sales-delivery man problems on treelike networks, Networks 25 (1995) 45-58. 36, 37
2. Garey, M. R. and Johnson, D. S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, San Francisco (1979). 37
3. Hall, L. A.: A polynomial approximation scheme for a constrained flow-shop scheduling problem, Mathematics of Operations Research 19 (1994) 68-85. 37, 40
4. Hall, L. A. and Shmoys, D. B.: Approximation schemes for constrained scheduling problems, Proceedings of IEEE 30th Annual Symposium on Foundations of Computer Science (1989) 134-139. 37
5. Karuno, Y., Nagamochi, H. and Ibaraki, T.: Vehicle scheduling on a tree to minimize maximum lateness, Journal of the Operations Research Society of Japan 39 (1996) 345-355. 37
6. Karuno, Y., Nagamochi, H. and Ibaraki, T.: Vehicle scheduling on a tree with release and handling times, Annals of Operations Research 69 (1997) 193-207. 37
7. Karuno, Y., Nagamochi, H. and Ibaraki, T.: A 1.5-approximation for single-vehicle scheduling problem on a line with release and handling times, Proceedings of ISCIE/ASME 1998 Japan-U. S. A. Symposium on Flexible Automation 3 (1998) 1363-1366. 37
8. Karuno, Y. and Nagamochi, H.: A 2-approximation algorithm for the multi-vehicle scheduling problem on a path with release and handling times, Proceedings of 9th Annual European Symposium on Algorithms, ESA2001 (Aarhus, Denmark, August 28-31, 2001), Lecture Notes in Computer Science, Springer-Verlag (2001) in press. 37
9. max, Operations Research Letters 20 (1997) 75-79. 37, 40
10. Nagamochi, H., Mochizuki, K. and Ibaraki, T.: Complexity of the single vehicle scheduling problem on graphs, Information Systems and Operations Research 35 (1997) 256-276. 37
11. Nagamochi, H., Mochizuki, K. and Ibaraki, T.: Solving the single-vehicle scheduling problems for all home locations under depth-first routing on a tree, IEICE Transactions: Fundamentals E84-A (2001) 1135-1143. 37
12. Psaraftis, H., Solomon, M., Magnanti, T. and Kim, T.: Routing and scheduling on a shoreline with release times, Management Science 36 (1990) 212-223. 37
13. Tsitsiklis, J. N.: Special cases of traveling salesman and repairman problems with time windows, Networks 22 (1992) 263-282. 37