A constrained optimization problem for a processor sharing queue

Peter De Waal

Naval Research Logistics (NRL), 1993, vol. 40, issue 5, 719-731

Abstract: In this article we discuss a processor sharing queueing model for a stored program controlled telephone exchange. The model incorporates the effects of both call requests and operator tasks on the load of the processor. Newly arriving call requests and operator tasks can either be admitted or rejected and for this decision the state of the queue at the moment of arrival is available as information. To guarantee a high level of service, we formulate a constrained optimization problem. Two types of access control, viz., partitioning policies and sharing policies, are considered. The optimization problem is solved for partitioning policies and the performance of both types of policies is compared. © 1993 John Wiley & Sons, Inc.

Date: 1993
References: View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
https://doi.org/10.1002/1520-6750(199308)40:53.0.CO;2-C

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:wly:navres:v:40:y:1993:i:5:p:719-731

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().