When does forced idle time improve performance in polling models?

Management Science

Volumn 44, Issue 8, 1998, Pages 1079-1086

  Cooper, Robert B ^a   Niu, Shun Chen ^a   Srinivasan, Mandyam M ^a  

^a NONE

Author keywords

Cyclic Production Systems; Decomposition; Polling Models; Setup Times; Switchover Times; Vacation Models; Variance Paradox; Waiting Times

Indexed keywords

MATHEMATICAL MODELS; PROCESS CONTROL; QUEUEING THEORY; STATISTICAL METHODS;

CYCLIC PRODUCTION SYSTEMS; POLLING MODELS; VACATION MODELS;

PRODUCTION CONTROL;

EID: 0032138578     PISSN: 00251909     EISSN: None     Source Type: Journal    
DOI: 10.1287/mnsc.44.8.1079     Document Type: Article

References (34)

1. Boxma, O. J., W. P. Groenendijk 1987. Pseudo-Conservation Laws in Cyclic-Service Systems. J. of Applied Probability 24 4 949-964.
2. Cooper, R. B., S.-C. Niu, M. M. Srinivasan 1996. A Decomposition Theorem for Polling Models: The Switchover Times are Effectively Additive. Oper. Res. 44 4 629-633.
3. Duenyas, I. 1994. The Limitations of Sub-Optimal Policies. Interfaces 24 5 77-84.
4. _, M. P. Van Oyen 1994. Can Setup Reduction Result in Worse Performance? Working paper.
5. _, _ 1996. Heuristic Scheduling of Parallel Heterogeneous Queues with Set-ups. Management Sci. 42 814-829.
6. Federgruen, A., Z. Katalan 1996a. The Impact of Setup Times on the Performance of Multi-Class Service and Production Systems. Oper. Res. 44 6 989-1001.
7. _, _ 1996b. The Stochastic Economic Lot Scheduling Problem: Cyclical Base-Stock Policies with Idle Times. Management Sci. 42 6 783-796.
8. Ferguson, M. J., Y. J. Aminetzah 1985. Exact Results for Nonsymmetric Token Ring Systems. IEEE Trans. on Communications COM-33 223-231.
9. Fuhrmann, S. W. 1981. Performance Analysis of a Class of Cyclic Schedules. Technical Report, AT&T Bell Laboratories.
10. _ 1985. Symmetric Queues Served in Cyclic Order. Oper. Res. Letters 4 3 139-144.
11. _ 1992. A Decomposition Result for a Class of Polling Models. Queueing Systems 11 109-120.
12. _, R. B. Cooper 1985. Stochastic Decompositions in the M/G/1 Queue with Generalized Vacations. Oper. Res.. 33 5 1117-1129.
13. Gerchak, Y., Z. Zhang 1994. The Cheaper/Faster-Yet-More-Expensive Phenomenon: Are Zangwill's 'Paradoxes' Indeed Paradoxical? Interfaces 24 5 84-87.
14. Gupta, D., M. M. Srinivasan 1996a. The Variance Paradox and Its Implications for Japanese Production Theory. Interfaces 26 4 69-77.
15. _, _ 1996b. Polling Systems with State-Dependent Setup Times. Queueing Systems 22 403-423.
16. Hashida, O. 1972. Analysis of Multiqueue. Rev. Electrical Communication Laboratories, Nippon Telephone and Telegraph Public Corporation. 20 189-199.
17. Kleinrock, L. 1976. Queueing Systems, Volume 2: Computer Applications. John Wiley & Sons, New York.
18. Konheim, A. G., H. Levy, M. M. Srinivasan 1994. Descendant Set: An Efficient Approach for the Analysis of Polling Systems. IEEE Trans. on Communications 42 1245-1253.
19. Kuehn, P. J. 1979. Multiqueue Systems with Nonexhaustive Cyclic Service. Bell System Technical J. 58 671-698.
20. Levy, H. 1989. Analysis of Cyclic-Polling Systems with Binomial-Gated Service. Performance of Distributed ana Parallel Systems, Elsevier Science Publishers B. V., North-Holland, Amsterdam, 127-139.
21. McIntyre, B. 1994. A Comment on Zangwill's 'The Limits of Japanese Production Theory.' Interfaces 24 5 87-89.
22. Olsen, T. 1996a. Asymptotics for Polling Models with Increasing Setups. Working Paper.
23. _ 1996b. Approximations for the Waiting Time Distribution in Polling Models With and Without State-Dependent Setups. Working Paper.
24. Righter, R., J. G. Shanthikumar 1995. Multi-Class Production Systems with Setup Times. Working Paper.
25. Samaddar, S. and T. Kaul 1995. Effects of Setup and Processing Time Reductions on WIP in the JIT Production Systems. Management Sci. 41 7 1263-1265.
26. Sarkar, D., W. I. Zangwill 1989. Expected Waiting Time for Nonsymmetric Cyclic Queueing Systems - Exact Results and Applications. Management Sci. 35 12 1463-1474.
27. _, _ April 1991. Variance Effects in Cyclic Production Systems. Management Sci. 37 4 443-453.
28. Srinivasan, M. M., D. Gupta 1996. When Should a Roving Server Be Patient? Management Sci. 42 3 437-451.
29. _, S.-C. Niu, R. B. Cooper 1995. Relating Polling Models with Zero and Nonzero Switchover Times. Queueing Systems 19 149-168.
30. Takagi, H. 1986. Analysis of Polling Systems. MIT Press, Cambridge, MA.
31. Van Oyen, M. P. 1997. Monotonicity of Optimal Performance Measures for Polling Systems. Probability in the Engineering and Informational Sciences 11 219-228.
32. Watson, K. S. 1984. Performance Evaluation of Cyclic Service Strategies - A Survey. Performance '84, Elsevier Publishers, New York.
33. Zangwill, W. I. 1992. The Limits of Japanese Production Theory. Interfaces 22 5 14-25.
34. _, D. Sarkar 1994. Response to Comments on Our Work by Duenyas, by Gerchak and Zhang, and by McIntyre. Interfaces 24 5 90-94.