Hostname: page-component-76fb5796d-25wd4 Total loading time: 0 Render date: 2024-04-28T10:41:22.505Z 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

Abstract

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

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)