A single server queue with platooned arrivals and phase type services

DOI10.1016/0377-2217(81)90008-4zbMath0466.90027OpenAlexW2016111289MaRDI QIDQ1155502

S. H. Smith

Publication date: 1981

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(81)90008-4

zbMATH Keywords

algorithmssingle server queuecalculation of probabilistic characteristicsblock-partitioned Markov chaincomputation of the steady-state featuresphase type servicesplatooned arrivalssemi- Markovian point process

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Markov renewal processes, semi-Markov processes (60K15) Probabilistic methods, stochastic differential equations (65C99)

Related Items (3)

Modelling traffic queues at a signalized intersection with vehicle- actuated control and Markovian arrival processes ⋮ An EM algorithm for platoon arrival processes in discrete time ⋮ Goodput Analysis Using Terminating MAP for a Class of Discrete-Time Queueing Models

Cites Work

• Unnamed Item
• The probabilistic significance of the rate matrix in matrix-geometric invariant vectors
• Stationary waiting-time distributions in the GI/PH/1 queue
• Markov chains with applications in queueing theory, which have a matrix-geometric invariant probability vector
• Renewal processes of phase type
• The Interrupted Poisson Process As An Overflow Process

This page was built for publication: A single server queue with platooned arrivals and phase type services