메뉴 건너뛰기




Volumn 69, Issue , 1997, Pages 193-207

Vehicle scheduling on a tree with release and handling times

Author keywords

Approximate algorithm; NP hard; Tree shaped network; Vehicle scheduling; Worst case analysis

Indexed keywords


EID: 0031539101     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/a:1018928911513     Document Type: Article
Times cited : (29)

References (14)
  • 1
    • 0024089661 scopus 로고
    • Efficient solutions to some transportation problems with application to minimizing robot arm travel
    • M. Atallah and S. Kosaraju, Efficient solutions to some transportation problems with application to minimizing robot arm travel, SIAM J. Comput. 17(1988)849-869.
    • (1988) SIAM J. Comput. , vol.17 , pp. 849-869
    • Atallah, M.1    Kosaraju, S.2
  • 2
    • 84995552639 scopus 로고
    • Sales-delivery man problems on tree-like networks
    • I. Averbakh and O. Berman, Sales-delivery man problems on tree-like networks, Networks 25 (1995)45-58.
    • (1995) Networks , vol.25 , pp. 45-58
    • Averbakh, I.1    Berman, O.2
  • 3
    • 0020809840 scopus 로고
    • An exact algorithm for the time-constrained traveling salesman problem
    • E. Baker, An exact algorithm for the time-constrained traveling salesman problem, Operations Research 31(1983)938-945.
    • (1983) Operations Research , vol.31 , pp. 938-945
    • Baker, E.1
  • 4
    • 0001887255 scopus 로고
    • Vehicle routing
    • E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys, eds., Wiley
    • N. Christofides, Vehicle routing, in: The Traveling Salesman Problem, E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys, eds., Wiley, 1985, pp. 431-448.
    • (1985) The Traveling Salesman Problem , pp. 431-448
    • Christofides, N.1
  • 5
    • 0027541718 scopus 로고
    • A note on the complexity of a simple transportation problem
    • G. Frederickson, A note on the complexity of a simple transportation problem, SIAM J. Comput. 22(1993)57-61.
    • (1993) SIAM J. Comput. , vol.22 , pp. 57-61
    • Frederickson, G.1
  • 6
    • 0000149127 scopus 로고
    • Preemptive ensemble motion planning on a tree
    • G. Frederickson and D. Guan, Preemptive ensemble motion planning on a tree, SIAM J. Comput. 21(1992)1130-1152.
    • (1992) SIAM J. Comput. , vol.21 , pp. 1130-1152
    • Frederickson, G.1    Guan, D.2
  • 7
    • 0001548320 scopus 로고
    • Approximation algorithms for some routing problems
    • G. Frederickson, M. Hecht and C. Kim, Approximation algorithms for some routing problems, SIAM J. Comput. 7(1978)178-193.
    • (1978) SIAM J. Comput. , vol.7 , pp. 178-193
    • Frederickson, G.1    Hecht, M.2    Kim, C.3
  • 9
    • 84958053670 scopus 로고
    • Vehicle scheduling on a tree with release and handling times
    • Springer
    • Y. Karuno, H. Nagamochi and T. Ibaraki, Vehicle scheduling on a tree with release and handling times, Lecture Notes in Computer Science 762, Springer, 1993, pp. 486-495.
    • (1993) Lecture Notes in Computer Science , vol.762 , pp. 486-495
    • Karuno, Y.1    Nagamochi, H.2    Ibaraki, T.3
  • 10
    • 0038521972 scopus 로고
    • The dalivery man problem on a tree network
    • E. Minieka, The dalivery man problem on a tree network, Annals of Operations Research 18(1989) 261-266.
    • (1989) Annals of Operations Research , vol.18 , pp. 261-266
    • Minieka, E.1
  • 11
  • 12
    • 0023313252 scopus 로고
    • Algorithms for the vehicle routing and scheduling problem with time window constraints
    • M. Solomon, Algorithms for the vehicle routing and scheduling problem with time window constraints, Operations Research 35(1987)254-265.
    • (1987) Operations Research , vol.35 , pp. 254-265
    • Solomon, M.1
  • 13
    • 0023964259 scopus 로고
    • Time window constrained routing and scheduling problems: A survey
    • M. Solomon and J. Desrosiers, Time window constrained routing and scheduling problems: A survey, Transportation Sci. 22(1988)1-13.
    • (1988) Transportation Sci. , vol.22 , pp. 1-13
    • Solomon, M.1    Desrosiers, J.2
  • 14
    • 0000448420 scopus 로고
    • Special cases of traveling salesman and repairman problems with time windows
    • J.N. Tsitsiklis, Special cases of traveling salesman and repairman problems with time windows, Networks 22(1992)263-282.
    • (1992) Networks , vol.22 , pp. 263-282
    • Tsitsiklis, J.N.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.