Name
Title | ||
|---|---|---|
System Time Distribution Of Dynamic Traveling Repairman Problem Under The Part-N-Tsp Policy |
Abstract | ||
|---|---|---|
We propose the PART-n-TSP policy for the Dynamic Traveling Repairman Problem [1]. We compute a good approximation for the distribution of the system time, defined as the elapsed time between the arrival and the completion of each task. PART-n-TSP stabilizes the system for every load in [0, 1). PART-n-TSP has lower system time variance than PART-TSP [14] and Nearest Neighbor [1] when the load is neither too small or too large. We show that PART-n-TSP is also optimal for system time expectation under light and heavy loads. |
Year | Venue | Keywords |
|---|---|---|
2015 | 2015 EUROPEAN CONTROL CONFERENCE (ECC) | servers,convolution,vehicle dynamics,bismuth,switches,sequential analysis |
Field | DocType | Citations |
k-nearest neighbors algorithm,Mathematical optimization,Convolution,Server,Algorithm,Vehicle dynamics,System time,Mathematics | Conference | 1 |
PageRank | References | Authors |
0.37 | 4 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jiangchuan Huang | 1 | 1 | 0.71 |
| Raja Sengupta | 2 | 1468 | 258.78 |