Flow time distributions in a \(K\) class \(M/G/1\) priority feedback queue

DOI10.1007/BF02412249zbMath0743.60097MaRDI QIDQ1175219

John A. Buzacott, Elizabeth M. Jewkes

Publication date: 25 June 1992

Published in: Queueing Systems (Search for Journal in Brave)

zbMATH Keywords

sojourn timesingle-server queueing systempriority ordering

Mathematics Subject Classification ID

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

Related Items

Optimal inspection effort and scheduling for a manufacturing process with repair, Examples of Applications of Queueing Theory in Canada, Analysis of multiclass Markovian polling systems with feedback and composite scheduling algorithms, Mathematical Models of the Queuing Systems with MMPP Flow and Instantaneous Feedback, An \(M\)/\(G\)/1 queue with multiple types of feedback, gated vacations and FCFS policy

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Analyses of priority queues with server control
• Arm-acquiring bandits
• Level crossing analysis of some variants of GI/M/1 queues
• Interchange arguments in stochastic scheduling
• Optimal Control of an M/G/1 Priority Queue Via N-Control
• Extensions of the multiarmed bandit problem: The discounted case
• Queues in Which Customers Receive Simultaneous Service from a Random Number of Servers: A System Point Approach
• Priority Queues with Feedback
• Some analyses on the control of queues using level crossings of regenerative processes
• ANALYSIS OF THE CONTROL OF QUEUES WITH SHORTEST PROCESSING TIME SERVICE DISCIPLINE
• The M/G/1 queue with instantaneous bernoulli feedback
• A Two Server Queue with Nonwaiting Customers Receiving Specialized Service
• On Level Crossing Analysis of Queues
• The System Point Method in Exponential Queues: A Level Crossing Approach
• On up- and downcrossings
• Optimal Control of Single-Server Queuing Networks and Multi-Class M/G/1 Queues with Feedback
• Level Crossings in Point Processes Applied to Queues: Single-Server Case
• Time-Sharing Service Systems. I
• An embedded level crossing technique for dams and queues