Finite customer-pool queues
Onno Boxma, Offer Kella, Michel Mandjes
TL;DR
This paper analyzes a queueing system with a finite customer pool, deriving the time-dependent distributions of customers, workload, and waiting times using transform techniques.
Contribution
It provides a novel characterization of finite customer-pool queues through transform methods, extending classical queue analysis.
Findings
Explicit formulas for time-dependent distributions
Characterization of workload and waiting times
Extension of queue theory to finite customer pools
Abstract
In this paper we consider an M/G/1-type queue fed by a finite customer-pool. In terms of transforms, we characterize the time-dependent distribution of the number of customers and the workload, as well as the associated waiting times.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Queuing Theory Analysis · Probability and Risk Models · Healthcare Operations and Scheduling Optimization