Abstract
We analyze a class of cyclic service (polling) systems with multiple customer classes (stations) in which the server stops cycling upon finding the entire system empty and initiates a setup only when the polled station has at least one customer in the queue. Interest in such systems is fueled by applications in design and performance analysis of manufacturing as well as telecommunication systems, We develop a discrete Fourier transform (DFT)-based near-exact numerical technique and an approximate method for systems with any number of stations. The DFT-based algorithm is accurate but computationally demanding when either the number of stations is large or server utilization is high. In these cases, the approximate method appears to work well in a large number of numerical tests.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
