Analysis of a finite capacity non preemptive priority queue
DOI10.1016/0305-0548(84)90022-4zbMATH Open0602.60093OpenAlexW2068910527MaRDI QIDQ1081978FDOQ1081978
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
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
blocking probabilitiesfinite capacity priority queue with multiple servers and non preemptive service disciplinehigh priority customerlow priority customer
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)
Cites Work
- Title not available (Why is that?)
- The G/M/m queue with finite waiting room
- Priority Queues
- Finite Queues in Series with Exponential or Erlang Service Times—A Numerical Approach
- Approximations in finite-capacity multi-server queues by Poisson arrivals
- Title not available (Why is that?)
- Title not available (Why is that?)
- Priority queues
- Priority Assignment in Waiting Line Problems
- 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
- Letter to the editor: ``Waiting line subject to priorities
- CUSTOMER OVERFLOW IN QUEUES WITH FINITE WAITING SPACE1
Cited In (15)
- Waiting times of a finite-capacity multi-server model with non-preemptive priorities
- Analysis of a finite buffer model with two servers and two nonpreemptive priority classes
- 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
- Title not available (Why is that?)
- Analysis of a finite buffer with non-preemptive priority scheduling
- Title not available (Why is that?)
- Analysis of the finite-source multiclass priority queue with an unreliable server and setup time
- Multi-server queueing systems with multiple priority classes
- Randomized pushing-out in the priority queueing with a finite buffer size
- Finite capacity priority queues with potential health applications
- An analysis of finite capacity queues with priority scheduling and common or reserved waiting areas
- Modeling and analysis of multiple-class tandem queuing systems with finite capacities
- Title not available (Why is that?)
- Title not available (Why is that?)
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)
