Realizable Performance Vectors of a Finite-Source Queue

Hisao Kameda
Additional contact information
Hisao Kameda: The University of Electro-Communications, Chofu, Tokyo, Japan

Operations Research, 1984, vol. 32, issue 6, 1358-1367

Abstract: We study a scheduling problem on a finite-source queueing model which is identical to a two-stage closed Markovian cyclic queue consisting of a single-server (“processor”) and an infinite-server (“terminals”); each job has a distinct mean service time at the processor. We obtain a necessary and sufficient condition for a performance vector consisting of utilization factors (or average response times) of the processor for the jobs to be achievable by some scheduling strategy. The result is analogous to that obtained by Coffman and Mitrani on infinite-source single-server queues.

Keywords: 689 cyclic queue of a single-server and an infinite-server; 698 scheduling; preemptive/nonpreemptive priorities; 705 scheduling of a Markovian finite-source queue (search for similar items in EconPapers)
Date: 1984
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.32.6.1358 (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:32:y:1984:i:6:p:1358-1367

Access Statistics for this article

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