Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/86289
Authors: 
Gaujal, Bruno
Hordijk, Arie
van der Laan, Dinard
Year of Publication: 
2005
Series/Report no.: 
Tinbergen Institute Discussion Paper 05-066/4
Abstract: 
In this paper, we consider deterministic (both fluid and discrete) polling systems with N queues with infinite buffers and we show how to compute the best polling sequence (minimizing the average total workload). With two queues, the best polling sequence is always periodic when the system is stable and forms a regular sequence. The fraction of time spent by the server in the first queue is highly non continuous in the parameters of the system (arrival rate and service rate) and shows a fractal behavior. Convexity properties are shown in Appendix as well as a generalization of the computations to the stochastic exponential case.
Subjects: 
Polling systems
regular sequences
multimodularity
optimal control
JEL: 
C60
C63
C65
Document Type: 
Working Paper

Files in This Item:
File
Size
551.19 kB





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.