On the static assignment to parallel servers

On the static assignment to parallel servers

The authors study the static assignment to M parallel, exponential, heterogeneous servers. Blocked customers are lost, while the objective is to minimize the average number of blocked customers. The problem is formulated as a stochastic control problem with partial observation, and an equivalent ful...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on automatic control 1999-08, Vol.44 (8), p.1588-1592
1. Verfasser: Koole, G.
Format: Artikel
Sprache:eng
Schlagworte:
Applied sciences
Automatic control
Blocking
Computer science
Computer science
control theory
systems
Control theory. Systems
Customers
Distribution functions
Dynamic programming
Equivalence
Exact sciences and technology
Mathematics
Operational research and scientific management
Operational research. Management science
Optimal control
Optimization
Policies
Round robin
Routing
Scheduling, sequencing
Servers
Size control
State-space methods
Stochastic processes
Stochasticity
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The authors study the static assignment to M parallel, exponential, heterogeneous servers. Blocked customers are lost, while the objective is to minimize the average number of blocked customers. The problem is formulated as a stochastic control problem with partial observation, and an equivalent full observation problem is formulated. Numerical experiments are conducted and the structure of the optimal policies is studied.
ISSN:0018-9286
1558-2523
DOI:10.1109/9.780430