Ordered Entry Queueing Networks with Multiple Servers and Multiple Queues

Phillips, Donald T.; Skeith, Ronald W.

doi:10.1080/05695556908974717

“…It seems that the characterization of a conveyor as a queueing model is a good way for analytical discussion of the problem. Among authors using this characterization we see those of [5][6][7][8]10,11,16,22,23], for example.…”

Section: Introductionmentioning

confidence: 97%

A parallel priority queueing system with finite buffers

Haghighi

¹

,

Mishev

²

2006

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

“…Pritsker [7], Phillips and Skeith [6] and Proctor et al [8]. In these studies it was found that the traffic handled (i.e.…”

Section: Introductionmentioning

confidence: 99%

“…The problem considered is of interest for the analysis of so-called closed-loop circulating conveyors in which the 'ordered entry rule' is induced by the geometrical configuration of the system, see e.g. Pritsker [7], Phillips and Skeith [6] and Proctor et al [8]. In these studies it was found that the traffic handled (i.e.…”

Section: Introductionmentioning

confidence: 99%

A note on many-server queueing systems with ordered entry, with an application to conveyor theory

Nawijn

¹

1983

Journal of Applied Probability

View full text Add to dashboard Cite

Consider a many-server queueing system in which the servers are numbered. If a customer arrives when two or more servers are idle he selects the server with lowest index (this is called the ordered entry selection rule). An explicit expression for the traffic handled by the various servers in a GI/M/s queueing system with ordered entry is derived. For the M/M/s queueing system the probability distribution of the number of busy servers among the first k(k = 1,2, ---, s) servers will be given. Finally, a formula for the traffic handled by the first server in an MID/s system will be derived. All results are derived under steady-state conditions. As an application some numerical data for the server utilizations will be given and compared to data obtained from simulation studies of a closed-loop continuous belt-conveyor.

show abstract

“…The problem considered is of interest for the analysis of so-called closed-loop circulating conveyors in which the 'ordered entry rule' is induced by the geometrical configuration of the system, see e.g. Pritsker [7], Phillips and Skeith [6] and Proctor et al [8]. In these studies it was found that the traffic handled (i.e.…”

Section: Introductionmentioning

confidence: 99%

A note on many-server queueing systems with ordered entry, with an application to conveyor theory

Nawijn

¹

1983

View full text Add to dashboard Cite

Consider a many-server queueing system in which the servers are numbered. If a customer arrives when two or more servers are idle he selects the server with lowest index (this is called the ordered entry selection rule). An explicit expression for the traffic handled by the various servers in a GI/M/s queueing system with ordered entry is derived. For the M/M/s queueing system the probability distribution of the number of busy servers among the first k(k = 1,2, ---, s) servers will be given. Finally, a formula for the traffic handled by the first server in an MID/s system will be derived. All results are derived under steady-state conditions. As an application some numerical data for the server utilizations will be given and compared to data obtained from simulation studies of a closed-loop continuous belt-conveyor.

show abstract

Ordered Entry Queueing Networks with Multiple Servers and Multiple Queues

Cited by 17 publications

References 1 publication

A parallel priority queueing system with finite buffers

A parallel priority queueing system with finite buffers

A note on many-server queueing systems with ordered entry, with an application to conveyor theory

A note on many-server queueing systems with ordered entry, with an application to conveyor theory

Contact Info

Product

Resources

About