When Does Forced Idle Time Improve Performance in Polling Models?

References

• Boxma O. J., Groenendijk W. P. Pseudo-conservation laws in cyclic-service systems. J. Appl. Probab. (1987) 24(4):949–964Crossref, Google Scholar
• Cooper R. B., Niu S.-C., Srinivasan M. M. A decomposition theorem for polling models: The switchover times are effectively additive. Oper. Res. (1996) 44(4):629–633Link, Google Scholar
• Duenyas I. The limitations of sub-optimal policies. Interfaces (1994) 24(5):77–84Link, Google Scholar
• Duenyas I., Van Oyen M. P. Can setup reduction result in worse performance? Working paper. (1994) Google Scholar
• Duenyas I., Van Oyen M. P. Heuristic scheduling of parallel heterogeneous queues with set-ups. Management Sci. (1996) 42:814–829Link, Google Scholar
• Federgruen A., Katalan Z. The impact of setup times on the performance of multi-class service and production systems. Oper. Res. (1996a) 44(6):989–1001Link, Google Scholar
• Federgruen A., Katalan Z. The stochastic economic lot scheduling problem: Cyclical base-stock policies with idle times. Management Sci. (1996b) 42(6):783–796Link, Google Scholar
• Ferguson M. J., Aminetzah Y. J. Exact results for nonsymmetric token ring systems. IEEE Trans. on Comm. (1985) COM-33:223–231Crossref, Google Scholar
• Fuhrmann S. W. Performance analysis of a class of cyclic schedules. (1981) . Technical report, T&T Bell LaboratoriesGoogle Scholar
• Fuhrmann S. W. Symmetric queues served in cyclic order. Oper. Res. Lett. (1985) 4(3):139–144Crossref, Google Scholar
• Fuhrmann S. W. A decomposition result for a class of polling models. Queueing Systems (1992) 11:109–120Crossref, Google Scholar
• Fuhrmann S. W., Cooper R. B. Stochastic decompositions in the M/G/1 queue with generalized vacations. Oper. Res. (1985) 33(5):1117–1129Link, Google Scholar
• Gerchak Y., Zhang Z. The cheaper/faster-yet-more-expensive phenomenon: Are Zangwill's “paradoxes” indeed paradoxical? Interfaces (1994) 24(5):84–87Google Scholar
• Gupta D., Srinivasan M. M. The variance paradox and its implications for Japanese production theory. Interfaces (1996a) 26(4):69–77Link, Google Scholar
• Gupta D., Srinivasan M. M. Polling systems with state-dependent setup times. Queueing Systems (1996b) 22:403–423Crossref, Google Scholar
• Hashida O. Analysis of multiqueue. Rev. Electrical Communication Laboratories (1972) 20:189–199Nippon Telephone and Telegraph Public CorporationGoogle Scholar
• Kleinrock L.Queueing Systems, volume 2: Computer Applications (1976) (John Wiley & Sons, New York) Google Scholar
• Konheim A. G., Levy H., Srinivasan M. M. Descendant set: An efficient approach for the analysis of polling systems. IEEE Trans. on Comm. (1994) 42:1245–1253Crossref, Google Scholar
• Kuehn P. J. Multiqueue systems with nonexhaustive cyclic service. Bell System Tech. J. (1979) 58:671–698Crossref, Google Scholar
• Levy H. Analysis of cyclic-polling systems with binomial-gated service. Performance of Distributed and Parallel Systems (1989) (Elsevier Science Publishers B. V., North-Holland, Amsterdam) 127–1391979Google Scholar
• McIntyre B. A comment on Zangwill's “The limits of Japanese production theory.”. Interfaces (1994) 24(5):87–89Google Scholar
• Olsen T. Asymptotics for polling models with increasing setups. (1996a) . Working paperGoogle Scholar
• Olsen T. Approximations for the waiting time distribution in polling models with and without state-dependent setups. (1996b) . Working paperGoogle Scholar
• Righter R., Shanthikumar J. G. Multi-class production systems with setup times. (1995) . Working paperGoogle Scholar
• Samaddar S., Kaul T. Effects of setup and processing time reductions on WIP in the JIT production systems. Management Sci. (1995) 41(7):1263–1265Link, Google Scholar
• Sarkar D., Zangwill W. I. Expected waiting time for nonsymmetric cyclic queueing systems—Exact results and applications. Management Sci. (1989) 35(12):1463–1474Link, Google Scholar
• Sarkar D., Zangwill W. I. Variance effects in cyclic production systems. Management Sci. (1991) 37(4, April):443–453Google Scholar
• Srinivasan M. M., Gupta D. When should a roving server be patient? Management Sci. (1996) 42(3):437–451Link, Google Scholar
• Srinivasan M. M., Niu S.-C., Cooper R. B. Relating polling models with zero and nonzero switchover times. Queueing Systems (1995) 19:149–168Crossref, Google Scholar
• Takagi H.Analysis of Polling Systems (1986) (MIT Press, Cambridge MA) Google Scholar
• Van Oyen M. P. Monotonicity of optimal performance measures for polling systems. Probab. in Engrg. and Informational Sci. (1997) 11:219–228Crossref, Google Scholar
• Watson K. S. Performance evaluation of cyclic service strategies—A survey. Performance (1984) (Elsevier Publishers, New York) . '84Google Scholar
• Zangwill W. I. The limits of Japanese production theory. Interfaces (1992) 22(5):14–25Link, Google Scholar
• Zangwill W. I., Sarkar D. Response to comments on our work by Duenyas, by Gerchak and Zhang, and by McIntyre. Interfaces (1994) 24(5):90–94Google Scholar