{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:23Z","timestamp":1740122423616,"version":"3.37.3"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,1,8]],"date-time":"2022-01-08T00:00:00Z","timestamp":1641600000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,8]],"date-time":"2022-01-08T00:00:00Z","timestamp":1641600000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s10878-021-00830-1","type":"journal-article","created":{"date-parts":[[2022,1,8]],"date-time":"2022-01-08T00:03:13Z","timestamp":1641600193000},"page":"354-378","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Joint chance-constrained staffing optimization in multi-skill call centers"],"prefix":"10.1007","volume":"44","author":[{"given":"Tien Thanh","family":"Dam","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4849-6143","authenticated-orcid":false,"given":"Thuy Anh","family":"Ta","sequence":"additional","affiliation":[]},{"given":"Tien","family":"Mai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,8]]},"reference":[{"key":"830_CR1","doi-asserted-by":"crossref","unstructured":"Ahmed S, Shapiro A (2008) Solving chance-constrained stochastic programs via sampling and integer programming. In: State-of-the-art decision-making tools in the information-intensive age. Informs, pp 261\u2013269","DOI":"10.1287\/educ.1080.0048"},{"key":"830_CR2","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1023\/B:ANOR.0000019095.91642.bb","volume":"127","author":"J Atlason","year":"2004","unstructured":"Atlason J, Epelman M, Henderson S (2004) Call center staffing with simulation and cutting plane methods. Ann Oper Res 127:333\u2013358","journal-title":"Ann Oper Res"},{"key":"830_CR3","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1287\/mnsc.1070.0774","volume":"54","author":"J Atlason","year":"2008","unstructured":"Atlason J, Epelman M, Henderson S (2008) Optimizing call center staffing using simulation and analytic center cutting-plane methods. Manag Sci 54:295\u2013309","journal-title":"Manag Sci"},{"key":"830_CR4","doi-asserted-by":"crossref","unstructured":"Avramidis A, Chan W, Gendreau M, L\u2019Ecuyer P, Pisacane O (2010) Optimizing daily agent scheduling in a multiskill call center. Eur J Oper Res 200:822\u2013832","DOI":"10.1016\/j.ejor.2009.01.042"},{"key":"830_CR5","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1287\/opre.1060.0285","volume":"54","author":"A Bassamboo","year":"2006","unstructured":"Bassamboo A, Harrison J, Zeevi A (2006) Design and control of a large call center: asymptotic analysis of an LP-based method. Oper Res 54:419\u2013435","journal-title":"Oper Res"},{"key":"830_CR6","doi-asserted-by":"crossref","unstructured":"Buist E, L\u2019Ecuyer P (2005) A java library for simulating contact centers. In: Proceedings of the winter simulation conference, 2005, p 10","DOI":"10.1109\/WSC.2005.1574295"},{"key":"830_CR7","doi-asserted-by":"crossref","unstructured":"Chan W, Koole G, L\u2019Ecuyer P (2014) Dynamic call center routing policies using call waiting and agent idle times. Manuf Serv Oper Manag 16:544\u2013560","DOI":"10.1287\/msom.2014.0493"},{"key":"830_CR8","doi-asserted-by":"crossref","unstructured":"Chan W, Ta TA, L\u2019Ecuyer P, Bastin F (2016) Two-stage chance-constrained staffing with agent recourse for multi-skill call centers. In: The 2016 winter simulation conference, IEEE Press, Piscataway, NJ, USA, pp 3189\u20133200","DOI":"10.1109\/WSC.2016.7822351"},{"key":"830_CR9","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.cie.2016.03.013","volume":"96","author":"M Excoffier","year":"2016","unstructured":"Excoffier M, Gicquel C, Jouini O (2016) A joint chance-constrained programming approach for call center workforce scheduling under uncertain call arrival forecasts. Comput Ind Eng 96:16\u201330 (ISSN 0360-8352)","journal-title":"Comput Ind Eng"},{"key":"830_CR10","volume-title":"Operations research and enterprise systems","author":"M Excoffier","year":"2015","unstructured":"Excoffier M, Gicquel C, Jouini O, Lisser A (2015) Comparison of stochastic programming approaches for staffing and scheduling call centers with uncertain demand forecasts. In: Pinson E, Valente F, Vitoriano B (eds) Operations research and enterprise systems. Springer, Cham"},{"key":"830_CR11","doi-asserted-by":"crossref","unstructured":"\u00c7ezik M, L\u2019Ecuyer P (2008) Staffing multiskill call centers via linear programming and simulation. Manag Sci 54:310\u2013323","DOI":"10.1287\/mnsc.1070.0824"},{"key":"830_CR12","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1287\/msom.5.2.79.16071","volume":"5","author":"N Gans","year":"2003","unstructured":"Gans N, Koole G, Mandelbaum A (2003) Telephone call centers: tutorial, review, and research prospects. Manuf Serv Oper Manag 5:79\u2013141","journal-title":"Manuf Serv Oper Manag"},{"key":"830_CR13","doi-asserted-by":"publisher","first-page":"1093","DOI":"10.1287\/mnsc.1100.1173","volume":"56","author":"I Gurvich","year":"2010","unstructured":"Gurvich I, Luedtke J, Tezcan T (2010) Staffing call centers with uncertain demand forecasts: a chance-constrained optimization approach. Manag Sci 56:1093\u20131115","journal-title":"Manag Sci"},{"key":"830_CR14","doi-asserted-by":"crossref","unstructured":"Hoeffding W (1994) Probability inequalities for sums of bounded random variables. The collected works of Wassily Hoeffding. Springer, pp 409\u2013426","DOI":"10.1007\/978-1-4612-0865-5_26"},{"key":"830_CR15","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/j.ejor.2009.04.026","volume":"202","author":"A Ingolfsson","year":"2010","unstructured":"Ingolfsson A, Campello F, Wu X, Cabral E (2010) Combining integer programming and the randomization method to schedule employees. Eur J Oper Res 202:153\u2013163","journal-title":"Eur J Oper Res"},{"key":"830_CR16","first-page":"01","volume":"45","author":"O Jouini","year":"2012","unstructured":"Jouini O, Koole G, Roubos A (2012) Performance indicators for call centers with impatience. IIE Trans 45:01","journal-title":"IIE Trans"},{"key":"830_CR17","first-page":"07","volume":"29","author":"G Kooley","year":"2015","unstructured":"Kooley G, Nielsen BF, Nielsen T (2015) Optimization of overflow policies in call centers. Probab Eng Inf Sci 29:07","journal-title":"Probab Eng Inf Sci"},{"key":"830_CR18","unstructured":"L\u2019Ecuyer P, Meliani L, Vaucher J (2003) SSJ: a framework for stochastic simulation in java. vol\u00a01, pp 234\u2013 242 vol 1, 01. ISBN 0-7803-7614-5"},{"key":"830_CR19","doi-asserted-by":"publisher","first-page":"969","DOI":"10.1137\/050622328","volume":"17","author":"A Nemirovski","year":"2006","unstructured":"Nemirovski A, Shapiro A (2006a) Convex approximations of chance constrained programs. SIAM J Optim 17:969\u2013996. https:\/\/doi.org\/10.1137\/050622328","journal-title":"SIAM J Optim"},{"key":"830_CR20","doi-asserted-by":"crossref","unstructured":"Nemirovski A, Shapiro A (2006b) Scenario approximations of chance constraints. Probabilistic and randomized methods for design under uncertainty. Springer, pp 3\u201347","DOI":"10.1007\/1-84628-095-8_1"},{"key":"830_CR21","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/s11590-019-01387-z","volume":"13","author":"B Singh","year":"2019","unstructured":"Singh B, Watson J-P (2019) Approximating two-stage chance-constrained programs with classical probability bounds. Optim Lett 13:9","journal-title":"Optim Lett"},{"key":"830_CR22","unstructured":"Ta TA, Chan W, Bastin F, L\u2019Ecuyer P (2019) A simulation-based decomposition approach for two-stage staffing optimization in call centers under arrival rate uncertainty. Working paper. https:\/\/www.iro.umontreal.ca\/~lecuyer\/myftp\/papers\/ssa-2stage-decomp.pdf"},{"key":"830_CR23","doi-asserted-by":"crossref","unstructured":"Ta TA, Mai T, Bastin F, L\u2019Ecuyer P (2020) On a multistage discrete stochastic optimization problem with stochastic constraints and nested sampling. Math Progr 190:1\u201337","DOI":"10.1007\/s10107-020-01518-w"},{"key":"830_CR24","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1287\/msom.1050.0086","volume":"7","author":"R Wallace","year":"2005","unstructured":"Wallace R, Whitt W (2005) A staffing algorithm for call centers with skill-based routing. Manuf Serv Oper Manag 7:276\u2013294","journal-title":"Manuf Serv Oper Manag"},{"key":"830_CR25","unstructured":"Xie W, Ahmed S, Jiang R (2017) Optimized bonferroni approximations of distributionally robust joint chance constraints. Optimization Online, 02"},{"key":"830_CR26","doi-asserted-by":"publisher","first-page":"04","DOI":"10.1007\/s11134-014-9406-x","volume":"78","author":"J Zan","year":"2014","unstructured":"Zan J, Hasenbein J, Morton D (2014) Asymptotically optimal staffing of service systems with joint QoS constraints. Queueing Syst 78:04. https:\/\/doi.org\/10.1007\/s11134-014-9406-x","journal-title":"Queueing Syst"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00830-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-021-00830-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00830-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,29]],"date-time":"2022-07-29T07:30:26Z","timestamp":1659079826000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-021-00830-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,8]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["830"],"URL":"https:\/\/doi.org\/10.1007\/s10878-021-00830-1","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2022,1,8]]},"assertion":[{"value":"29 October 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 January 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}