𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A constrained optimization problem for a processor sharing queue

✍ Scribed by Peter De Waal

Publisher
John Wiley and Sons
Year
1993
Tongue
English
Weight
765 KB
Volume
40
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

✦ Synopsis

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.

πŸ“œ SIMILAR VOLUMES

A canonical structure for constrained op
A canonical structure for constrained optimal control problems
✍ Jie Chen; Guoxiang Gu; Carl N. Nett; Dapeng Xiong πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 900 KB

We consider a general class of optimal control problems with regional pole and controller structure constraints. Our goal is to show that for a fairly general class of regional pole and controller structure constraints, such constrained optimal control problems can be transformed to a new one with a

Optimality Conditions and Duality Models
Optimality Conditions and Duality Models for a Class of Nonsmooth Constrained Fractional Optimal Control Problems
✍ G.J. Zalmai πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 392 KB

Both parametric and nonparametric necessary and sufficient optimality conditions are established for a class of nonsmooth constrained optimal control problems with fractional objective functions and linear dynamics. Moreover, using the forms and contents of these optimality principles, four parametr

A polynomial algorithm for a constrained
A polynomial algorithm for a constrained traveling salesman problem
✍ J.H. Rubinstein; D.A. Thomas; N.C. Wormald πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 125 KB

## Abstract We give a polynomial‐time algorithm for finding a solution to the Traveling Salesman Problem when the points given are constrained to lie on a fixed set of smooth curves of finite length. Β© 2001 John Wiley & Sons, Inc.