Dynamic visit-order rules for batch-service polling

Probability in the Engineering and Informational Sciences

Volumn 17, Issue 3, 2003, Pages 351-367

  Van Der Wal, Jan ^a   Yechiali, Uri ^b  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; HAMILTONIANS; NP-HARD; OPTIMIZATION;

ASSIGNMENT PROBLEMS; DYNAMIC CONTROLS; EXPECTED LENGTH; HAMILTONIAN TOUR; NONHOMOGENEOUS SYSTEMS; OPTIMAL POLICIES; ORDER POLICIES; PERFORMANCE MEASURE;

JOB SHOP SCHEDULING;

EID: 0042242802     PISSN: 02699648     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0269964803173044     Document Type: Article

References (22)

1. Ahuja, R.K., Magnanati, T.L., &Orlin, J.B. (1993). Network flows, theory, algorithms and applications. Englewood Cliffs, NJ: Prentice-Hall.
2. Altman, E. &Yechiali, U. (1994). Polling in a closed network. Probability in the Engineering and Informational Sciences 8(3): 327-343.
3. Ammar, M.H. &Wong, J.W. (1987). On the optimally of cyclic transmission in teletext systems. IEEE Transactions on Communications 35(1): 68-73.
4. Armony, R. &Yechiali, U. (1999). Polling systems with permanent and transient customers. Stochastic Models 15(3): 395-427.
5. Boxma, O.J. (1991). Analysis and optimization of polling systems. In J.W. Cohen &C.D. Pack (eds.), Queueing, performance and control in ATM. Amsterdam: North-Holland, pp. 173-183.
6. Boxma, O., Levy, H., &Yechiali, U. (1991). Cyclic reservation schemes for efficient operation of multiple-queue single-server systems. Annals of Operations Research 36: 187-208.
7. Browne, S. &Yechiali, U. (1989). Dynamic priority rules for cyclic-type queues. Advances in Applied Probability 21:432-450.
8. Dror, H. &Yechiali, U. (2000). Closed polling models with failing nodes. Queueing Systems 35: 55-81.
9. Dykeman, H.D., Ammar, M.H., &Wong, J.W. (1986). Scheduling algorithms for videodex systems under broadcast delivery. In Proceedings of the International Conference on Communications (ICC'86), pp. 1847-1851.
10. Garey, M.R. &Johnson, D.S. (1979). Computers and intractability: A guide to the theory of NP-completeness. New York: W.H. Freeman.
11. Grillo, D. (1990). Polling mechanism models in communications systems - Some applications and examples. In H. Takagi (ed.), Stochastic analysis of computer and communication systems. Amsterdam: North-Holland, pp. 659-698.
12. Levy, H. &Sidi, M, (1990). Polling systems: Applications, modeling, and optimization. IEEE Transactions on Communications 38: 1750-1760.
13. Liu, Z. &Nain, P. (1992). Optimal scheduling in some multiqueue single-server systems. IEEE Transactions on Automatic Control 37(2): 247-252.
14. Potts, C.N. &Kovalyov, M.Y. (2000). Scheduling with batching: A review. European Journal of Operational Research 120: 228-249.
15. Takagi, H. (1986). Analysis of polling systems. Cambridge, MA: MIT Press.
16. Takagi, H. (1990). Queueing analysis of polling systems: An update. In H. Takagi (ed.), Stochastic analysis of computer and communication systems. Amsterdam: North-Holland, pp. 267-318.
17. Takagi, H. (1991). Application of polling models to computer networks. Computer Networks and ISDN Systems 22: 193-211.
18. Takagi, H. (1997). Queueing analysis of polling models: Progress in 1990-1994. In J.H. Dshalalow (ed.), Frontiers in queueing: Models and applications in science and engineering. Boca Raton, FL: CRC Press, pp. 119-146.
19. Takagi, H, (1998). Queueing analysis of polling models. ACM Computing Surveys 20: 5-28.
20. Van Oyen, M.P. &Teneketzis, D. (1996). Optimal batch service of a polling system under partial information. Method and Models in OR 44(3): 401-419.
21. Xia, C.H., Michailidis, G., Bambos, N., &Glynn, P.W. (2002). Optimal control of parallel queues with batch service. Probability in the Engineering and Informational Sciences 16(3): 289-307.
22. Yechiali, U. (1993). Analysis and control of polling systems. In L. Donatielo &R. Nelson (eds.), Performance evaluation of computer and communication systems. New York: Springer-Verlag, pp. 630-650.