Analysis of a finite capacity non preemptive priority queue

DOI10.1016/0305-0548(84)90022-4MaRDI QIDQ1081978zbMATH OpenOpenAlexFDO

Authors Asha S. Kapadia, Mohammad Fasihullah Kazmi, A. Cameron Mitchell

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

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

Recommendations

• scientific article; zbMATH DE number 6747326
• A note on Analysis of a finite capacity nonpreemptive priority queue by Kapadia, Kazmi and Mitchell
• scientific article; zbMATH DE number 967318
• Analysis of a finite buffer with non-preemptive priority scheduling
• Analysis of nonpreemptive priority queues with multiple servers and two priority classes

Cites work

• scientific article; zbMATH DE number 3155844 (Why is no real title available?)
• scientific article; zbMATH DE number 3488392 (Why is no real title available?)
• scientific article; zbMATH DE number 3446196 (Why is no real title available?)
• A Processor Utilization Model for a Multiprocessor Computer System
• Approximations in finite-capacity multi-server queues by Poisson arrivals
• CUSTOMER OVERFLOW IN QUEUES WITH FINITE WAITING SPACE1
• Finite Queues in Series with Exponential or Erlang Service Times—A Numerical Approach
• Letter to the editor: ``Waiting line subject to priorities
• 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
• Priority Assignment in Waiting Line Problems
• Priority Queues
• Priority queues
• The G/M/m queue with finite waiting room

Cited in

(15)

• An analysis of finite capacity queues with priority scheduling and common or reserved waiting areas
• scientific article; zbMATH DE number 19795 (Why is no real title available?)
• scientific article; zbMATH DE number 5926330 (Why is no real title available?)
• Analysis of a finite buffer with non-preemptive priority scheduling
• Randomized pushing-out in the priority queueing with a finite buffer size
• Modeling and analysis of multiple-class tandem queuing systems with finite capacities
• scientific article; zbMATH DE number 2050899 (Why is no real title available?)
• Multi-server queueing systems with multiple priority classes
• Waiting times of a finite-capacity multi-server model with non-preemptive priorities
• Analysis of the finite-source multiclass priority queue with an unreliable server and setup time
• scientific article; zbMATH DE number 6747326 (Why is no real title available?)
• Analysis of a finite buffer model with two servers and two nonpreemptive priority classes
• 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 Exact Analysis of the Multi‐classM/M/kPriority Queue with Partial Blocking

This page was built for publication: Analysis of a finite capacity non preemptive priority queue

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1081978)