On completion times in a two-class priority queue with impatience
type: Item
instance of: scholarly article
title: On completion times in a two-class priority queue with impatience
zbMATH Open document ID: 1390.90261
DOI: 10.1504/IJMOR.2014.060855
author: Ioane Muni Toke
published in: International Journal of Mathematics in Operational Research
publication date: 2018-06-06T00:00:00Z
review text: Summary: In this note, we consider a two-class priority queueing system with Poisson arrivals, general service time distribution and one server, in which customers that are not currently being served may leave the queue according to exponentially distributed patience times, i.e., a \(M_1\), \(M_2/G/1 + M\) system using a generalised Kendall's notation. We expand the classic methodology to derive analytical formulas for the completion times in such a system, using preemptive repeat different and preemptive repeat identical disciplines. Known average completion times for priority queues without impatience are retrieved as limit cases.
Mathematics Subject Classification ID: 90B22
Mathematics Subject Classification ID: 60G15
zbMATH DE Number: 6881353
zbMATH Keywords: priority queues
zbMATH Keywords: queues with impatience
zbMATH Keywords: reneging
zbMATH Keywords: completion times
zbMATH Keywords: preemptive disciplines
MaRDI profile type: Publication
full work available at URL: ijmor.2014.060855
OpenAlex ID: W2079070596
Recommended article: Waiting time distribution in a two-class two-server heterogeneous priority queue
Recommended article: Q5020868
Recommended article: On a two-queue priority system with impatience and its application to a call center
Recommended article: Two competing discrete-time queues with priority
Recommended article: A discrete-time priority queue with two-class customers and bulk services
Recommended article: Waiting time in the \(\mathrm{M}/\mathrm{M}/m\) LCFS nonpreemptive priority queue with impatient customers
Recommended article: Ergodicity of two class priority queues with preemptive priority
Recommended article: ANALYSIS OF A TWO-CLASS PRIORITY QUEUE WITH BERNOULLI SCHEDULES
description: scientific article; zbMATH DE number 6881353