A numerical procedure for the selection of the constant interarrival time to a single server queue

DOI10.1016/0898-1221(81)90037-7zbMath0467.60087OpenAlexW1984226442WikidataQ126388083 ScholiaQ126388083MaRDI QIDQ1155932

Carl Geiszler

Publication date: 1981

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(81)90037-7

zbMATH Keywords

interactive computationoptimal interarrival time

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Probabilistic methods, stochastic differential equations (65C99)

Cites Work

• Markov chains with applications in queueing theory, which have a matrix-geometric invariant probability vector
• Choosing a Good Appointment System—A Study of Queues of the Type (D, M, 1)
• Unnamed Item
• Unnamed Item

This page was built for publication: A numerical procedure for the selection of the constant interarrival time to a single server queue