| Article ID: | iaor20041257 |
| Country: | United States |
| Volume: | 21 |
| Issue: | 2 |
| Start Page Number: | 469 |
| End Page Number: | 476 |
| Publication Date: | May 1996 |
| Journal: | Mathematics of Operations Research |
| Authors: | Koole G. |
A long-standing conjecture on the optimal Bernoulli routing policy is proven to be true. For the case of equal exponential service times it is shown that splitting equally among the queues minimizes the departure times in a stochastic pathwise sense. A new technique is used, showing that certain distributional properties related to Schur convexity propagate forward in time.