Approximating the Mean Time in System in a Multiple-Server Queue that Uses Threshold Scheduling

Randolph Nelson and Don Towsley
Additional contact information
Randolph Nelson: IBM Corporation, Yorktown Heights, New York
Don Towsley: University of Massachusetts, Amherst, Massachusetts

Operations Research, 1987, vol. 35, issue 3, 419-427

Abstract: In this paper we consider a queueing system consisting of a single queue with multiple exponential servers with different servicing rates. We assume that arrivals to the queue come from a Poisson source and are scheduled according to a threshold policy. Since determining the exact mean time in system appears to be difficult, we present an approximation that yields results very close to those obtained from simulation.

Keywords: 684 mean time in system; 696 threshold scheduling (search for similar items in EconPapers)
Date: 1987
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.35.3.419 (application/pdf)

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:inm:oropre:v:35:y:1987:i:3:p:419-427

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().