An Optimal Design Problem for Limited Processor Sharing Systems

1987/08/01 by Genji Yamazaki, Hirotaka Sakasegawa · 3 citations
Business, Management and Accounting · Computer Science · Decision Sciences · #Advanced Queuing Theory Analysis #Optimization and Search Problems #Probability and Risk Models

paper · doi:10.1287/mnsc.33.8.1010

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.

Cited by

• Early Task Initiation and Other Load-Adaptive Mechanisms in the Emergency Department
• Modeling a Phone Center: Analysis of a Multichannel, Multiresource Processor Shared Loss System
• The operational effectiveness of a full capacity protocol to ease crowding at an emergency department

Related

• Approximations and Optimal Control for State-dependent Limited Processor Sharing Queues
• A Fluid Limit for Processor-Sharing Queues Weighted by Functions of Remaining Amounts of Service
• Stability of a processor sharing queue with varying throughput
• Queueing Systems with Some Versions of Limited Processor Sharing Discipline
• Comparison of the Discriminatory Processor Sharing Policies