Reneging from Processor Sharing Systems and Random Queues
From MaRDI portal
Publication:4712850
DOI10.1287/moor.15.1.129zbMath0797.68017OpenAlexW2013123125MaRDI QIDQ4712850
Publication date: 25 June 1992
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.15.1.129
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (13)
A queueing model for managing small projects under uncertainties ⋮ An equilibrium analysis of a discrete-time Markovian queue with endogenous abandonments ⋮ The value of reneging for strategic customers in queueing systems with server vacations/failures ⋮ Mathematical problems in the theory of processor-sharing queueing systems ⋮ A polling model with reneging at polling instants ⋮ Impatience in Single Server Queueing Model ⋮ An Equilibrium Analysis of a Multiclass Queue with Endogenous Abandonments in Heavy Traffic ⋮ In-queue priority purchase: a dynamic game approach ⋮ STRATEGIC CUSTOMERS IN MARKOVIAN QUEUES WITH VACATIONS AND SYNCHRONIZED ABANDONMENT ⋮ Strategic experimentation in queues ⋮ Rational joining behavior in a queueing system with abandonments ⋮ Equilibrium Strategies for Processor Sharing and Random Queues with Relative Priorities ⋮ Stable strategies for processor sharing systems
This page was built for publication: Reneging from Processor Sharing Systems and Random Queues
