Analysis and computational algorithm for queues with state-dependent vacations. I: \newline G/M(n)/1/K
From MaRDI portal
(Redirected from Publication:863002)
Analysis and computational algorithm for queues with state-dependent vacations. I: \newline \(G/M(n)/1/K\)
Analysis and computational algorithm for queues with state-dependent vacations. I: \newline \(G/M(n)/1/K\)
Recommendations
- Analysis and computational algorithm for queues with state-dependent vacations. II: \newline \(M(n)/G/1/K\)
- Analysis of \(GI/M(n)/1/N\) queue with state-dependent multiple working vacations
- Analysis of an \(\mathrm{M}/\mathrm{M}/1\) queue with vacations and impatience timers which depend on the server's states
- Queueing analysis of state dependent \(M^{x}/G^{a,b}/1\) queue with balking, multiple vacations of alternate type and setup times
- scientific article; zbMATH DE number 1054682
- A recursive algorithm for state dependent \(GI/M/1/N\) queue with Bernoulli-schedule vacation
- Analysis of a bulk queue with state dependent arrivals and multiple vacations
- scientific article; zbMATH DE number 5846972
- Analysis of the \(M^{X}/G/1\) queueing system with vacation times
- Analysis of general-input bulk queue with vacations \(GI/M^{(a,b)}/1\)
Cites work
- scientific article; zbMATH DE number 4100924 (Why is no real title available?)
- scientific article; zbMATH DE number 3736680 (Why is no real title available?)
- scientific article; zbMATH DE number 49989 (Why is no real title available?)
- A recursive method to the optimal control of an M/G/1 queueing system with finite capacity and infinite capacity
- A unified algorithm for computing the stationary queue length distributions in \(M(k)/G/1/N\) and \(GI/M(k)/1/N\) queues
- A unified approach to gi/m(n)/l/k and m(n)/g/1/k queues via finite quasi-birth-death processes
- Analysis and computational algorithm for queues with state-dependent vacations. II: \newline \(M(n)/G/1/K\)
- Analysis of multi-server queues with station and server vacations
- Characterization and Computation of Optimal Policies for Operating an M/G/1 Queuing System with Removable Server
- Control Policies for the MX/G/1 Queueing System
- Distributions and first moments of the busy and idle periods in controllableM/G/1 Queueing Models with Simple and Dyadic Policies
- GI/M/1 Queue with Server Vacations
- On the finite-buffer bulk-service queue with general independent arrivals: \(GI/M^{[b]}/1/N\)
- Optimal Control of an M/Ek/1 Queueing System with a Removable Service Station
- Optimal Operating Policies for M/G/1 Queuing Systems
- Optimal Operation of an M/G/1 Priority Queue with Removable Server
- Optimal control of a removable server in an M/G/1 queue with finite capacity
- Optimal control of an M/G/1 queuing system with removable server via diffusion approximation
- Queueing systems with vacations - a survey
- The Finite Capacity GI/M/1 Queue with Server Vacations
- The GI/M/1 queue with exponential vacations
- The optimal strategy structure of an intermittently operated service channel
- Utilization of Idle Time in an M/G/1 Queueing System
Cited in
(11)- State Dependence in M/G/1 Server-Vacation Models
- Analysis of general input state dependent working vacation queue with changeover time
- Queueing analysis of state dependent \(M^{x}/G^{a,b}/1\) queue with balking, multiple vacations of alternate type and setup times
- Numerical calculation of steady state distribution for M/M/c vacation queueing system
- A unified algorithm for computing the stationary queue length distributions in \(M(k)/G/1/N\) and \(GI/M(k)/1/N\) queues
- Analysis and computational algorithm for queues with state-dependent vacations. II: \newline \(M(n)/G/1/K\)
- Computation of the quasi-stationary distributions in \(M(n)/GI/1/K\) and \(GI/M(n)/1/K\) queues
- Analysis of \(GI/M(n)/1/N\) queue with state-dependent multiple working vacations
- Development of computational algorithm for multiserver queue with renewal input and synchronous vacation
- A recursive algorithm for state dependent \(GI/M/1/N\) queue with Bernoulli-schedule vacation
- Discrete-time renewal input state dependent queue with working vacations and change over time
This page was built for publication: Analysis and computational algorithm for queues with state-dependent vacations. I: \newline \(G/M(n)/1/K\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q863002)