{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:19:47Z","timestamp":1773656387711,"version":"3.50.1"},"reference-count":40,"publisher":"EDP Sciences","issue":"3","license":[{"start":{"date-parts":[[2019,6,24]],"date-time":"2019-06-24T00:00:00Z","timestamp":1561334400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.edpsciences.org\/en\/authors\/copyright-and-licensing"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2017,7,23]]},"published-print":{"date-parts":[[2019,7]]},"abstract":"<jats:p>This paper deals with a retrial queueing system M\/M\/C\/K with exponential abandonment at which positive and negative primary customers arrive according to Poisson processes. This model is of practical interest: it permits to analyze the performance in call centers or multiprocessor computer systems. For model under study, we find the ergodicity condition and also the approximate solution by applying Value Extrapolation method which includes solving of some algebraic system of equations. To this end, we have resolved the algebraic system in question by different numerical methods. We present also numerical results to analyze the system performance.<\/jats:p>","DOI":"10.1051\/ro\/2017059","type":"journal-article","created":{"date-parts":[[2017,7,25]],"date-time":"2017-07-25T06:55:27Z","timestamp":1500965727000},"page":"767-786","source":"Crossref","is-referenced-by-count":5,"title":["Numerical solution for the performance characteristics of the M\/M\/C\/K retrial queue with negative customers and exponential abandonments by using value extrapolation method"],"prefix":"10.1051","volume":"53","author":[{"given":"Zidani","family":"Nesrine","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Spiteri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Natalia","family":"Djellab","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2019,6,24]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/s10479-006-5292-x","volume":"141","author":"Abramov","year":"2006","journal-title":"Ann. Oper."},{"key":"R2","doi-asserted-by":"crossref","first-page":"617","DOI":"10.14232\/actacyb.22.3.2016.5","volume":"22","author":"Alm\u00e1si","year":"2016","journal-title":"Acta Cybernetica"},{"key":"R3","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/S0377-2217(99)00476-2","volume":"126","author":"Artalejo","year":"2000","journal-title":"EJOR"},{"key":"R4","first-page":"83","volume":"17","author":"Artalejo","year":"2009","journal-title":"J. Egyptian Math. Soc."},{"key":"R5","doi-asserted-by":"crossref","unstructured":"Artalejo J.R. and Gome-zorral A., Retrial Queueing Systems: A Comput. Approach. Springer (2008).","DOI":"10.1007\/978-3-540-78725-9"},{"key":"R6","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1016\/S0377-2217(00)00330-1","volume":"135","author":"Artalejo","year":"2001","journal-title":"Eur. J. Oper. Res."},{"key":"R7","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/j.camwa.2008.10.084","volume":"57","author":"Artalejo","year":"2009","journal-title":"Comput. Math. Appl."},{"key":"R8","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1023\/A:1021359709489","volume":"116","author":"Artalejo","year":"2002","journal-title":"Ann. Oper. Res."},{"key":"R9","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1017\/S0269964808000314","volume":"22","author":"Avrachenkov","year":"2008","journal-title":"Probab. Eng. Inform. Sci."},{"key":"R10","doi-asserted-by":"crossref","first-page":"2272","DOI":"10.1016\/j.apm.2009.10.025","volume":"34","author":"Do","year":"2010","journal-title":"Appl. Math. Model."},{"key":"R11","doi-asserted-by":"crossref","first-page":"2059","DOI":"10.1016\/j.mcm.2010.05.011","volume":"53","author":"Do","year":"2011","journal-title":"Math. Comput. Model."},{"key":"R12","doi-asserted-by":"crossref","first-page":"719","DOI":"10.1016\/j.cie.2013.04.008","volume":"65","author":"Do","year":"2013","journal-title":"Comput. Industrial Eng."},{"key":"R13","doi-asserted-by":"crossref","first-page":"183089","DOI":"10.1155\/2008\/183089","volume":"2008","author":"Domenech-Benloch","year":"2008","journal-title":"Math. Probl. Eng."},{"key":"R14","doi-asserted-by":"crossref","first-page":"580349","DOI":"10.1155\/2010\/580349","volume":"2010","author":"Domenech-Benloch","year":"2010","journal-title":"Math. Probl. Eng."},{"key":"R15","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01158472","volume":"7","author":"Falin","year":"1990","journal-title":"Queueing Syst."},{"key":"R16","doi-asserted-by":"crossref","unstructured":"Falin G.I. and Templeton J.G.C., Retrial Queues. Chapman and Hall (1997).","DOI":"10.1007\/978-1-4899-2977-8"},{"key":"R17","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1162\/neco.1989.1.4.502","volume":"1","author":"Gelenbe","year":"1989","journal-title":"Neural Comput."},{"key":"R18","doi-asserted-by":"crossref","first-page":"245","DOI":"10.2307\/3214756","volume":"28","author":"Gelenbe","year":"1991","journal-title":"J. Appl. Probab."},{"key":"R19","doi-asserted-by":"crossref","first-page":"492","DOI":"10.4218\/etrij.08.0208.0028","volume":"30","author":"Gimenez-Guzman","year":"2008","journal-title":"ETRI J."},{"key":"R20","doi-asserted-by":"crossref","first-page":"486","DOI":"10.2307\/3214272","volume":"24","author":"Hanschke","year":"1987","journal-title":"J. App. Probab."},{"key":"R21","unstructured":"Ibe O., Markov Processess for Stochastic Modeling. Elsevier, Elsevier Academic Press (2009)."},{"key":"R22","unstructured":"Isaacson D.L. and Madsen R.W., Markov Chains, Theory and Applications. John Wiley Sons (1976)."},{"key":"R23","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/s10479-006-5300-1","volume":"141","author":"Krishna Kumar","year":"2006","journal-title":"Ann. Oper. Res."},{"key":"R24","doi-asserted-by":"crossref","first-page":"2062","DOI":"10.1016\/j.apm.2008.05.011","volume":"33","author":"Krishna Kumar","year":"2009","journal-title":"Appl. Math. Model."},{"key":"R25","unstructured":"Lascaux P., Th\u00e9odor R., Analyse num\u00e9rique matricielle appliqu\u00e9e \u00e0 l\u2019art de l\u2019ing\u00e9nieur. Masson Tomes 1 and 2 (1986\u20131987)."},{"key":"R26","doi-asserted-by":"crossref","unstructured":"Leino J. and Virtamo J., An approximate method for calculating performance measures of Markov processes. Proc. Valuetools (2006).","DOI":"10.1145\/1190095.1190181"},{"key":"R27","first-page":"3","volume":"39","author":"Malyshev","year":"1979","journal-title":"Proc. Moscow Math. Soc."},{"key":"R28","unstructured":"Meurant G., Computer solution of large linear systems. North Holland (1999)."},{"key":"R29","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF01158473","volume":"7","author":"Neuts","year":"1990","journal-title":"Queueing Syst."},{"key":"R30","doi-asserted-by":"crossref","first-page":"1058","DOI":"10.1287\/opre.17.6.1058","volume":"17","author":"Pakes","year":"1969","journal-title":"Operat. Res."},{"key":"R31","doi-asserted-by":"crossref","first-page":"1440009","DOI":"10.1142\/S0217595914400090","volume":"31","author":"Phung-Duc","year":"2014","journal-title":"Asia-Pacific J. Oper. Res."},{"key":"R32","first-page":"768","volume":"265","author":"Phung-Duc","year":"2015","journal-title":"Appl. Math. Comput."},{"key":"R33","doi-asserted-by":"crossref","first-page":"639","DOI":"10.3934\/naco.2011.1.639","volume":"1","author":"Phung-Duc","year":"2011","journal-title":"Numer. Algebra, Control Optimiz."},{"key":"R34","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.peva.2014.03.001","volume":"80","author":"Phung-Duc","year":"2014","journal-title":"Performance Evaluation"},{"key":"R35","unstructured":"Puterman M.L., Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley Series in Probability and Statistics. Wiley (2008)."},{"key":"R36","unstructured":"Saad Y., Iterative methods for sparse linear systems. PWS. Publishing Company (1996)."},{"key":"R37","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0895-7177(99)00143-0","volume":"30","author":"Stepanov","year":"1999","journal-title":"Math. Comput. Model."},{"key":"R38","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1017\/S0305004100051562","volume":"78","author":"Tweedie","year":"1975","journal-title":"Math. Proc. Cambridge Philosoph. Soc."},{"key":"R39","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/j.cie.2012.08.015","volume":"64","author":"Wu","year":"2013","journal-title":"Comput. Industrial Eng."},{"key":"R40","doi-asserted-by":"crossref","first-page":"954","DOI":"10.1080\/00207160.2014.932908","volume":"92","author":"Yang","year":"2015","journal-title":"Inter. J. Comput. Math."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2017059\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,20]],"date-time":"2020-03-20T07:36:46Z","timestamp":1584689806000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2017059"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,24]]},"references-count":40,"journal-issue":{"issue":"3"},"alternative-id":["ro160270"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2017059","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,6,24]]}}}