{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T16:59:32Z","timestamp":1776790772667,"version":"3.51.2"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,2,23]],"date-time":"2016-02-23T00:00:00Z","timestamp":1456185600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,2,23]],"date-time":"2016-02-23T00:00:00Z","timestamp":1456185600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CMMI-1433066"],"award-info":[{"award-number":["CMMI-1433066"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1007\/s10107-016-0990-x","type":"journal-article","created":{"date-parts":[[2016,2,23]],"date-time":"2016-02-23T10:51:44Z","timestamp":1456224704000},"page":"245-276","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":46,"title":["Decomposition algorithms for optimizing multi-server appointment scheduling with chance constraints"],"prefix":"10.1007","volume":"157","author":[{"given":"Yan","family":"Deng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Siqian","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,2,23]]},"reference":[{"key":"990_CR1","unstructured":"Ahmed, S., Luedtke, J., Song, Y., Xie, W.: Nonanticipative duality and mixed-integer programming formulations for chance-constrained stochastic programs. Optimization-Online (2014). \n                    http:\/\/www.optimization-online.org\/DB_FILE\/2014\/07\/4447"},{"key":"990_CR2","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear Programming. Athena Scientific, Belmont (1999)"},{"key":"990_CR3","unstructured":"Deng, Y., Shen, S., Denton, B.T.: Chance-constrained surgery planning under uncertain or ambiguous surgery duration. SSRN (2015). \n                    http:\/\/ssrn.com\/abstract=2432375"},{"issue":"11","key":"990_CR4","doi-asserted-by":"publisher","first-page":"1003","DOI":"10.1080\/07408170304395","volume":"35","author":"BT Denton","year":"2003","unstructured":"Denton, B.T., Gupta, D.: A sequential bounding approach for optimal appointment scheduling. IIE Trans. 35(11), 1003\u20131016 (2003)","journal-title":"IIE Trans."},{"issue":"4","key":"990_CR5","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1287\/opre.1090.0791","volume":"58","author":"BT Denton","year":"2010","unstructured":"Denton, B.T., Miller, A.J., Balasubramanian, H.J., Huschka, T.R.: Optimal allocation of surgery blocks to operating rooms under uncertainty. Oper. Res. 58(4), 802\u2013816 (2010)","journal-title":"Oper. Res."},{"issue":"1","key":"990_CR6","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1287\/ijoc.1110.0482","volume":"25","author":"SA Erdogan","year":"2013","unstructured":"Erdogan, S.A., Denton, B.T.: Dynamic appointment scheduling of a stochastic server with uncertain demand. INFORMS J. Comput. 25(1), 116\u2013132 (2013)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"990_CR7","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1287\/ijoc.2.1.61","volume":"2","author":"J Gleeson","year":"1990","unstructured":"Gleeson, J., Ryan, J.: Identifying minimally infeasible subsystems of inequalities. ORSA J. Comput. 2(1), 61\u201363 (1990)","journal-title":"ORSA J. Comput."},{"issue":"3","key":"990_CR8","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1111\/j.1937-5956.2011.01232.x","volume":"20","author":"S Gul","year":"2011","unstructured":"Gul, S., Denton, B.T., Fowler, J.W., Huschka, T.R.: Bi-criteria scheduling of surgical services for an outpatient procedure center. Prod. Oper. Manag. 20(3), 406\u2013417 (2011)","journal-title":"Prod. Oper. Manag."},{"issue":"1\u20132","key":"990_CR9","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s10107-010-0385-3","volume":"132","author":"S K\u00fc\u00e7\u00fckyavuz","year":"2012","unstructured":"K\u00fc\u00e7\u00fckyavuz, S.: On mixing sets arising in chance-constrained programming. Math. Program. 132(1\u20132), 31\u201356 (2012)","journal-title":"Math. Program."},{"issue":"3","key":"990_CR10","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0167-6377(93)90002-X","volume":"13","author":"G Laporte","year":"1993","unstructured":"Laporte, G., Louveaux, F.V.: The integer L-shaped method for stochastic integer programs with complete recourse. Oper. Res. Lett. 13(3), 133\u2013142 (1993)","journal-title":"Oper. Res. Lett."},{"key":"990_CR11","doi-asserted-by":"publisher","unstructured":"Liu, X., K\u00fc\u00e7\u00fckyavuz, S., Luedtke, J.: Decomposition algorithms for two-stage chance-constrained programs. Math. Program. 1\u201325 (2014). doi:\n                    10.1007\/s10107-014-0832-7","DOI":"10.1007\/s10107-014-0832-7"},{"issue":"1\u20132","key":"990_CR12","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s10107-013-0684-6","volume":"146","author":"J Luedtke","year":"2014","unstructured":"Luedtke, J.: A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support. Math. Program. 146(1\u20132), 219\u2013244 (2014)","journal-title":"Math. Program."},{"issue":"2","key":"990_CR13","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1137\/070702928","volume":"19","author":"J Luedtke","year":"2008","unstructured":"Luedtke, J., Ahmed, S.: A sample approximation approach for optimization with probabilistic constraints. SIAM J. Optim. 19(2), 674\u2013699 (2008)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"990_CR14","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s10107-008-0247-4","volume":"122","author":"J Luedtke","year":"2010","unstructured":"Luedtke, J., Ahmed, S., Nemhauser, G.: An integer programming approach for linear programs with probabilistic constraints. Math. Program. 122(2), 247\u2013272 (2010)","journal-title":"Math. Program."},{"issue":"2","key":"990_CR15","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/s10957-009-9523-6","volume":"142","author":"B Pagnoncelli","year":"2009","unstructured":"Pagnoncelli, B., Ahmed, S., Shapiro, A.: Sample average approximation method for chance constrained programming: theory and applications. J. Optim. Theory Appl. 142(2), 399\u2013416 (2009)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"990_CR16","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1287\/ijoc.2013.0582","volume":"26","author":"F Qiu","year":"2014","unstructured":"Qiu, F., Ahmed, S., Dey, S.S., Wolsey, L.A.: Covering linear programming with violations. INFORMS J. Comput. 26(3), 531\u2013546 (2014)","journal-title":"INFORMS J. Comput."},{"key":"990_CR17","unstructured":"Queyranne, M., Schulz, A.S.: Polyhedral approaches to machine scheduling (1996). \n                    http:\/\/web.mit.edu\/schulz\/www\/epapers\/queyranne-schulz"},{"issue":"1","key":"990_CR18","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10951-013-0349-6","volume":"17","author":"SC Sarin","year":"2014","unstructured":"Sarin, S.C., Sherali, H.D., Liao, L.: Minimizing conditional value-at-risk for stochastic scheduling problems. J. Sched. 17(1), 5\u201315 (2014)","journal-title":"J. Sched."},{"issue":"4","key":"990_CR19","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1287\/ijoc.1120.0530","volume":"25","author":"OV Shylo","year":"2012","unstructured":"Shylo, O.V., Prokopyev, O.A., Schaefer, A.J.: Stochastic operating room scheduling for high-volume specialties under block booking. INFORMS J. Comput. 25(4), 682\u2013692 (2012)","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"990_CR20","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1287\/ijoc.2014.0595","volume":"26","author":"Y Song","year":"2014","unstructured":"Song, Y., Luedtke, J.R., K\u00fc\u00e7\u00fckyavuz, S.: Chance-constrained binary packing problems. INFORMS J. Comput. 26(4), 735\u2013747 (2014)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"990_CR21","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1016\/j.ejor.2010.04.019","volume":"207","author":"M Tanner","year":"2010","unstructured":"Tanner, M., Ntaimo, L.: IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation. Eur. J. Oper. Res. 207(1), 290\u2013296 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"990_CR22","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1287\/ijoc.1090.0372","volume":"22","author":"JP Watson","year":"2010","unstructured":"Watson, J.P., Wets, R.J., Woodruff, D.L.: Scalable heuristics for a class of chance-constrained stochastic programs. INFORMS J. Comput. 22(4), 543\u2013554 (2010)","journal-title":"INFORMS J. Comput."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-0990-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-016-0990-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-0990-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-0990-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T16:16:17Z","timestamp":1589645777000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-016-0990-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,23]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,5]]}},"alternative-id":["990"],"URL":"https:\/\/doi.org\/10.1007\/s10107-016-0990-x","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,2,23]]},"assertion":[{"value":"15 February 2014","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 February 2016","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 February 2016","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}