F. I. Karpelevich, A. Kreinin
Abstract
An upper bound for the mean waiting time in E k /GX/1 queues with ^-divisible service time distribution is discussed.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
An upper bound for the mean waiting time in E k /GX/1 queues with ^-divisible service time distribution is discussed.
Key concepts: Queue, Combinatorics, Service (business), Upper and lower bounds, Mathematics, Discrete mathematics, Computer science, Computer network