Waiting times in a queueing system with capacity constraints and preemptive priorities
type: Item
instance of: scholarly article
title: Waiting times in a queueing system with capacity constraints and preemptive priorities
zbMATH Open document ID: 0617.60094
DOI: 10.1007/BF01720796
author: Yanyan Li
published in: OR Spektrum
publication date: 1987-01-01T00:00:00Z
review text: We investigate a queueing system with K classes of units arriving in independent Poisson streams and being served under the preemptive resume discipline. Units belonging to the same class require service times subject to a general distribution and their number in the system is limited. The following results refer to the queueing processes in an arbitrary class. We consider the joint probabilities for the number of waiting units and the residual processing time in equilibrium and we derive the L.-S. transform of their generating function. The main result of the paper is the L.-S. transform of the stationary waiting time distribution for a unit admitted to the system.
Mathematics Subject Classification ID: 60K25
Mathematics Subject Classification ID: 90B22
zbMATH DE Number: 4001161
zbMATH Keywords: preemptive resume discipline
zbMATH Keywords: generating function
zbMATH Keywords: stationary waiting time distribution
MaRDI profile type: Publication
cites work: The M/G/1 Finite Capacity Queue with Delays
cites work: Priority queues
cites work: Q3049635
cites work: The Steady-State Queueing Time Distribution for the M/G/1 Finite Capacity Queue
cites work: M/G/1/N Queue with Vacation Time and Exhaustive Service Discipline
cites work: Busy periods in time-dependent M/G/1 queues
full work available at URL: https://doi.org/10.1007/bf01720796
OpenAlex ID: W2032199139
description: scientific article; zbMATH DE number 4001161