<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">inform</journal-id><journal-title-group><journal-title xml:lang="ru">Информатика</journal-title><trans-title-group xml:lang="en"><trans-title>Informatics</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1816-0301</issn><issn pub-type="epub">2617-6963</issn><publisher><publisher-name>UIIP NASB</publisher-name></publisher></journal-meta><article-meta><article-id custom-type="elpub" pub-id-type="custom">inform-308</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>МАТЕМАТИЧЕСКОЕ И ЛОГИЧЕСКОЕ МОДЕЛИРОВАНИЕ</subject></subj-group></article-categories><title-group><article-title>МНОГОКАНАЛЬНАЯ СИСТЕМА ОБСЛУЖИВАНИЯ КАК МОДЕЛЬ CALL-ЦЕНТРА С УСЛУГОЙ ПЕРЕЗВОНА АБОНЕНТУ</article-title><trans-title-group xml:lang="en"><trans-title></trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Дудина</surname><given-names>О. С.</given-names></name></name-alternatives><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Дудин</surname><given-names>С. А.</given-names></name></name-alternatives><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff xml:lang="ru" id="aff-1"><institution>Белорусский государственный университет</institution><country>Belarus</country></aff><pub-date pub-type="collection"><year>2012</year></pub-date><pub-date pub-type="epub"><day>22</day><month>03</month><year>2018</year></pub-date><volume>0</volume><issue>1(33)</issue><fpage>47</fpage><lpage>57</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Дудина О.С., Дудин С.А., 2018</copyright-statement><copyright-year>2018</copyright-year><copyright-holder xml:lang="ru">Дудина О.С., Дудин С.А.</copyright-holder><copyright-holder xml:lang="en">Дудина О.С., Дудин С.А.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://inf.grid.by/jour/article/view/308">https://inf.grid.by/jour/article/view/308</self-uri><abstract><p>Рассматривается многолинейная система массового обслуживания с бесконечным буфером инетерпеливыми запросами как модель call-центра с возможностью предоставления услуги перезвона абоненту в момент поступления вызова в случае занятости всех операторов. В систему поступает стационарный пуассоновский поток запросов. Время обслуживания запросов каждым прибором имеет показательное распределение. Во время ожидания запросы могут проявлять нетерпеливость и покидать систему. Получено условие существования стационарного распределения состояний системы. Приведен алгоритм для нахождения стационарного распределения, получены формулы для основных характеристик производительности системы.</p></abstract></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Aksin, O.Z. The modern call centers: a multi-disciplinary perspective on operations</mixed-citation><mixed-citation xml:lang="en">Aksin, O.Z. The modern call centers: a multi-disciplinary perspective on operations</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">management research / O.Z. Aksin, M. Armony, V. Mehrotra // Production and Operation Management. – 2007. – Vol. 16. – P. 655–688.</mixed-citation><mixed-citation xml:lang="en">management research / O.Z. Aksin, M. Armony, V. Mehrotra // Production and Operation Management. – 2007. – Vol. 16. – P. 655–688.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Armony, M. On customer contact centers with a call-back option: customer decisions, routing</mixed-citation><mixed-citation xml:lang="en">Armony, M. On customer contact centers with a call-back option: customer decisions, routing</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">rules, and system design / M. Armony, C. Maglaras // Operations research. – 2004. – Vol. 52, № 2. – P. 271–292.</mixed-citation><mixed-citation xml:lang="en">rules, and system design / M. Armony, C. Maglaras // Operations research. – 2004. – Vol. 52, № 2. – P. 271–292.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Armony, M. Contact centers with a call-back option and real-time delay information /</mixed-citation><mixed-citation xml:lang="en">Armony, M. Contact centers with a call-back option and real-time delay information /</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">M. Armony, C. Maglaras // Operations research. – 2004. – Vol. 52, № 4. – P. 527–545.</mixed-citation><mixed-citation xml:lang="en">M. Armony, C. Maglaras // Operations research. – 2004. – Vol. 52, № 4. – P. 527–545.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Neuts, M. Matrix-geometric solutions in stochastic models – An algorithmic approach /</mixed-citation><mixed-citation xml:lang="en">Neuts, M. Matrix-geometric solutions in stochastic models – An algorithmic approach /</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">M. Neuts. – USA : Johns Hopkins University Press, 1981. – 332 p.</mixed-citation><mixed-citation xml:lang="en">M. Neuts. – USA : Johns Hopkins University Press, 1981. – 332 p.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Klimenok, V.I. Multi-dimensional asymptotically quasi-Toeplitz Markov chains and their</mixed-citation><mixed-citation xml:lang="en">Klimenok, V.I. Multi-dimensional asymptotically quasi-Toeplitz Markov chains and their</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">application in queueing theory / V.I. Klimenok, A.N. Dudin // Queueing Systems. – 2006. – Vol. 54. – P. 245–259.</mixed-citation><mixed-citation xml:lang="en">application in queueing theory / V.I. Klimenok, A.N. Dudin // Queueing Systems. – 2006. – Vol. 54. – P. 245–259.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Kesten, H. Priority in waiting line problems / H. Kesten, J.Th. Runnenburg. – Amsterdam :</mixed-citation><mixed-citation xml:lang="en">Kesten, H. Priority in waiting line problems / H. Kesten, J.Th. Runnenburg. – Amsterdam :</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Mathematisch Centrum, 1956. – 234 p.</mixed-citation><mixed-citation xml:lang="en">Mathematisch Centrum, 1956. – 234 p.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Van Danzig, D. Chaines de Markof dans les ensembles abstraits et applications aux processus</mixed-citation><mixed-citation xml:lang="en">Van Danzig, D. Chaines de Markof dans les ensembles abstraits et applications aux processus</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">avec regions absorbantes et au probleme des boucles / D. van Danzig // Ann. de l'Inst. H. Pioncare. – 1955. – Vol. 14. – P. 145–199.</mixed-citation><mixed-citation xml:lang="en">avec regions absorbantes et au probleme des boucles / D. van Danzig // Ann. de l'Inst. H. Pioncare. – 1955. – Vol. 14. – P. 145–199.</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Abate, J. Numerical inversion of the Laplace transforms of probability distributons / J. Abate,</mixed-citation><mixed-citation xml:lang="en">Abate, J. Numerical inversion of the Laplace transforms of probability distributons / J. Abate,</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">W. Whitt // ORSA Journal on Computing. – 1955. – Vol. 7, № 1. – P. 36–43.</mixed-citation><mixed-citation xml:lang="en">W. Whitt // ORSA Journal on Computing. – 1955. – Vol. 7, № 1. – P. 36–43.</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
