Approximation of the Overflow Process from a <i>G</i>/<i>M</i>/<i>N</i>/<i>K</i> Queueing System

The overflow process from a G/M/N/K queueing system with a stationary counting arrival process, Markovian service times, N parallel homogeneous servers, and K waiting spaces, is asymptotically approximated by a two parameter method. Numerical results are presented and approximation outcomes are compared against those from a simulation study.

• 저널Management Science · 33(7) · 931–938
• 토픽Advanced Queuing Theory Analysis · Management Information Systems
• DOI10.1287/mnsc.33.7.931
• 저자Behnam Pourbabai