Finite capacity priority queues with potential health applications
The queueing processes of interest in this paper are that of waiting lines with two priorities and multiple service channels. The arrival process is assumed Poisson and the service time distribution is negative exponential. Arriving units enter service if there is at least one idle channel, otherwise they join a finite queue and are served according to a non-preemptive priority discipline. If a low priority arriving unit finds the queue full, it is not allowed to enter the system and is considered blocked or lost. In the first model a high priority arrival may displace a low priority unit from the full queue and may be blocked if the queue consists of high priority units only. In the second model the high priority unit may still displace a low priority unit from the full queue but it will never be blocked and may wait outside the system if the system is full. Thus far there has been no discussion of such models in queueing theory literature. In this paper analytical expressions for average waiting times have been obtained for the two models. Two potential applications of the models are described and the usefulness of the models is illustrated by numerical examples.
- The Impact of Self-Generation of Priorities on Multi-Server Queues with Finite Capacity
- Priority Assignment in Waiting Line Problems
- Analysis of a finite capacity non preemptive priority queue
- scientific article; zbMATH DE number 863594
- High-priority expected waiting times in the delayed accumulating priority queue with applications to health care KPIs
- An analysis of finite capacity queues with priority scheduling and common or reserved waiting areas
- Modeling and analysis of high risk patient queues.
- Appointments in care pathways: the \(\mathrm{Geo}^x/\mathrm{D}/1\) queue with slot reservations
- A model for deceased-donor transplant queue waiting times
- A parallel priority queueing system with finite buffers
- On the application of a polling model with non-zero walk times and priority processing to a medical emergency-room environment.
- Exclusion in a priority queue
- High-priority expected waiting times in the delayed accumulating priority queue with applications to health care KPIs
- Randomized pushing-out in the priority queueing with a finite buffer size
This page was built for publication: Finite capacity priority queues with potential health applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1081980)
