Finite buffer polling models with routing

European Journal of Operational Research

Volumn 165, Issue 3, 2005, Pages 794-809

  Grasman, Scott E ^a   Olsen, Tava Lennon ^b   Birge, John R ^c  

^a University of Missouri Rolla   (United States)

^b WASHINGTON UNIVERSITY IN ST LOUIS   (United States)

^c Northwestern University   (United States)

Author keywords

Polling; Queueing; Routing; Setups

Indexed keywords

INVENTORY CONTROL; MATHEMATICAL MODELS; MATHEMATICAL TRANSFORMATIONS; POISSON EQUATION; PROBABILITY; PRODUCTION CONTROL; SERVERS; SYSTEMS ANALYSIS;

POLLING MODEL; QUEUING; ROUTING; SETUPS;

BUFFER STORAGE;

EID: 13444291285     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2003.11.030     Document Type: Article

References (17)

1. Cooper R.B. Queues served in cyclic order: Waiting times. The Bell System Technical Journal. 49(3):1970;399-413
2. Cooper R.B., Murray G. Queues served in cyclic order. The Bell System Technical Journal. 48(3):1969;675-689
3. Federgruen A., Katalan Z. Determining production schedules under basestock policies in single facility multi-item production systems. Operations Research. 46(6):1998;883-898
4. S.E. Grasman, Production strategies for random yield processes, Ph.D. dissertation. University of Michigan, 2000
5. S.E. Grasman, T.L. Olsen, J.R. Birge, Setting basestock levels in multiproduct systems with setups and random yield, Working Paper
6. Jung W.Y., Un C.K. Analysis of finite-buffer polling system with exhaustive service based on virtual buffering. IEEE Transactions on Communications. 42(12):1994;3144-3149
7. Lee T.T. M/G/1/N queue with vacation time and exhaustive service discipline. Operations Research. 32(4):1984;774-784
8. Levy H., Sidi M. Polling models: Applications, modeling and optimization. IEEE Transactions on Communications. 38:1991;1750-1760
9. O. Schenk, K. Gartner, Solving unsymmetric sparse systems of linear equations with PARDISO, Computational Science - ICCS 2002, Part II, Proceedings Lecture Notes in Computer Science, vol. 2330, 2002, pp. 355-363
10. Sidi M., Levy H., Fuhrmann S.W. A queueing network with a single cyclically roving server. Queueing Systems. 11:1992;121-144
11. Olsen T.L. A practical scheduling method for multi-class production systems with setups. Management Science. 45(1):1999;116-130
12. Ross S.M. Stochastic Processes. second ed.:1996;Wiley Press, New York
13. Takagi H. Analysis of Polling Systems. 1986;MIT Press, Cambridge, MA
14. Takagi H. Queueing analysis of polling models: An update. Takagi H. Stochastic Analysis of Computer and Communication Systems. 1990;267-318 Elsevier Science Publishers, Amsterdam
15. Takagi H. Applications of polling models to computer networks. Computer Networks and ISDN Systems. 22:1991;193-211
16. Takagi H. Analysis of finite capacity polling systems. Advanced Applied Probability. 23:1991;373-387
17. H. Takagi, Queueing analysis of polling models: Progress in 1990-1994, in: Frontiers In Queueing: Models and Applications in Science and Engineering, Chapter 5, CRC Press, New York, 1997