Blocking Probability for M/G/1 Vacation Systems with Occupancy Level Dependent Schedules
From MaRDI portal
Publication:3817416
DOI10.1287/opre.37.1.134zbMath0666.60097OpenAlexW2132466918MaRDI QIDQ3817416
Publication date: 1989
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.37.1.134
steady-state distributionfinite buffer capacityergodic probabilitiesinfinite capacity systemsingle server vacation systemsvacation schedules
Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (20)
A two phase batch arrival retrial queueing system with Bernoulli vacation schedule ⋮ A parametric uncertainty analysis method for queues with vacations ⋮ Queues with group arrivals and exhaustive service discipline ⋮ Transient solution for a finite capacity \(M/G^{a,b}/1\) queueing system with vacations to the server ⋮ Queueing systems with vacations - a survey ⋮ A distributional form of Little's law ⋮ The loss probability in an overloaded queue using the dual queue ⋮ The queue GeoX/G/1/N+1 revisited ⋮ A two phase batch arrival queueing system with a vacation time under Bernoulli schedule. ⋮ Analysis of a two-stage cycle queue with state-dependent vacation policy ⋮ Steady state analysis of an \(M^x/G/1\) queue with two phase service and Bernoulli vacation schedule under multiple vacation policy ⋮ A Survey for Stochastic Decomposition in Vacation Queues ⋮ An M\(^{[x}\)/G/1 system with startup server and \(J\) additional options for service] ⋮ The \(M/G/1/K\) blocking formula and its generalizations to state-dependent vacation systems and priority systems ⋮ \(M^{[x}/(G_{1}, G_{2})/1\) retrial queue under Bernoulli vacation schedules with general repeated attempts and starting failures] ⋮ On the discrete-time \(\mathrm{Geo}/G/1\) queue with randomized vacations and at most \(J\) vacations ⋮ Sample-path analysis of the proportional relation and its constant for discrete-time single-server queues ⋮ Performance analysis of a discrete-time \(Geo/G/1\) queue with randomized vacations and at most \(J\) vacations ⋮ On an unreliable retrial queue with general repeated attempts and \(J\) optional vacations ⋮ Study on the departure process of discrete-time \(Geo/G/1\) queue with randomized vacations
This page was built for publication: Blocking Probability for M/G/1 Vacation Systems with Occupancy Level Dependent Schedules