An Optimal Design Problem for Limited Processor Sharing Systems

Genji Yamazaki and Hirotaka Sakasegawa
Additional contact information
Genji Yamazaki: Tokyo Metropolitan Institute of Technology, Tokyo 191, Japan
Hirotaka Sakasegawa: Institute of Socio-Economic Planning, University of Tsukuba, Ibaraki 305, Japan

Management Science, 1987, vol. 33, issue 8, 1010-1019

Abstract: An optimal design problem is considered for processor-sharing service systems, where the number of customers served simultaneously is limited to a fixed finite number (called multiplicity). The decision variable is the multiplicity and the optimal criterion is to minimize the mean number of customers in the system, or, alternatively, to minimize the mean sojourn time for a customer. It is proved that the processor-sharing discipline with any multiplicity ameliorates the system performance if a service-requirement distribution is an NWU (new worse than used) type and deteriorates the performance if the distribution type is Erlangian. Moreover, it is conjectured through numerical results that the limited processor-sharing system will ameliorate (deteriorate) the performance if the coefficient of variation of the service-requirement distribution is larger (smaller) than 1.

Keywords: queue; queue discipline; processor-sharing; optimality; NBU; NWU; optimization (search for similar items in EconPapers)
Date: 1987
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.33.8.1010 (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:ormnsc:v:33:y:1987:i:8:p:1010-1019

Access Statistics for this article

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