Upper and lower bounds for the waiting time in the symmetric shortest queue system

Ivo Adan, Geert-Jan van Houtum, J. van der Wal, Jan van der Wal

Research output: Contribution to journalArticleAcademicpeer-review

31 Citations (Scopus)
161 Downloads (Pure)

Abstract

In this paper we 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
Original languageEnglish
Pages (from-to)197-217
JournalAnnals of operations research
Volume48
Issue number2
DOIs
Publication statusPublished - 1994

Keywords

  • METIS-206049
  • IR-101675

Fingerprint Dive into the research topics of 'Upper and lower bounds for the waiting time in the symmetric shortest queue system'. Together they form a unique fingerprint.

Cite this