Advances in modelling of complex systems : preface to the special issue

 Access to full text

 Full (PDF)

1. [1] Jackson J.R., Networks of waiting lines. Oper. Res. 15 (1957) 234-265. MR93061
2. [2] Jackson J.R., Jobshop-like queueing systems. Manage. Sci. 10 (1963) 131142. 
3. [3] Buzen J.P., Queueing Network Models of Multiprogramming. Ph.D. Thesis, Harvard University, Cambridge, Mass. (1972). 
4. [4] Baskett F., Chandy K.M., Muntz R.R. and Palacios F.G., Open, closed and mixed networks of queues with different classes of customers. J. ACM 22 (1975) 248-260. Zbl0313.68055MR365749
5. [5] Kelly F.P., Reversibility and Stochastic Networks. Chichester, Wiley (1979). Zbl0422.60001MR554920
6. [6] Gelenbe E. and Iasnogorodski R., A queue with server of walking type. Annales de l’Institut Henri Poincaré, Série B (Probabilités et Statistiques) XVI (1980) 63-73. Zbl0433.60086
7. [7] Gelenbe E., Réseaux stochastiques ouverts avec clients négatifs et positifs, et réseaux neuronaux. C. R. Acad. Sci. Paris II 309 (1989) 979-982. MR1029869
8. [8] Gelenbe E., Queuing networks with negative and positive customers. J. App. Prob.28 (1991) 656-663. Zbl0741.60091MR1123837
9. [9] Gelenbe E., G-networks with instantaneous customer movement. J. App. Prob. 30 (1993) 742-748. Zbl0781.60088MR1232750
10. [10] Gelenbe E., G-Networks with signals and batch removal. Prob. Eng. Inf. Sci. 7 (1993) 335-342. 
11. [11] Kouvatsos D.D., Entropy maximisation and queuing networks model. Ann. Oper. Res. 48 (1994) 63-126. Zbl0789.90032
12. [12] Gelenbe E. and Fourneau J.-M., G-Networks with resets. Perform. Eval. 49 (2002) 179-192. Zbl1043.68006