Year: 1989
Type: other
Abstract: This paper deals with the issue of deriving efficient operational rules for polling systems with switchover periods.Specifically, we study the following static optimization problem: Determine the server visit order (polling table) that minimizes the mean total workload.This problem is strongly related with, and in many applications coincides with, that of minimizing the overall mean customer delay in the system.A heuristic approach to the polling table problem is presented, using the exact solution of a related problem, viz.:Determine those server routing probabilities in a random polling system, that lead to the minimal mean total workload.Numerical experiments show that this heuristic approach yields excellent results.
Authors: Onno Boxma, Hanoch Levy, J. A. Westrate
Language: English
Subfield: Management Information Systems
Domain: Social Sciences
Open Access status: green
OpenAlex ID: W1511665894