{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:33:50Z","timestamp":1740123230055,"version":"3.37.3"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,1,15]],"date-time":"2022-01-15T00:00:00Z","timestamp":1642204800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,1,15]],"date-time":"2022-01-15T00:00:00Z","timestamp":1642204800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100003451","name":"Universidad del Pa\u00eds Vasco","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100003451","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2022,5]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We study the optimal Bernoulli routing in a multiclass queueing system with a dedicated server for each class as well as a common (or multi-skilled) server that can serve jobs of all classes. Jobs of each class arrive according to a Poisson process. Each server has a holding cost per customer and use the processor sharing discipline for service. The objective is to minimize the weighted mean holding cost. First, we provide conditions under which classes send their traffic only to their dedicated server, only to the common server, or to both. A fixed point algorithm is given for the computation of the optimal solution. We then specialize to two classes and give explicit expressions for the optimal loads. Finally, we compare the cost of multi-skilled server with that of only dedicated or all common servers. The theoretical results are complemented by numerical examples that illustrate the various structural results as well as the convergence of the fixed point algorithm.<\/jats:p>","DOI":"10.1007\/s10479-022-04532-7","type":"journal-article","created":{"date-parts":[[2022,1,15]],"date-time":"2022-01-15T15:02:46Z","timestamp":1642258966000},"page":"949-971","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Load-balancing for multi-skilled servers with Bernoulli routing"],"prefix":"10.1007","volume":"312","author":[{"given":"Fernando","family":"Miguelez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5552-9134","authenticated-orcid":false,"given":"Josu","family":"Doncel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Balakrishna J.","family":"Prabhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,15]]},"reference":[{"issue":"1\u20132","key":"4532_CR1","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s11235-010-9300-8","volume":"47","author":"E Altman","year":"2011","unstructured":"Altman, E., Ayesta, U., & Prabhu, B. J. (2011). Load balancing in processor sharing systems. Telecommunication Systems, 47(1\u20132), 35\u201348.","journal-title":"Telecommunication Systems"},{"key":"4532_CR2","doi-asserted-by":"publisher","unstructured":"Bonald, T., Comte, C., & Mathieu, F. (2017). Performance of balanced fairness in resource pools: A recursive approach. Proceedings of the ACM on Measurement and Analysis of Computing Systems. https:\/\/doi.org\/10.1145\/3154500.","DOI":"10.1145\/3154500"},{"key":"4532_CR3","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s11134-020-09669-5","volume":"96","author":"J Chen","year":"2020","unstructured":"Chen, J., Do, J., & Shi, P. (2020). A survey on skill-based routing with applications to service operations management. Queueing Systems, 96, 53\u201382.","journal-title":"Queueing Systems"},{"issue":"1\u20134","key":"4532_CR4","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1016\/j.peva.2005.07.031","volume":"62","author":"H Feng","year":"2005","unstructured":"Feng, H., Misra, V., & Rubenstein, D. (2005). Optimal state-free, size-aware dispatching for heterogeneous M\/G\/-type systems. Performance Evaluation, 62(1\u20134), 475\u2013492.","journal-title":"Performance Evaluation"},{"issue":"1","key":"4532_CR5","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/s42979-019-0029-5","volume":"1","author":"J-M Fourneau","year":"2020","unstructured":"Fourneau, J.-M. (2020). Modeling green data-centers and jobs balancing with energy packet networks and interrupted Poisson energy arrivals. SN Computer Science, 1(1), 28.","journal-title":"SN Computer Science"},{"key":"4532_CR6","doi-asserted-by":"crossref","unstructured":"Gardner, K., Zbarsky, S., Doroudi, S., Harchol-Balter, M., & Hyytia, E. (2015). Reducing latency via redundant requests: exact analysis. In Proceedings of the 2015 ACM SIGMETRICS International conference on measurement and modeling of computer systems, SIGMETRICS \u201915, Association for Computing Machinery, New York, NY, USA (pp. 347\u2013360).","DOI":"10.1145\/2745844.2745873"},{"issue":"1","key":"4532_CR7","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10626-006-6179-3","volume":"16","author":"B Gaujal","year":"2006","unstructured":"Gaujal, B., Hyon, E., & Jean-Marie, A. (2006). Optimal routing in two parallel queues with exponential service times. Discrete Event Dynamic Systems, 16(1), 71\u2013107. https:\/\/doi.org\/10.1007\/s10626-006-6179-3.","journal-title":"Discrete Event Dynamic Systems"},{"issue":"1","key":"4532_CR8","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1239\/jap\/1014842277","volume":"37","author":"C Graham","year":"2000","unstructured":"Graham, C. (2000). Chaoticity on path space for a queueing network with selection of the shortest queue among several. Journal of Applied Probability, 37(1), 198\u2013211. https:\/\/doi.org\/10.1239\/jap\/1014842277.","journal-title":"Journal of Applied Probability"},{"key":"4532_CR9","doi-asserted-by":"crossref","unstructured":"Harchol-Balter, M. (2000). Task assignment with unknown duration. In Proceedings 20th IEEE international conference on distributed computing systems (pp. 214\u2013224). IEEE.","DOI":"10.21236\/ADA368426"},{"issue":"2","key":"4532_CR10","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1006\/jpdc.1999.1577","volume":"59","author":"M Harchol-Balter","year":"1999","unstructured":"Harchol-Balter, M., Crovella, M. E., & Murta, C. D. (1999). On choosing a task assignment policy for a distributed server system. Journal of Parallel and Distributed Computing, 59(2), 204\u2013228.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"4532_CR11","unstructured":"Kelly, F. (1979). Reversibility and stochastic networks. Technical report."},{"key":"4532_CR12","doi-asserted-by":"crossref","unstructured":"Koole, G., Pot, A., & Talim, J. (2003). Routing heuristics for multi-skill call centers,2, 1813\u20131816.","DOI":"10.1109\/WSC.2003.1261637"},{"issue":"2","key":"4532_CR13","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1109\/TNET.2014.2308295","volume":"23","author":"Z Liu","year":"2015","unstructured":"Liu, Z., Lin, M., Wierman, A., Low, S., & Andrew, L. L. H. (2015). Greening geographical load balancing. IEEE\/ACM Transactions on Networking, 23(2), 657\u2013671.","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"11","key":"4532_CR14","doi-asserted-by":"publisher","first-page":"1056","DOI":"10.1016\/j.peva.2011.07.015","volume":"68","author":"Y Lu","year":"2011","unstructured":"Lu, Y., Xie, Q., Kliot, G., Geller, A., Larus, J. R., & Greenberg, A. (2011). Join-idle-queue: A novel load balancing algorithm for dynamically scalable web services. Performance Evaluation, 68(11), 1056\u20131071.","journal-title":"Performance Evaluation"},{"issue":"10","key":"4532_CR15","doi-asserted-by":"publisher","first-page":"1094","DOI":"10.1109\/71.963420","volume":"12","author":"M Mitzenmacher","year":"2001","unstructured":"Mitzenmacher, M. (2001). The power of two choices in randomized load balancing. IEEE Transactions on Parallel and Distributed Systems, 12(10), 1094\u20131104.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"9","key":"4532_CR16","doi-asserted-by":"publisher","first-page":"e3170","DOI":"10.1002\/ett.3170","volume":"28","author":"I Taboada","year":"2017","unstructured":"Taboada, I., Aalto, S., Lassila, P., & Liberal, F. (2017). Delay and energy-aware load balancing in ultra-dense heterogeneous 5G networks. Transactions on Emerging Telecommunications Technologies, 28(9), e3170.","journal-title":"Transactions on Emerging Telecommunications Technologies"},{"issue":"1","key":"4532_CR17","first-page":"15","volume":"32","author":"ND Vvedenskaya","year":"1996","unstructured":"Vvedenskaya, N. D., Dobrushin, R. L., & Karpelevich, F. I. (1996). Queueing system with selection of the shortest of two queues: An asymptotic approach. Problems of Information Transmission, 32(1), 15\u201327.","journal-title":"Problems of Information Transmission"},{"issue":"4","key":"4532_CR18","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1287\/msom.1050.0086","volume":"7","author":"RB Wallace","year":"2005","unstructured":"Wallace, R. B., & Whitt, W. (2005). A staffing algorithm for call centers with skill-based Routing. Manufacturing&amp; Service Operations Management, 7(4), 276\u2013294.","journal-title":"Manufacturing & Service Operations Management"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-022-04532-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-022-04532-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-022-04532-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T11:06:52Z","timestamp":1726484812000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-022-04532-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,15]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,5]]}},"alternative-id":["4532"],"URL":"https:\/\/doi.org\/10.1007\/s10479-022-04532-7","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2022,1,15]]},"assertion":[{"value":"3 January 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 January 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}