Gürsoy, ÖmerMehr, Kamal AdliAkar, Nail2022-04-292022-04-292022-11-301547-5816http://hdl.handle.net/11693/78181We study the MAP/M/s+G queueing model that arises in various multi-server engineering problems including telephone call centers, under the assumption of MAP (Markovian Arrival Process) arrivals, exponentially distributed service times, infinite waiting room, and generally distributed patience times. Using sample-path arguments, we propose to obtain the steady-state distribution of the virtual waiting time and subsequently the other relevant performance metrics of interest via the steady-state solution of a certain Continuous Feedback Fluid Queue (CFFQ). The proposed method is exact when the patience time is a discrete random variable and is asymptotically exact when it is continuous/hybrid, for which case discretization of the patience time distribution is required giving rise to a computational complexity depending linearly on the number of discretization levels. Additionally, a novel method is proposed to accurately obtain the first passage time distributions for the virtual and actual waiting times again using CFFQs while approximating the deterministic time horizons by Erlang distributions or more efficient Concentrated Matrix Exponential (CME) distributions. Numerical results are presented to validate the effectiveness of the proposed numerical method.EnglishCall center modelsGenerally distributed patience timesMarkov fluid queuesSteady-state solutionFirst passage time distributionArticle10.3934/jimo.20210781553-166X