Finite buffer polling models with routing

Finite buffer polling models with routing

0.00 Avg rating0 Votes
Article ID: iaor20062041
Country: Netherlands
Volume: 165
Issue: 3
Start Page Number: 794
End Page Number: 809
Publication Date: Sep 2005
Journal: European Journal of Operational Research
Authors: , ,
Keywords: polling
Abstract:

This paper analyzes a finite buffer polling system with routing. Finite buffers are used to model the limited capacity of the system, and routing is used to represent the need for additional service. The most significant results of the analysis are the derivation of the generating function for queue length when buffer sizes are limited and a representation of the system workload. The queue lengths at polling instants are determined by solving a system of recursive equations; an embedded Markov chain analysis and numerical inversion are used to derive the queue length distributions. This system may be used to represent production models with setups and lost sales or expediting.

Reviews

Required fields are marked *. Your email address will not be published.