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.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 469-480 |
| Number of pages | 12 |
| Journal | IIE Transactions (Institute of Industrial Engineers) |
| Volume | 29 |
| Issue number | 6 |
| DOIs | |
| State | Published - 1997 |
Bibliographical note
Funding Information:This research has been supported, in part, by the Natural Sciences and Engineering Research Council of Canada through research grant number OGP0045904 awarded to Diwakar Gupta. This research was completed while Yavuz Giinalay was a doctoral student at McMaster University.
Copyright:
Copyright 2017 Elsevier B.V., All rights reserved.
UN SDGs
This output contributes to the following UN Sustainable Development Goals (SDGs)
-
SDG 9 Industry, Innovation, and Infrastructure
Fingerprint
Dive into the research topics of 'Polling systems with a patient server and state-dependent setup times'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS