Distributions and first moments of the busy and idle periods in controllableM/G/1 Queueing Models with Simple and Dyadic Policies

From MaRDI portal
Revision as of 22:01, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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




Related Items (26)

Queue Length Analysis of MAP/G/1 Queue UnderD-PolicyOn the M/G/1 queue with \(D\)-policyQueue length and waiting time of the M/G/1 queue under the \(D\)-policy and multiple vacationsAnalysis of theMX/G/1 Queue UnderD-PolicyEntropy maximization and the busy period of some single-server vacation modelsAnalysis 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 serverNotes of \(M/G/1\) system under the \(\langle p,T\rangle\) policy with second optional serviceOptimal control of a removable and non-reliable server in an infinite and a finite \(M/H_2/1\) queueing systemThe steady-state system size distribution for a modified D-policy Geo/G/1 queueing systemAn analysis of the \(M/G/1\) system with \(N\) and \(T\) policyA mean value formula for the M/G/1 queues controlled by workloadSteady state analysis of an \(M^x/G/1\) queue with two phase service and Bernoulli vacation schedule under multiple vacation policyAnalysis of the MAP/G/1 Queue Under the Min(N,D)-PolicyPerformance of the MAP/G/1 queue under the dyadic control of workload and server idlenessBi-level control for batch arrival queues with an early startup and un-reliable serverAnalysis and Cost Optimization of theM/G/1 Queue Under theD-Policy and LCFS DisciplineOn \(M/G/1\) system under \(NT\) policies with breakdowns, startup and closedownOptimization on bicriterion policies for M/G/1 system with second optional serviceMAP/G/1 Queue Under Workload Control and PostprocessingEntropy maximization andNTvacation M/G/1 model with a startup and unreliable server: comparative analysis on the first two moments of system sizeOptimization of the \(T\) policy M/G/1 queue with server breakdowns and general startup timesOptimal management for infinite capacityN-policy M/G/1 queue with a removable service stationA recursive method for the \(N\) policy \(G/M/1\) queueing system with finite capacityA recursive method to the optimal control of an M/G/1 queueing system with finite capacity and infinite capacity



Cites Work


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