An M/G/1 queue with multiple types of feedback and gated vacations
This paper considers a single-server queue with Poisson arrivals and multiple customer feedbacks. If the first service attempt of a newly arriving customer is not successful, he returns to the end of the queue for another service attempt, with a different service time distribution. He keeps trying in this manner (as an `old' customer) until his service is successful. The server operates according to the `gated vacation' strategy: when it returns from a vacation to find $K$ (new and old) customers, it renders a single service attempt to each of them and takes another vacation, etc. We study the joint queue length process of new and old customers, as well as the waiting time distribution of customers. Some extensions are also discussed.
|Department of Operations Research, Statistics, and System Theory [BS]|
|Organisation||Combinatorial Optimization and Algorithmics|
Boxma, O.J, & Yechiali, U. (1995). An M/G/1 queue with multiple types of feedback and gated vacations. Department of Operations Research, Statistics, and System Theory [BS]. CWI.