On-line single-server dial-a-ride problems

Theoretical Computer Science

Volumn 268, Issue 1, 2001, Pages 91-105

  Feuerstein, Esteban ^a   Stougie, Leen ^b,c  

^a INSTITUTO DE CIENCIAS   (Argentina)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^c CWI   (Netherlands)

Author keywords

Competitive analysis; Dial a ride; On line optimization

Indexed keywords

ALGORITHMS; ONLINE SYSTEMS; OPTIMIZATION; SCHEDULING;

COMPETITIVE ANALYSIS;

SERVERS;

EID: 0035818340     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00261-9     Document Type: Conference Paper

References (21)

1. Efficient solutions to some transportation problems with application to minimizing robot arm travel
2. Algorithms for the on-line traveling salesman
3. Searching in the plane
4. The minimum latency problem
5. Routing and scheduling of vehicles and crews: The state of the art
6. The finite capacity dial-a-ride problem
7. On-line multi-threaded dial a ride problems
8. Preemptive ensemble motion planning on a tree
9. Nonpreemptive ensemble motion planning
10. Approximation algorithms for some routing problems
11. Routing a vehicle of capacity greater than one
12. Two combinatorial problems associated with external sorting
13. Sequencing and scheduling: Algorithms and complexity
14. Classification of dial-a-ride problems
15. Scheduling jobs that arrive over time
16. The general pickup and delivery problem
17. Scheduling parallel machines on-line