F. Afrati, S. Cosmadakis, C. H. Papadimitriou, G. Papageorgiou, and N. Papakostantinou, The complexity of the travelling repairman problem, RAIRO - Theoretical Informatics and Applications, vol.20, issue.1, pp.79-87, 1986.
DOI : 10.1051/ita/1986200100791

N. Ascheuer, S. O. Krumke, and J. Rambau, Online Dial-a-Ride Problems: Minimizing the Completion Time, Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science (STACS), pp.639-650, 2000.
DOI : 10.1007/3-540-46541-3_53
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.9796

J. Mikhail, S. Atallah, and . Kosaraju, Efficient solutions to some transportation problems with applications to minimizing robot arm travel, SIAM Journal on Computing, vol.17, issue.5, pp.849-869, 1988.

G. Ausiello, E. Feuerstein, S. Leonardi, L. Stougie, and M. Talamo, Serving requests with on-line routing, Proceedings of the 4th Scandinavian Workshop on Algorithm Theory Aarhus on Algorithm Theory (SWAT), pp.37-48, 1994.
DOI : 10.1007/3-540-58218-5_4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.52.1675

G. Ausiello, E. Feuerstein, S. Leonardi, L. Stougie, and M. Talamo, Competitive algorithms for the on-line traveling salesman, Proceedings of the 4th International Workshop on Algorithms and Data Structures (WADS), pp.206-217, 1995.
DOI : 10.1007/3-540-60220-8_63

G. Ausiello, E. Feuerstein, S. Leonardi, L. Stougie, and M. Talamo, Algorithms for the On-Line Travelling Salesman1, Algorithmica, vol.29, issue.4, pp.560-581, 2001.
DOI : 10.1007/s004530010071

M. Blom, S. O. Krumke, W. De-paepe, and L. Stougie, The Online TSP Against Fair Adversaries, INFORMS Journal on Computing, vol.13, issue.2, pp.138-148, 2001.
DOI : 10.1287/ijoc.13.2.138.10517
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.40.4445

M. Charikar and B. Raghavachari, The finite capacity dial-a-ride problem, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280), pp.458-467, 1998.
DOI : 10.1109/SFCS.1998.743496
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.22.1139

E. Willem, J. K. De-paepe, J. Lenstra, R. A. Sgall, L. Sitters et al., Computer-aided complexity classification of Dial-a-Ride problems, INFORMS Journal on Computing, vol.16, issue.2, pp.120-132, 2004.

E. Feuerstein and L. Stougie, On-line single-server dial-a-ride problems, Theoretical Computer Science, vol.268, issue.1, pp.91-105, 2001.
DOI : 10.1016/S0304-3975(00)00261-9
URL : http://doi.org/10.1016/s0304-3975(00)00261-9

N. Greg, D. Frederickson, and . Guan, Nonpreemptive ensemble motion planning on a tree, Journal of Algorithms, vol.15, issue.1, pp.29-60, 1993.

C. Paul, R. E. Gilmore, and . Gomory, Sequencing a one state-variable machine: A solvable case of the traveling salesman problem, Operations Research, vol.12, issue.5, pp.655-679, 1964.

. Dih-jiun-guan, Routing a vehicle of capacity greater than one, Discrete Applied Mathematics, vol.81, issue.1-3, pp.41-57, 1998.
DOI : 10.1016/S0166-218X(97)00074-7

P. Jaillet and M. R. Wagner, Generalized Online Routing: New Competitive Ratios, Resource Augmentation, and Asymptotic Analyses, Operations Research, vol.56, issue.3, pp.745-757, 2008.
DOI : 10.1287/opre.1070.0450
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.117.4660

S. O. Krumke, Online optimization competitive analysis and beyond, 2001.

S. O. Krumke, W. E. De-paepe, D. Poensgen, and L. Stougie, News from the online traveling repairman, Theoretical Computer Science, vol.295, issue.1-3, pp.279-294, 2003.
DOI : 10.1016/S0304-3975(02)00409-7
URL : http://doi.org/10.1016/s0304-3975(02)00409-7

S. O. Krumke, L. Laura, M. Lipmann, A. Marchetti-spaccamela, W. De-paepe et al., Non-abusiveness helps: An O(1)-competitive algorithm for minimizing the maximum flow time in the online traveling salesman problem, Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX), pp.200-214, 2002.

E. L. Lawler, J. K. Lenstra, A. H. Kan, and D. B. Shmoys, The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization., The Journal of the Operational Research Society, vol.37, issue.5, 1985.
DOI : 10.2307/2582681

M. Lipmann, On-Line Rounting, 2003.

S. Mark, L. A. Manasse, D. D. Mcgeoch, and . Sleator, Competitive algorithms for server problems, Journal of Algorithms, vol.11, issue.2, pp.208-230, 1990.

N. Harilaos, M. M. Psaraftis, T. L. Solomon, T. Magnanti, and . Kim, Routing and scheduling on a shoreline with release times, Management Science, vol.36, issue.2, pp.212-223, 1990.

N. John and . Tsitsiklis, Special cases of traveling salesman and repairman problems with time windows, Networks, vol.22, issue.3, pp.263-282, 1992.