Networks of queues with service anticipating routing

@article{Dijk1988NetworksOQ,
  title={Networks of queues with service anticipating routing},
  author={Nico M. van Dijk and Michael Peter Rumsewicz},
  journal={Serie Research Memoranda},
  year={1988}
}
Queueing networks are studied with general service requirements and routing depending upon the next required service time. A non-standard product form expression is obtained that averages out dependencies of routing and service times. 

Topics from this paper

A Tandem Queuewith a Movable Server: An Eigenvalue Approach
TLDR
This paper analyzes a two station tandem queue with Poisson arrivals and exponential service times, and it is shown that this method is substantially faster than matrix analytic methods. Expand
The effectiveness of the international coffee agreement : a simulation study using a quarterly model of the world coffee market
We present the results of a simulation analysis of a quarterly econometrie model for the world coffee market. The model has originally been developed by Palm and Vogelvang (1986). The main featuresExpand

References

SHOWING 1-10 OF 14 REFERENCES
Introduction to queueing networks
TLDR
A comparison of G-Networks with Multiple Classes of Signals and Positive Customers and Discrete-Time Queueing Systems shows how different approaches to queue management can produce different results. Expand
Networks of Waiting Lines
One of the least understood classes of operations problems is that concerned with the design, loading, and, especially, the scheduling of discrete, statistically varying flows through complexExpand
Product forms for queueing networks with limited clusters
TLDR
A general characterization is given, in terms of local solutions of state dependent traffic equations, from which the existence and structure of a product form can be concluded, which leads to new product form examples such as with a weak reversible cluster routing or a non-reversible routing both within and in between limited station clusters. Expand
INSENSITIVITY WITH AGE-DEPENDENT ROUTING
The theory of insensitivity is extended to include processes where some of the routing probabilities of the process are made dependent upon the length of time the generally distributed variables haveExpand
On queueing network models of flexible manufacturing systems
TLDR
The state-of-the-art in studying flexible manufacturing systems (FMSs) using analytical queueing network models, including Jackson networks, reversible networks and approximate models of non-product-form networks are outlined. Expand
Product Form and Local Balance in Queueing Networks
A new property of queueing discipline, station balance, seems to explain why some disciplines yield product form solutions for queues and networks using nonexponential service disciplines and otherExpand
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
TLDR
Many of the network results of Jackson on arrival and service rate dependencies, of Posner and Bernholtz on different classes of customers, and of Chandy on different types of service centers are combined and extended in this paper. Expand
Insensitivity in queueing systems
It is well known that the stationary distribution of the number of busy servers in the Erlang blocking system (MIG/cIc) depends on the service-time distribution only through its mean. ThisExpand
Convergence of Probability Measures
Convergence of Probability Measures. By P. Billingsley. Chichester, Sussex, Wiley, 1968. xii, 253 p. 9 1/4“. 117s.
Weak convergence for generalized semi-Markov processes
Generalized semi-Markov schemes were introduced by Matthes in 1962 under the designation 'Bedienungsschemata' (service schemes). They include a large variety of familiar stochastic models. It isExpand
...
1
2
...