Hostname: page-component-745bb68f8f-s22k5 Total loading time: 0 Render date: 2025-02-11T01:46:19.883Z Has data issue: false hasContentIssue false

AN EMERGENCY FACILITY WITH MINIMAL ADMISSION

Published online by Cambridge University Press:  10 October 2002

J. Preater
Affiliation:
Department of Mathematics, Keele University, Keele, Staffordshire, UK, E-mail: j.preater@maths.keele.ac.uk
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We study an M/M/∞ queuing system in which each arrival has a random urgency and is admitted if and only if it is more urgent than all individuals currently receiving service. The system represents, for example, a less-than-magnanimous emergency facility. For this system, and also for a closely related “Parody,” we study the busy period distribution and, to a lesser extent, occupancy. Both exact and heavy traffic results are given.

Type
Research Article
Copyright
© 2002 Cambridge University Press