K-collect tours for moving objects with release times and deadlines

WMSCI 2005 - The 9th World Multi-Conference on Systemics, Cybernetics and Informatics, Proceedings

Volumn 3, Issue , 2005, Pages 192-197

  Asahiro, Yuichi ^a   Miyano, Eiji ^b   Shimoirisa, Shinichi ^b  

^a KYUSHU SANGYO UNIVERSITY   (Japan)

^b KYUSHU INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

Collect tours; Deadlines; Moving objects; NP hardness; Release times

Indexed keywords

COLLECT TOURS; DEADLINES; MOVING OBJECTS; NP-HARDNESS; RELEASE TIME;

CYBERNETICS; INFORMATION SCIENCE;

ROBOTIC ARMS;

EID: 84867380300     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. P.K. Agarwal and M. Sharir. Davenport-Schinzel sequences and their geometric applications. In Handbook of Computational Geometry, J. Sack and J. Urutia, Eds., Elsevier Science Ltd, 1999.
2. Y. Asahiro, T. Horiyama, K. Makino, H. Ono, T. Sakuma, M. Yamashita. How to collect balls moving in the Euclidean plane. Electronic Notes in Theoretical Computer Science, 91, pp.229-245, 2004.
3. N. Bansal, A. Blum, S. Chawla, A. Meyerson. Approximation algorithms for deadline-TSP and vehicle routing with time-windows. In Proc. ACM Symposium on Theory of Computing, pp.166-174, 2004.
4. A. Bar-Noy, S. Guha, J. Naor, B. Schieber. Approximating the throughput of multiple machines under real-time scheduling. In Proc. ACM Symposium on Theory of Computing, pp.622-631, 1999.
5. A. Blum, S. Chawla, D. Karger, T. Lane, A. Meyerson, M. Minkoff. Approximation algorithms for orienteering and discounted-reward TSP. In Proc. IEEE Symposium on Foundations of Computer Science, pp.46-55, 2003.
6. P. Chalasani, R. Motwani, A. Rao. Approximation algorithms for robot grasp and delivery. In Proc. International Workshop on Algorithmic Foundations of Robotics, pp.347-362, 1996.
7. J. Chuzhoy, R. Ostrovsky, Y. Rabani. Approximation algorithms for the job interval selection problem and related scheduling problem. In Proc. IEEE Symposium on Foundations of Computer Science, pp.348-356, 2001
8. M. Cieliebak, T. Erlebach, F. Hennecke, B. Weber, P. Widmayer. Scheduling with release times and deadlines on a minimum number of machines. In IFIP WCC2004, pp.209-222, 2004.
9. J.-F. Cordeau, G. Desaulniers, J. Desrosiers, M.M. Solomon, F. Soumis. VRP with time windows. In The Vehicle Routing Problem, P. Tosh and D. Vigo Eds., SIAM, 2002.
10. M. Desrochers, J. Desrosiers, M.M. Solomon. A new optimization algorithm for the vehicle routing problem with time windows. Operations Research, 40, pp.342-354, 1992.
11. M.R. Garey and D.S. Johnson. Two-processor scheduling with start-times and deadlines. SIAM Journal on Computing, 6, pp.416-426, 1977.
12. M.R. Garey and D.S. Johnson. Computers and Intractability. W.H. Freeman and Company, NY, 1979.
13. M. Hammar and B.J. Nilsson. Approximation results for kinetic variants of TSP. In Proc. International Colloquium, Automata, Languages and Programming, pp.392-401, 1999.
14. C.S. Helvig, G. Robins, A. Zelikovsky. Moving target TSP and related problems. In Proc. European Symposium on Algorithms, pp.453-464, 1998.