Advertisement

Health Care Management Science

, Volume 8, Issue 3, pp 231–236 | Cite as

Transient Probabilities for Queues with Applications to Hospital Waiting List Management

  • Mark Joy
  • Simon Jones
Article

Abstract

In this paper we study queuing systems within the NHS1. Recently imposed government performance targets lead NHS executives to investigate and instigate alternative management strategies, thereby imposing structural changes on the queues. Under such circumstances, it is most unlikely that such systems are in equilibrium. It is crucial, in our opinion, to recognise this state of affairs in order to make a balanced assessment of the role of queue management in the modern NHS. From a mathematical perspective it should be emphasised that measures of the state of a queue based upon the assumption of statistical equilibrium (a pervasive methodology in the study of queues) are simply wrong in the above scenario. To base strategic decisions around such ideas is therefore highly questionable and it is one of the purposes of this paper to offer alternatives: we present some (recent) research whose results generate performance measures and measures of risk, for example, of waiting-times growing unacceptably large; we emphasise that these results concern the transient behaviour of the queueing model—there is no asssumption of statistical equilibrium. We also demonstrate that our results are computationally tractable.

Keywords

Structural Change Statistical Equilibrium Management Strategy Economic Policy Public Finance 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    1. K. Sen and J.L. Jain, Combinatorial approach to Markovian queueing models, J. Statistical Plann. and Inference 34 (1993) 269–279.CrossRefGoogle Scholar
  2. [2]
    2. K. Sen and R. Gupta, Transient solution of M/M/1 queues with batch arrival: A new approach, Statistica 3 (1996) 333–343.Google Scholar
  3. [3]
    3. Mark Joy, Transient analysis of the waiting times in M/M /1 queues (Submitted for publication, 2004).Google Scholar
  4. [4]
    4. W. Feller, An Introduction to Probability Theory and Its Applications, Vol 2 (Wiley & Sons, New York, 1971).Google Scholar
  5. [5]
    5. S.G. Mohanty, The distribution of the maximum queue length, the number of customers served and the duration of the busy period for the queueing system M /M /1 involving batches, INFOR, 9, 1971.Google Scholar
  6. [6]
    6. L. Takács, Combinatorial Methods in the Theory of Stochastic Processes (John Wiley & Sons, New York, 1967).Google Scholar
  7. [7]
    7. Milton Abramowitz and Irene A. Stegun, Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables (Dover Publications, Inc., New York, 1970).Google Scholar

Copyright information

© Springer Science + Business Media, Inc. 2005

Authors and Affiliations

  1. 1.School of MathematicsKingston UniversityU.K.
  2. 2.Bromley NHSU.K.

Personalised recommendations