Decomposing nonproduct from queueing lattices through simulated annealing

A simulated annealing technique is adapted to decompose the state transition lattice of a class of nonproduct form queueing models which are useful in studying the behaviour of computer systems. 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