Vehicle scheduling on a tree to minimize maximum lateness

Journal of the Operations Research Society of Japan

Volumn 39, Issue 3, 1996, Pages 345-355

  Karuno, Yoshiyuki ^a   Nagamochi, Hiroshi ^b   Ibaraki, Toshihide ^b  

^a KYOTO INSTITUTE OF TECHNOLOGY   (Japan)

^b KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0041953560     PISSN: 04534514     EISSN: None     Source Type: Journal    
DOI: 10.15807/jorsj.39.345     Document Type: Article

References (15)

1. Atallah, M. and S. Kosaraju, Efficient Solutions to Some Transportation Problems with Application to Minimizing Robot Arm Travel, SIAM J. Comput., 17(1988), 849-869.
2. Averbakh, I. and O. Berman, Sales-Delivery Man Problems on Treelike Networks, Networks, 25(1995), 45-58.
3. Cheng, J. L., H. Kise and H. Matsumoto, A Branch-and-Bound Algorithm with Fuzzy Inference for the 3-Machine Flowshop Scheduling Problem, Proceedings of 1994 JapanU.S.A. Symposium on Flexible Automation, ISCIE, (1994), 791-797.
4. Frederickson, G., A Note on the Complexity of a Simple Transportation Problem, SIAM J. Comput., 22-1(1993), 57-61.
5. Frederickson, G. and D. Guan, Preemptive Ensemble Motion Planning on a Tree, SIAM J. Comput., 21-6(1992), 1130-1152.
6. Frederickson, G., M. Hecht and C. Kim, Approximation Algorithms for Some Routing Problems, SIAM J. Comput., 7-2(1978), 178-193.
7. Garey, M. and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, San Francisco, (1979).
8. Karuno, Y., H. Nagamochi and T. Ibaraki, Vehicle Scheduling on a Tree with Release and Handling Times, Lecture Notes in Computer Science 762, Springer-Verlag, (1993), 486-495.
9. Kise, H., T. Ibaraki and H. Mine, Performance Analysis of Six Approximation Algorithms for the One-Machine Maximum Lateness Scheduling Problem with Ready Times, Journal of the Operations Research Society of Japan, 22-3(1979), 205-224.
10. Minieka, E., The Delivery Man Problem on a Tree Network, Annals of Operations Research, 18(1989), 261-266.
11. Nagamochi, H., K. Mochizuki and T. Ibaraki, Complexity of Single Vehicle Scheduling Problem on Graphs, Technical Report of IEICE, COMP94-19(1994), 11-20.
12. Psaraftis, H., M. Solomon, T. Magnanti and T. Kim, Routing and Scheduling on a Shoreline with Release Times, Management Science, 36-2(1990), 212-223.
13. Solomon, M., Algorithms for the Vehicle Routing and Scheduling Problem with Time Window Constraints, Operations Research, 35-2(1987), 254-265.
14. Solomon, M. and J. Desrosiers, Time Window Constrained Routing and Scheduling Problems: A Survey, Transportation Sci., 22(1988), 1-13.
15. Tsitsiklis, J. N., Special Cases of Traveling Salesman and Repairman Problems with Time Windows, Networks, 22(1992), 263-282.