Computational analysis of M(n)/G/1/N queues with setup time

Computational analysis of M(n)/G/1/N queues with setup time

0.00 Avg rating—0 Votes
Article ID: iaor19952322
Country: United Kingdom
Volume: 22
Issue: 8
Start Page Number: 829
End Page Number: 840
Publication Date: Oct 1995
Journal: Computers and Operations Research
Authors: , ,
Keywords: heuristics
Abstract:

An efficient iterative algorithm is developed for computing the stationary queue length distribution in M/G/1/N queues with setup time and arbitrary state dependent arrival rates. The overall computation of the algorithm is O(N2) in complexity. The present numerical investigations demonstrate the strength of the algorithm.

Reviews

Required fields are marked *. Your email address will not be published.