Distributions and first moments of the busy and idle periods in controllableM/G/1 Queueing Models with Simple and Dyadic Policies
From MaRDI portal
Publication:4326440
Recommendations
- On the M/G/1 queue with D-policy
- Distribution of the busy period in a controllable \(M/G/2\) queue with \((0,K,N,M)\) policy
- A transient analysis of M/G/1 queues with N-policy
- Performance of the MAP/G/1 queue under the dyadic control of workload and server idleness
- Control Policies for the MX/G/1 Queueing System
Cites work
- A dyadic age-replacement policy for a periodically inspected equipment item subject to random deterioration
- Analyses of an M/M/N queue with servers' vacations
- Characterization and Computation of Optimal Policies for Operating an M/G/1 Queuing System with Removable Server
- Control of the service process in a queueing system
- Distribution of order statistics of waiting times in an ordinary renewal process and the covariance of the renewal increments
- Distribution of the busy period in a controllable M/M/2 queue operating under the triadic (0, K, N, M) policy
- Distribution of the workload in multiclass queueing systems with server vacations
- scientific article; zbMATH DE number 3979513 (Why is no real title available?)
- scientific article; zbMATH DE number 4041013 (Why is no real title available?)
- scientific article; zbMATH DE number 4100924 (Why is no real title available?)
- scientific article; zbMATH DE number 3488393 (Why is no real title available?)
- scientific article; zbMATH DE number 3522951 (Why is no real title available?)
- scientific article; zbMATH DE number 3222329 (Why is no real title available?)
- Optimal Average-Cost Policy for a Queue with Start-Up and Shut-Down Costs
- Optimal Operation of an M/G/1 Priority Queue with Removable Server
- Optimal Operation of an M/M/2 Queue with Removable Servers
- The T-Policy for the M/G/1 Queue
- The use of multiple integrals in the study of the backward and forward recurrence times for the ordinary renewal process
- Utilization of Idle Time in an M/G/1 Queueing System
- Waiting times forM/G/1 queues with service-time or delay-dependent server vacations
Cited in
(28)- Optimization of the \(T\) policy M/G/1 queue with server breakdowns and general startup times
- On the M/G/1 queue with D-policy
- An analysis of the M/G/1 system with N and T policy
- A recursive method to the optimal control of an M/G/1 queueing system with finite capacity and infinite capacity
- The steady-state system size distribution for a modified D-policy Geo/G/1 queueing system
- Bi-level control for batch arrival queues with an early startup and un-reliable server
- A recursive method for the \(N\) policy \(G/M/1\) queueing system with finite capacity
- Optimal control of a removable and non-reliable server in an infinite and a finite \(M/H_2/1\) queueing system
- A mean value formula for the M/G/1 queues controlled by workload
- On M/G/1 system under NT policies with breakdowns, startup and closedown
- Optimization on bicriterion policies for M/G/1 system with second optional service
- Distribution of the busy period in a controllable \(M/G/2\) queue with \((0,K,N,M)\) policy
- Optimal management for infinite capacity N-policy M/G/1 queue with a removable service station
- Queue Length Analysis of MAP/G/1 Queue UnderD-Policy
- Distribution of the busy period in a controllable M/M/2 queue operating under the triadic (0, K, N, M) policy
- Analysis of the MAP/G/1 queue under the Min(N, D)-policy
- MAP/G/1 Queue Under Workload Control and Postprocessing
- Entropy maximization andNTvacation M/G/1 model with a startup and unreliable server: comparative analysis on the first two moments of system size
- Entropy maximization and the busy period of some single-server vacation models
- Analysis of theMX/G/1 Queue UnderD-Policy
- Analysis and Cost Optimization of theM/G/1 Queue Under theD-Policy and LCFS Discipline
- Notes of \(M/G/1\) system under the \(\langle p,T\rangle\) policy with second optional service
- Queue length and waiting time of the M/G/1 queue under the \(D\)-policy and multiple vacations
- 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. II: \newline \(M(n)/G/1/K\)
- An \(M/G/1\) queue under hysteretic vacation policy with an early startup and un-reliable server
- Steady state analysis of an M^x/G/1 queue with two phase service and Bernoulli vacation schedule under multiple vacation policy
- Performance of the MAP/G/1 queue under the dyadic control of workload and server idleness
This page was built for publication: Distributions and first moments of the busy and idle periods in controllableM/G/1 Queueing Models with Simple and Dyadic Policies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4326440)
