{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T23:54:39Z","timestamp":1767138879053,"version":"build-2238731810"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319091730","type":"print"},{"value":"9783319091747","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09174-7_29","type":"book-chapter","created":{"date-parts":[[2014,7,21]],"date-time":"2014-07-21T01:42:05Z","timestamp":1405906925000},"page":"336-346","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Robust Shift Scheduling in Call Centers"],"prefix":"10.1007","author":[{"given":"Sara","family":"Mattia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabrizio","family":"Rossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mara","family":"Servilio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefano","family":"Smriglio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,7,22]]},"reference":[{"issue":"6","key":"29_CR1","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1111\/j.1937-5956.2007.tb00288.x","volume":"16","author":"Z Aksin","year":"2007","unstructured":"Aksin, Z., Armony, M., Mehrotra, V.: The modern call center: a multi-disciplinary perspective on operations management research. Prod. Oper. Manage. 16(6), 665\u2013688 (2007)","journal-title":"Prod. Oper. Manage."},{"issue":"2","key":"29_CR2","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.A., Henderson, S.G.: Optimizing call center staffing using simulation and analytic center cutting plane methods. Manage. Sci. 54(2), 295\u2013309 (2008)","journal-title":"Manage. Sci."},{"key":"29_CR3","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1287\/moor.23.4.769","volume":"23","author":"A Ben-Tal","year":"1998","unstructured":"Ben-Tal, A., Nemirowski, A.: Robust convex optimization. Math. Oper. Res. 23, 769\u2013805 (1998)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"29_CR4","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10107-003-0454-y","volume":"99","author":"A Ben-Tal","year":"2004","unstructured":"Ben-Tal, A., Goryashko, A., Guslitzer, E., Nemirovski, A.: Adjustable robust solutions of uncertain linear programs. Math. Program. 99(2), 351\u2013376 (2004)","journal-title":"Math. Program."},{"key":"29_CR5","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10107-003-0396-4","volume":"98","author":"D Bertsimas","year":"2003","unstructured":"Bertsimas, D., Sim, M.: Robust discrete optimization and network flows. Math. Program. Ser. B 98, 49\u201371 (2003)","journal-title":"Math. Program. Ser. B"},{"issue":"6","key":"29_CR6","doi-asserted-by":"publisher","first-page":"1469","DOI":"10.1287\/opre.1080.0605","volume":"57","author":"X Chen","year":"2009","unstructured":"Chen, X., Zhang, Y.: Uncertain linear programs: extended affinely adjustable robust counterparts. Oper. Res. 57(6), 1469\u20131482 (2009)","journal-title":"Oper. Res."},{"key":"29_CR7","volume-title":"Call Center Mathematics","author":"G Koole","year":"2013","unstructured":"Koole, G.: Call Center Mathematics. A scientific method for understanding and improving contact centers. MG books, Amsterdam (2013). ISBN 9789082017908"},{"key":"29_CR8","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1023\/A:1020949626017","volume":"113","author":"G Koole","year":"2002","unstructured":"Koole, G., Mandelbaum, A.: Queueing models of call centers: an introduction. Ann. Oper. Res. 113, 41\u201359 (2002)","journal-title":"Ann. Oper. Res."},{"key":"29_CR9","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1007\/s00291-011-0257-0","volume":"34","author":"S Liao","year":"2012","unstructured":"Liao, S., Koole, G., Van Delft, C., Jouini, O.: Staffing a call center with uncertain non-stationary arrival rate and flexibility. OR Spectr. 34, 691\u2013721 (2012)","journal-title":"OR Spectr."},{"issue":"3","key":"29_CR10","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1080\/10556788.2012.694166","volume":"28","author":"S Liao","year":"2013","unstructured":"Liao, S., Van Delft, C., Vial, J.P.: Distributionally robust workforce scheduling in call centres with uncertain arrival rates. J. Optim. Meth. Softw. 28(3), 501\u2013522 (2013)","journal-title":"J. Optim. Meth. Softw."},{"issue":"3","key":"29_CR11","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1007\/s10589-012-9500-0","volume":"54","author":"S Mattia","year":"2013","unstructured":"Mattia, S.: The robust network loading problem with dynamic routing. Comput. Optim. Appl. 54(3), 619\u2013643 (2013)","journal-title":"Comput. Optim. Appl."},{"key":"29_CR12","doi-asserted-by":"publisher","first-page":"3317","DOI":"10.1007\/978-0-387-74759-0_569","volume-title":"Encyclopedia of Optimization","author":"M Minoux","year":"2009","unstructured":"Minoux, M.: Robust LP with right-handside uncertainty, duality and applications. In: Floudas, C., Pardalos, P. (eds.) Encyclopedia of Optimization, 2nd edn, pp. 3317\u20133327. Springer, New York (2009)","edition":"2"},{"key":"29_CR13","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/s10898-010-9645-2","volume":"49","author":"M Minoux","year":"2011","unstructured":"Minoux, M.: On 2-stage robust LP with RHS uncertainty: complexity results and applications. J. Global Optim. 49, 521\u2013537 (2011)","journal-title":"J. Global Optim."},{"key":"29_CR14","series-title":"MPS\/SIAM Series on Optimization","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718751","volume-title":"Lectures on Stochastic Programming: Modeling and Theory","author":"A Shapiro","year":"2009","unstructured":"Shapiro, A., Dentcheva, D., Ruszczy\u0144ski, A.: Lectures on Stochastic Programming: Modeling and Theory. MPS\/SIAM Series on Optimization. SIAM, Philadelphia (2009)"},{"key":"29_CR15","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/0-387-26771-9_4","volume":"99","author":"A Shapiro","year":"2005","unstructured":"Shapiro, A., Nemirovski, A.: On complexity of stochastic programming problems. Continuous Optim. Appl. Optim. 99, 111\u2013146 (2005)","journal-title":"Continuous Optim. Appl. Optim."},{"issue":"4","key":"29_CR16","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1287\/opre.22.4.808","volume":"22","author":"M Segal","year":"1974","unstructured":"Segal, M.: The operator-scheduling problem: a network-flow approach. Oper. Res. 22(4), 808\u2013823 (1974)","journal-title":"Oper. Res."},{"key":"29_CR17","doi-asserted-by":"publisher","first-page":"1154","DOI":"10.1287\/opre.21.5.1154","volume":"21","author":"A Soyster","year":"1973","unstructured":"Soyster, A.: Convex programming with set-inclusive constraints and applications to inexact linear programming. Oper. Res. 21, 1154\u20131157 (1973)","journal-title":"Oper. Res."},{"key":"29_CR18","unstructured":"Thiele, A., Terry, T., Epelman, M.: Robust Linear Optimization With Recourse, Optimization Online (2010). http:\/\/www.optimization-online.org\/DB_FILE\/2009\/03\/2263.pdf"},{"key":"29_CR19","unstructured":"NextStep Workforce Planning. http:\/\/www.nextstepwfp.com\/2012\/01\/how-much-is-over-staffing-costing-your-contact-centre"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09174-7_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T21:10:47Z","timestamp":1703193047000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-09174-7_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319091730","9783319091747"],"references-count":19,"aliases":["10.1007\/978-3-319-14115-2_29"],"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09174-7_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"22 July 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}