<link rel="stylesheet" href="styles.f3b1fba60ec7970c.css">
ATENÇÃO: O depósito de novas publicações está temporariamente suspenso.

A note on the computational cost of the linearizer algorithm for queueing networks

Loading...
Thumbnail Image

Journal Title

Journal ISSN

Volume Title

Publisher

DOI

Abstract

Linearizer is one of the best known approximation algorithms for obtaining numeric solutions for product form queueing networks. In the original exposition of Linarizer, the computational cost was started to be O(MK³) for a model with M queues and K job classes. We show in this note that with som stright forward algebraic manipulation Linearizer can be modified to require only O (MK²) computational cost.

Description

Keywords

Citation

SILVA, E. A. S. A note on the computational cost of the linearizer algorithm for queueing networks. Rio de Janeiro: NCE, UFRJ, 1988. 7 p. (Relatório Técnico, 04/88)

Collections

Endorsement

Review

Supplemented By

Referenced By

Rights and licensing

Acesso Aberto