Gordon, W.J. and Newell, G. F. 1967. Closed Queueing Networks with Exponential Servers. Operations Research, 15, 252-267. 46 Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
The QNET Method for Two-Moment Analysis of Closed Manufacturing.. - Dai (1993) (2 citations) (Correct)
....throughput time from average jobcount estimates. 10 Closed Network Models of the Generalized Jackson Type To clarify the relationship between the QNET method and previous work in queueing theory, let us consider a simple model of the type introduced by Jackson [26] and by Gordon and Newell [14] in their original treatment of closed networks. In their model one has a single job class served at each station (thus K = J) and jobs change station in Markovian fashion. That is, we are given a J Theta J stochastic matrix P = P ij ) and a job completing service at station i goes ....
Gordon, W. J. and Newell, G. F. Closed queueing networks with exponential servers. Operations Research 15, 244--265 (1967).
Traffic Relationships in Networks of Tasks - Woodside, Yee (1989) (Correct)
....1 INTRODUCTION 3 to two party connections only, and often only have unidirectional producer consumer relationships between the user tasks. The traffic relationships presented below are an extension of similar relationships in classical queuing networks (e.g. Jackson [4] Gordon and Newell [5]) and computer and communications performance models (e.g. Sauer and Chandy [6] However, task messages do not represent customers in a queuing network because messages are not conserved; a message arriving at a task may stimulate zero, one, or several further messages. In this aspect, messages ....
Gordon, W.J.; Newell, G.F.; "Closed Queueing Networks with Exponential Servers", Operations Research 15, pp. 244-265, 1967.
Stochastic Convexity and Stochastic Majorization - Cheng-Shang Chang Ibm (1994) (1 citation) (Correct)
No context found.
Gordon, W.J. and Newell, G. F. 1967. Closed Queueing Networks with Exponential Servers. Operations Research, 15, 252-267. 46
Cyclic Queueing Networks with Subexponential Service Times - Ayhan, Palmowski, Schlegel (2002) (Correct)
No context found.
Gordon, W.J. and Newell, G.F. (1967) "Closed queueing networks with exponential servers," Operations Research, 15, 252--267. 27
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC