Online Multi-Server Dial-A-Ride Problems
3,00 €
Area 09 – Ingegneria industriale e dell'informazione
Tweet
SINTESI
In an online dial-a-ride problem, a crew of servers has to process transportation requests as they arrive in real time. Possible objective functions include minimizing the makespan and minimizing the sum of completion times. We give competitive algorithms and negative results for several online dial-a-ride problems with multiple servers. Surprisingly, in some cases the competitive ratio is dramatically better than that of the corresponding single server problem.
| pagine: | 16 |
| formato: | 17 x 24 |
| ISBN: | 978-88-548-0482-1 |
| data pubblicazione: | Marzo 2006 |
| marchio editoriale: | Aracne |
| collana: | Dipartimento di Informatica e Sistemistica “Antonio Ruberti” della “Sapienza” Università di Roma | 2006/2 |
SINTESI
