This paper deals with the problem of optimally designing a complex queueing system in presence of some constraints. The system is constituted by a set of M/M/1 queueing (sub-)systems, sharing the same scarce resources, but otherwise running independently. The objective is to minimize an inefficiency index, defined as the maximum expected line-penalty among the subsystems. The service rates are the decision variables. Different special problems, admitting the same general formulation, are illustrated.
OPTIMAL-DESIGN OF A MULTISERVICE SYSTEM - THE LINE-PENALTY PROBLEM
VISCOLANI, BRUNO
1993
Abstract
This paper deals with the problem of optimally designing a complex queueing system in presence of some constraints. The system is constituted by a set of M/M/1 queueing (sub-)systems, sharing the same scarce resources, but otherwise running independently. The objective is to minimize an inefficiency index, defined as the maximum expected line-penalty among the subsystems. The service rates are the decision variables. Different special problems, admitting the same general formulation, are illustrated.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
