A state-dependent polling model with k-limited service

A state-dependent polling model with k-limited service

By: jacobsadm

June 5, 2013

  • Author(s):
    Winands, E.M.M., Adan, I.J.B.F., Houtum, G.J.J.A.N. van & Down, D.G.

  • Appeared In: Probability in the Engineering and Informational Sciences
  • Volume: 23, 2009
  • Issue: 2
  • Pages: 385 – 408


  • 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.