Optimal control policies for queueing networks with heterogeneous servers (original) (raw)

1992

Abstract

The subject of this thesis is the development of a novel technique to investigate optimal control problems in queueing systems. Dynamic Programming (DP) or Stochastic Dominance (SD) arguments are the traditional techniques in the study of optimal queueing control problems, but they are not applicable to models with fairly complex state and action spaces. Therefore, another technique based on Linear Programming (LP) theory is developed. A queueing network with heterogeneous servers is treated successfully using LP arguments. We apply the LP methodology to the problem of assigning customers to one of several parallel heterogeneous multiserver queueing systems. The decisions involve both routing an arriving customer to one of parallel queues and scheduling the waiting customers to corresponding idle servers. Our intention is to determine the optimal rule for selecting such decisions in routing and scheduling so as to minimize the average delay per customer in the system. We show that t...

Hsing Luh hasn't uploaded this paper.

Let Hsing know you want this paper to be uploaded.

Ask for this paper to be uploaded.