A state-dependent polling model with k-limited service
| Autor: | Erik Winands, G.J.J.A.N. van Houtum, Douglas G. Down, Ivo Adan |
|---|---|
| Přispěvatelé: | Stochastic Operations Research, Operations Planning Acc. & Control, Stochastics, Mathematics, Operations Research |
| Jazyk: | angličtina |
| Rok vydání: | 2009 |
| Předmět: |
Statistics and Probability
Queueing theory Mathematical optimization Run queue Queue management system Operations research Computer science Management Science and Operations Research Fork–join queue Industrial and Manufacturing Engineering Multilevel queue SDG 7 - Affordable and Clean Energy Statistics Probability and Uncertainty Priority queue Bulk queue Queue |
| Zdroj: | Probability in the Engineering and Informational Sciences, 23(2), 385-408. Cambridge University Press Probability in the Engineering and Informational Sciences, 23(02), 385-408. Cambridge University Press Winands, E M M, Adan, I J B F, van Houtum, G J & Down, D G 2009, ' A state-dependent polling model with k-limited service ', Probability in the Engineering and Informational Sciences, vol. 23, no. 02, pp. 385-408 . https://doi.org/10.1017/S0269964809000217 |
| ISSN: | 0269-9648 |
| DOI: | 10.1017/S0269964809000217 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|