Waiting time in the \(\mathrm{M}/\mathrm{M}/m\) LCFS nonpreemptive priority queue with impatient customers

DOI10.1007/s10479-015-1876-7zbMath1357.60104OpenAlexW2468561439MaRDI QIDQ513052

Hideaki Takagi

Publication date: 3 March 2017

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-015-1876-7

zbMATH Keywords

nonpreemptive prioritywaiting timequeueimpatient customersmultiserverabandonmentlast-come first-servedpolite customers

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)

Related Items (1)

Strategic behavior of customers and optimal control for batch service polling systems with priorities

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Analysis of a last come first served queueing system with customer abandonment
• On priority queues with impatient customers
• Waiting and sojourn times in a multi-server queue with mixed priorities
• Queuing with balking and reneging in \(M/G/1\) systems
• Engineering Solution of a Basic Call-Center Model
• Waiting Times in the Non-Preemptive Priority M/M/c Queue
• Waiting-Time Distribution of a Multi-Server, Priority Queuing System
• Priority Assignment in Waiting Line Problems
• WAITING TIME IN THE M/M/$ m $/$ ( m + c ) $ QUEUE WITH IMPATIENT CUSTOMERS

This page was built for publication: Waiting time in the \(\mathrm{M}/\mathrm{M}/m\) LCFS nonpreemptive priority queue with impatient customers