Analysis of a finite capacity non preemptive priority queue

DOI10.1016/0305-0548(84)90022-4zbMath0602.60093OpenAlexW2068910527MaRDI QIDQ1081978

A. Cameron Mitchell, Mohammad Fasihullah Kazmi, Asha Seth Kapadia

Publication date: 1984

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(84)90022-4

zbMATH Keywords

blocking probabilitiesfinite capacity priority queue with multiple servers and non preemptive service disciplinehigh priority customerlow priority customer

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items

Finite capacity priority queues with potential health applications, A note on Analysis of a finite capacity nonpreemptive priority queue by Kapadia, Kazmi and Mitchell, An analysis of finite capacity queues with priority scheduling and common or reserved waiting areas, Randomized pushing-out in the priority queueing with a finite buffer size, Waiting times of a finite-capacity multi-server model with non-preemptive priorities, Multi-server queueing systems with multiple priority classes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Priority queues
• Priority Queues
• The G/M/m queue with finite waiting room
• 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
• A Processor Utilization Model for a Multiprocessor Computer System
• Approximations in finite-capacity multi-server queues by Poisson arrivals
• Priority Assignment in Waiting Line Problems
• Letter to the Editor—Waiting Line Subject to Priorities
• CUSTOMER OVERFLOW IN QUEUES WITH FINITE WAITING SPACE1
• Finite Queues in Series with Exponential or Erlang Service Times—A Numerical Approach