Blocking, reordering, and the throughput of a series of servers

F. P. Kelly

Stochastic Processes and their Applications, 1984, vol. 17, issue 2, 327-336

Abstract: A sequence of jobs is to be processed by a series of servers. The lengths of successive jobs are independent random variables, and the service time of a given job is the same at each server and equal to the job's length. There is no storage space available between servers, and so blockages may arise. This paper investigates the effect of reordering the sequence of jobs on the throughput of the system.

Keywords: series; of; queues; job; shop; communication; network; extreme; values (search for similar items in EconPapers)
Date: 1984
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0304-4149(84)90008-5
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:spapps:v:17:y:1984:i:2:p:327-336

Ordering information: This journal article can be ordered from
http://http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Stochastic Processes and their Applications is currently edited by T. Mikosch

More articles in Stochastic Processes and their Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().