We consider M/M/c/K (K ≥ c ≥ 1) retrial queues with two types of nonpersistent customers, which are motivated from modeling of service systems such as call centers. Arriving customers that see the system fully occupied either join the orbit or abandon receiving service forever. After an...

We consider a finite buffer capacity GI/GI/c/K-type retrial queueing system with constant retrial rate. The system consists of a primary queue and an orbit queue. The primary queue has <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$$c$$</EquationSource> <EquationSource Format="MATHML"> <math xmlns:xlink="http://www.w3.org/1999/xlink"> <mi>c</mi> </math> </EquationSource> </InlineEquation> identical servers and can accommodate up to <InlineEquation ID="IEq2"> <EquationSource Format="TEX">$$K$$</EquationSource> <EquationSource Format="MATHML"> <math xmlns:xlink="http://www.w3.org/1999/xlink"> <mi>K</mi> </math> </EquationSource> </InlineEquation> jobs (including <InlineEquation ID="IEq3"> <EquationSource Format="TEX">$$c$$</EquationSource> <EquationSource Format="MATHML"> <math xmlns:xlink="http://www.w3.org/1999/xlink"> <mi>c</mi> </math> </EquationSource> </InlineEquation> jobs...</equationsource></equationsource></inlineequation></equationsource></equationsource></inlineequation></equationsource></equationsource></inlineequation>