Some explicit formulas for the steady-state behavior of the queue with semi-Markovian service times
From MaRDI portal
Publication:4162273
DOI10.2307/1425821zbMath0381.60081OpenAlexW2052736480MaRDI QIDQ4162273
Publication date: 1977
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1425821
Queueing theory (aspects of probability theory) (60K25) Markov renewal processes, semi-Markov processes (60K15)
Related Items (11)
The single server semi-Markov queue ⋮ Queueing models of secondary storage devices ⋮ On the waiting time of arriving aircrafts and the capacity of airports with one or two runways ⋮ Matrix-analytic methods in queueing theory ⋮ Analysis of channel and disk subsystems in computer systems ⋮ A single-server queue with batch arrivals and semi-Markov services ⋮ A single server model for packetwise transmission of messages ⋮ Departures from queues with changeover times ⋮ ROUTING OF AIRPLANES TO TWO RUNWAYS: MONOTONICITY OF OPTIMAL CONTROLS ⋮ Generalized gap acceptance models for unsignalized intersections ⋮ Stationary queuing systems with dependencies
This page was built for publication: Some explicit formulas for the steady-state behavior of the queue with semi-Markovian service times
