Computation of Steady-State Probabilities for M/M/1 Priority Queues

From MaRDI portal
Publication:3921950

DOI10.1287/opre.29.5.945zbMath0468.60089OpenAlexW1984351494MaRDI QIDQ3921950

Douglas R. Miller

Publication date: 1981

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

Full work available at URL: https://doi.org/10.1287/opre.29.5.945




Related Items

THE M/G/1-TYPE MARKOV CHAIN WITH RESTRICTED TRANSITIONS AND ITS APPLICATION TO QUEUES WITH BATCH ARRIVALSUnreliable queueing systemsAN INFINITE-PHASE QUASI-BIRTH-AND-DEATH MODEL FOR THE NON-PREEMPTIVE PRIORITYM/PH/1 QUEUEM/M/c Queue with Two Priority ClassesA preemptive priority queue with balkingAnalyzing priority queues with 3 classes using tree-like processesA Geo/Geo/1 inventory priority queue with self induced interruptionAlgorithms for Queueing Systems with Reneging and Priorities Modeled as Quasi-Birth-Death ProcessesAnalysis of stationary queue length distribution for Geo/T-IPH/1 queueTime-dependent analysis of an \(\mathrm{M}/\mathrm{M}/c\) preemptive priority system with two priority classesWaiting times in classical priority queues via elementary lattice path countingMultiple allocation hub location with service level constraints for two shipment classesDelay performance in stochastic processing networks with priority service.Joint queue length distribution of multi-class, single-server queues with preemptive prioritiesA matrix-analytic solution for the DBMAP/PH/ 1 priority queueUnnamed ItemRecursive computation of steady-state probabilities in priority queuesScheduling policies for a repair shop problemAsymptotics for the sojourn time distribution in the queue defined by a general QBD process with a countable phase spaceUpper bound for the decay rate of the joint queue-length distribution in a two-node Markovian queueing systemExact tail asymptotics in a priority queue -- characterizations of the non-preemptive modelProbabilistic approach to computational algorithms for finding stationary distributions of Markov chainsMultiple eigenvalues in spectral analysis for solving QBD processesA queueing system with probabilistic joining strategy for priority customersContinuous-time QBD processes with continuous phase variableCOMPUTATION OF STEADY-STATE PROBABILITIES FOR RESOURCE-SHARING CALL-CENTER QUEUEING SYSTEMSGEOMETRIC DECAY OF THE STEADY-STATE PROBABILITIES IN A QUASI-BIRTH-AND-DEATH PROCESS WITH A COUNTABLE NUMBER OF PHASESEXPLICIT SOLUTION FOR QUEUE LENGTH DISTRIBUTION OF M/T-SPH/1 QUEUEProduct differentiation and operations strategy in a capacitated environmentExact tail asymptotics in a priority queue -- characterizations of the preemptive modelSUFFICIENT CONDITIONS FOR A GEOMETRIC TAIL IN A QBD PROCESS WITH MANY COUNTABLE LEVELS AND PHASESA Nonpreemptive Priority System with Fuzzy ParametersTri-Layered QBD Processes with Boundary Assistance for Service ResourcesAn analysis of the \(M^X/M/1\) queue with multiple working vacations by \(GI/M/1\) type Markov processLight-Tailed Behavior in QBD Processes with Countably Many PhasesAnalysis of \(M/M/1\) queueing system with two priority classesREDUCING COSTS OF SPARE PARTS SUPPLY SYSTEMS VIA STATIC PRIORITIESStability and busy periods in a multiclass queue with state-dependent arrival ratesA maximum entropy priority approximation for a stable G/G/1 queueOn the stationary distribution of queue lengths in a multi-class priority queueing system with customer transfersThe Israeli Queue with PrioritiesAn exact solution for the state probabilities of the multi-class, multi-server queue with preemptive prioritiesExact tail asymptotics for a discrete-time preemptive priority queueAnalysis for stationary indices of discrete-time \(\mathrm{T-IPH}/\mathrm{Geo}/1\) queue