Decomposing non-product form queueing lattices through simulated annealing

Document Type

Conference Proceeding

Publication Date

12-1-1990

Abstract

A simulated annealing technique is adapted to decompose the state transition lattice of a class of nonproduct form queuing models. Only the lattices of type A structure are considered. Applying this technique, the lattice is decomposed into solvable subsets which can be solved sequentially. A large amount of computation time can be saved in this way.

Identifier

0025574930 (Scopus)

ISBN

[0879426004]

Publication Title

IECON Proceedings Industrial Electronics Conference

First Page

372

Last Page

375

Volume

1

This document is currently not available here.

Share

COinS