Article ID: | iaor2000519 |
Country: | United States |
Volume: | 101 |
Issue: | 1 |
Start Page Number: | 203 |
End Page Number: | 211 |
Publication Date: | Apr 1999 |
Journal: | Journal of Optimization Theory and Applications |
Authors: | Kodialam M.S. |
Keywords: | vehicle routing & scheduling, networks: flow |
In this paper, we consider the routing problem described in Mohanty and Cassandras. As in that paper, we show that the optimal Bernoulli split to minimize mean time in the system is asymptotically independent of the variance of the service time. We give simple proofs of the results in that paper. We exploit the fact that the optimal split to minimize the mean queueing time is variance independent and the special structure of the Karush–Kuhn–Tucker optimality conditions to derive the optimal solution. Apart from being very straightforward, the proofs also give insight into the reason for the existence of the variance-independent asymptotically optimal routing policy.