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
DOI10.1080/07362999508809382zbMath0819.60085OpenAlexW2025522689MaRDI QIDQ4326440
Hahn-Kyou Rhee, K. G. Gakis, B. D. Sivazlian
Publication date: 15 August 1995
Published in: Stochastic Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/07362999508809382
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (max. 100)
Queue Length Analysis of MAP/G/1 Queue UnderD-Policy ⋮ On the M/G/1 queue with \(D\)-policy ⋮ Queue length and waiting time of the M/G/1 queue under the \(D\)-policy and multiple vacations ⋮ Analysis of theMX/G/1 Queue UnderD-Policy ⋮ Entropy maximization and the busy period of some single-server vacation models ⋮ 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 ⋮ Notes of \(M/G/1\) system under the \(\langle p,T\rangle\) policy with second optional service ⋮ Optimal control of a removable and non-reliable server in an infinite and a finite \(M/H_2/1\) queueing system ⋮ The steady-state system size distribution for a modified D-policy Geo/G/1 queueing system ⋮ An analysis of the \(M/G/1\) system with \(N\) and \(T\) policy ⋮ A mean value formula for the M/G/1 queues controlled by workload ⋮ Steady state analysis of an \(M^x/G/1\) queue with two phase service and Bernoulli vacation schedule under multiple vacation policy ⋮ Analysis of the MAP/G/1 Queue Under the Min(N,D)-Policy ⋮ Performance of the MAP/G/1 queue under the dyadic control of workload and server idleness ⋮ Bi-level control for batch arrival queues with an early startup and un-reliable server ⋮ Analysis and Cost Optimization of theM/G/1 Queue Under theD-Policy and LCFS Discipline ⋮ 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 ⋮ 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 ⋮ Optimization of the \(T\) policy M/G/1 queue with server breakdowns and general startup times ⋮ Optimal management for infinite capacityN-policy M/G/1 queue with a removable service station ⋮ A recursive method for the \(N\) policy \(G/M/1\) queueing system with finite capacity ⋮ A recursive method to the optimal control of an M/G/1 queueing system with finite capacity and infinite capacity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Analyses of an M/M/N queue with servers' vacations
- Control of the service process in a queueing system
- A dyadic age-replacement policy for a periodically inspected equipment item subject to random deterioration
- Distribution of the busy period in a controllable M/M/2 queue operating under the triadic (0, K, N, M) policy
- Optimal Operation of an M/M/2 Queue with Removable Servers
- Distribution of the workload in multiclass queueing systems with server vacations
- Waiting times forM/G/1 queues with service-time or delay-dependent server vacations
- 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
- The T-Policy for the M/G/1 Queue
- Distribution of order statistics of waiting times in an ordinary renewal process and the covariance of the renewal increments
- Optimal Operation of an M/G/1 Priority Queue with Removable Server
- Optimal Average-Cost Policy for a Queue with Start-Up and Shut-Down Costs
- Characterization and Computation of Optimal Policies for Operating an M/G/1 Queuing System with Removable Server
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