Abstract
The hypothetical model that we shall be considering in this paper is referred to as the single-server queue, and the details of this model are given in a recent paper by Lindley(5). The present treatment involves exactly the same assumptions as Lindley has given already, and we refer to his paper for a rigorous statement of them. Briefly, we shall be assuming general independent service times and general independent input or arrival times. Theoretical studies of the single-server queue are capable of wide applications, many of which are described in a paper by Kendall (4) and in the discussion to that paper.
Publisher
Cambridge University Press (CUP)
Cited by
158 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The periodic steady-state solution for queues with Erlang arrivals and service and time-varying periodic transition rates;Queueing Systems;2022-08-10
2. Index;Scheduling and Control of Queueing Networks;2021-10-31
3. References;Scheduling and Control of Queueing Networks;2021-10-31
4. Parallel Servers with Skill-Based Routing;Scheduling and Control of Queueing Networks;2021-10-31
5. Load Balancing in the Supermarket Model;Scheduling and Control of Queueing Networks;2021-10-31