Analysis of a finite capacity non preemptive priority queue
type: Item
instance of: scholarly article
title: Analysis of a finite capacity non preemptive priority queue
zbMATH Open document ID: 0602.60093
DOI: 10.1016/0305-0548(84)90022-4
author: Asha S. Kapadia
author: Mohammad Fasihullah Kazmi
author: A. Cameron Mitchell
published in: Computers \& Operations Research
publication date: 1984-01-01T00:00:00Z
review text: In this paper a finite capacity priority queue with multiple servers and non preemptive service discipline is analysed. The arrival and service processes were assumed Markovian and only two priority classes were considered. An analytical solution for blocking probabilities for the customers in the two classes is obtained under the assumption that a high priority customer upon arrival can displace a low priority customer from the waiting line if the queue is full.
Mathematics Subject Classification ID: 60K25
Mathematics Subject Classification ID: 90B22
zbMATH DE Number: 3971944
zbMATH Keywords: finite capacity priority queue with multiple servers and non preemptive service discipline
zbMATH Keywords: blocking probabilities
zbMATH Keywords: high priority customer
zbMATH Keywords: low priority customer
MaRDI profile type: Publication
full work available at URL: 0305-0548(84)90022-4
OpenAlex ID: W2068910527
cites work: CUSTOMER OVERFLOW IN QUEUES WITH FINITE WAITING SPACE1
cites work: A Processor Utilization Model for a Multiprocessor Computer System
cites work: Priority Assignment in Waiting Line Problems
cites work: Q4771978
cites work: On the relationship between the distribution of maximal queue length in the M/G/1 queue and the mean busy period in the M/G/1/n queue
cites work: Q4070096
cites work: Finite Queues in Series with Exponential or Erlang Service Times—A Numerical Approach
cites work: The G/M/m queue with finite waiting room
cites work: Letter to the Editor—Waiting Line Subject to Priorities
cites work: Priority queues
cites work: Priority Queues
cites work: Approximations in finite-capacity multi-server queues by Poisson arrivals
cites work: Q3273543
description: scientific article; zbMATH DE number 3971944