| Article ID: | iaor19941624 |
| Country: | Switzerland |
| Volume: | 48 |
| Issue: | 1/4 |
| Start Page Number: | 197 |
| End Page Number: | 217 |
| Publication Date: | Jan 1994 |
| Journal: | Annals of Operations Research |
| Authors: | Adan Ivo, Houtum Geert-Jan van, Wal Jan van der |
In this paper the authors compare the exponential symmetric shortest queue system with two related systems: the shortest queue system with Threshold Jockeying and the shortest queue system with Threshold Blocking. The latter two systems are easier to analyse and are shown to give tight lower and upper bounds respectively for the mean waiting time in the shortest queue system. The approach also gives bounds for the distribution of the total number of jobs in the system.