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( N 2) in complexity. Our numerical investigations demonstrate the strength of the algorithm.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Surveys in Operations Research and Management Science
Paper Title
Journal
Date
