A two-queue, one-server model with priority for the longer queue
Queueing Systems: Theory and Applications
Alternating service queues with mixed exhaustive and K-limited services
Performance Evaluation
IEEE/ACM Transactions on Networking (TON)
Queueing analysis of polling models: progress in 1990-1994
Frontiers in queueing
Exact Analysis of the State-Dependent Polling Model
Queueing Systems: Theory and Applications
PMCCN '97 Proceedings of the IFIP TC6 / WG6.3 & WG7.3 International Conference on the Performance and Management of Complex Communication Networks
Iterative approximation of k-limited polling systems
Queueing Systems: Theory and Applications
On the application of Rouché's theorem in queueing theory
Operations Research Letters
On open problems in polling systems
Queueing Systems: Theory and Applications
Queueing Systems: Theory and Applications
On ergodicity conditions in a polling model with Markov modulated input and state-dependent routing
Queueing Systems: Theory and Applications
Hi-index | 0.00 |
We consider a two-queue model with state-dependent setups, in which a single server alternately serves the two queues. The high-priority queue is served exhaustively, whereas the low-priority queue is served according to the k-limited strategy. A setup at a queue is incurred only if there are customers waiting at the polled queue. We obtain the transforms of the queue length and sojourn time distributions under the assumption of Poisson arrivals, generally distributed service times, and generally distributed setup times. The interest for this model is fueled by an application in the field of logistics. It is shown how the results of this analysis can be applied in the evaluation of a stochastic two-item single-capacity production system. From these results we can conclude that significant cost reductions are possible by bounding the production runs of the low-priority item, which indicates the potential of the k-limited service discipline as priority rule in production environments.