Hostname: page-component-76fb5796d-25wd4 Total loading time: 0 Render date: 2024-04-28T12:54:33.558Z Has data issue: false hasContentIssue false
  • English
  • Français

A TWO-NODE JACKSON NETWORK WITH INFINITE SUPPLY OF WORK

Published online by Cambridge University Press:  23 March 2005

Ivo Adan  and
Gideon Weiss
Ivo Adan
Affiliation:
Department of Mathematics and Computer Science, Eindhoven University of Technology, 5600 MB Eindhoven, The Netherlands, E-mail: iadan@win.tue.nl
Gideon Weiss
Affiliation:
Department of Statistics, The University of Haifa, Mount Carmel 31905, Israel, E-mail: gweiss@stat.haifa.ac.il
Get access Rights & Permissions [Opens in a new window]

Abstract

We consider a Jackson network with two nodes, with no exogenous input, but instead an infinite supply of work at each of the nodes: Whenever a node is empty, it processes a job from this infinite supply. We obtain an explicit expression for the steady state distribution of this system, as an infinite sum of product forms.

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 19 , Issue 2 , April 2005 , pp. 191 - 212
Copyright
© 2005 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

Adan, I.J.B.F. & Weiss, G. (2003). Analysis of a simple Markovian re-entrant line with infinite supply of work under the LBFS policy. Preprint.
Adan, I.J.B.F., Wessels, J., & Zijm, W.H.M. (1993). A compensation approach for two-dimensional Markov processes. Advances in Applied Probability 25: 783–817.Google Scholar
Boxma, O.J. & van Houtum, G.J. (1993). The compensation approach applied to a 2 × 2 switch. Probability in the Engineering and Informational Sciences 7: 471–493.Google Scholar
Foster, F.G. (1953). On the stochastic matrices associated with certain queueing processes. Annals of Mathematical Statistics 24: 355–360.Google Scholar
Goodman, J.B. & Massey, W.A. (1984). The non-ergodic Jackson network. Journal of Applied Probability 21: 860–869.Google Scholar
Jackson, J.R. (1963). Jobshop-like queueing systems. Management Science 10: 131–142.Google Scholar
Kelly, F.P. (1979). Reversibility and stochastic networks. New York: Wiley.
Kopzon, A. & Weiss, G. (2002). A push pull queueing system. Operations Research Letters 30: 351–359.Google Scholar
Kopzon, A. & Weiss, G. (2003). A preemptive push pull queueing system. Preprint.
Levy, Y. & Yechiali, U. (1975). Utilization of idle time in an M/G/1 queueing system. Management Science 22: 202–211.Google Scholar
van Houtum, G.J. (1994). New approaches for multi-dimensional queueing systems. Ph.D. thesis, Eindhoven University of Technology, The Netherlands.
Weiss, G. (1999). Scheduling and control of manufacturing systems—A fluid approach. In Proceedings of the 37 Allerton Conference, pp. 577–586.
Weiss, G. (2004). Stability of a simple re-entrant line with infinite supply of work—The case of exponential processing times. Journal of Operations Research Society of Japan 47(4): 304–313.Google Scholar
Weiss, G. (2003). Jackson networks with unlimited supply of work and full utilization. Preprint.