{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:50:06Z","timestamp":1743036606747,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031185298"},{"type":"electronic","value":"9783031185304"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-18530-4_17","type":"book-chapter","created":{"date-parts":[[2022,11,20]],"date-time":"2022-11-20T23:02:30Z","timestamp":1668985350000},"page":"228-241","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Improved Bounds for\u00a0Stochastic Extensible Bin Packing Under Distributional Assumptions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6910-8907","authenticated-orcid":false,"given":"Guillaume","family":"Sagnol","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9331-445X","authenticated-orcid":false,"given":"Daniel","family":"Schmidt genannt Waldschmidt","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,11,21]]},"reference":[{"issue":"1","key":"17_CR1","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1002\/(SICI)1099-1425(199806)1:1<55::AID-JOS2>3.0.CO;2-J","volume":"1","author":"N Alon","year":"1998","unstructured":"Alon, N., Azar, Y., Woeginger, G., Yadid, T.: Approximation schemes for scheduling on parallel machines. J. Sched. 1(1), 55\u201366 (1998)","journal-title":"J. Sched."},{"issue":"3","key":"17_CR2","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/0022-0531(70)90039-6","volume":"2","author":"A Atkinson","year":"1970","unstructured":"Atkinson, A.: On the measurement of inequality. J. Econ. Theory 2(3), 244\u2013263 (1970)","journal-title":"J. Econ. Theory"},{"issue":"4","key":"17_CR3","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1287\/ijoc.2017.0750","volume":"29","author":"B Berg","year":"2017","unstructured":"Berg, B., Denton, B.: Fast approximation methods for online scheduling of outpatient procedure centers. INFORMS J. Comput. 29(4), 631\u2013644 (2017)","journal-title":"INFORMS J. Comput."},{"issue":"5","key":"17_CR4","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/S0020-0190(97)00216-0","volume":"65","author":"P Dell\u2019Olmo","year":"1998","unstructured":"Dell\u2019Olmo, P., Kellerer, H., Speranza, M., Tuza, Z.: A $${13}\/{12}$$ approximation algorithm for bin packing with extendable bins. Inf. Proc. Lett. 65(5), 229\u2013233 (1998)","journal-title":"Inf. Proc. Lett."},{"issue":"4\u20131","key":"17_CR5","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1287\/opre.1090.0791","volume":"58","author":"B Denton","year":"2010","unstructured":"Denton, B., Miller, A., Balasubramanian, H., Huschka, T.: Optimal allocation of surgery blocks to operating rooms under uncertainty. Oper. Res. 58(4\u20131), 802\u2013816 (2010)","journal-title":"Oper. Res."},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1016\/j.aop.2017.12.010","volume":"389","author":"I Eliazar","year":"2018","unstructured":"Eliazar, I.: A tour of inequality. Ann. Phys. 389, 306\u2013332 (2018)","journal-title":"Ann. Phys."},{"issue":"1","key":"17_CR7","first-page":"25","volume":"59","author":"J Hadar","year":"1969","unstructured":"Hadar, J., Russell, W.: Rules for ordering uncertain prospects. Am. Econ. Rev. 59(1), 25\u201334 (1969)","journal-title":"Am. Econ. Rev."},{"issue":"3","key":"17_CR8","doi-asserted-by":"publisher","first-page":"1697","DOI":"10.1007\/s00181-012-0594-0","volume":"44","author":"P Joustra","year":"2013","unstructured":"Joustra, P., Meester, R., van Ophem, H.: Can statisticians beat surgeons at the planning of operations? Empir. Econ. 44(3), 1697\u20131718 (2013). https:\/\/doi.org\/10.1007\/s00181-012-0594-0","journal-title":"Empir. Econ."},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"601","DOI":"10.2307\/2525973","volume":"14","author":"H Levy","year":"1973","unstructured":"Levy, H.: Stochastic dominance among log-normal prospects. Int. Econ. Rev. 14, 601\u2013614 (1973)","journal-title":"Int. Econ. Rev."},{"issue":"4","key":"17_CR10","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1051\/ro:1999100","volume":"33","author":"CK Li","year":"1999","unstructured":"Li, C.K., Wong, W.K.: Extension of stochastic dominance theory to random variables. RAIRO-Oper. Res. 33(4), 509\u2013524 (1999)","journal-title":"RAIRO-Oper. Res."},{"issue":"70","key":"17_CR11","first-page":"209","volume":"9","author":"M Lorenz","year":"1905","unstructured":"Lorenz, M.: Methods of measuring the concentration of wealth. Publ. Am. Stat. Assoc. 9(70), 209\u2013219 (1905)","journal-title":"Publ. Am. Stat. Assoc."},{"issue":"2","key":"17_CR12","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/j.jeconom.2003.12.007","volume":"123","author":"M Lubrano","year":"2004","unstructured":"Lubrano, M., Protopopescu, C.: Density inference for ranking European research systems in the field of economics. J. Econometr. 123(2), 345\u2013369 (2004)","journal-title":"J. Econometr."},{"key":"17_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-68276-1","volume-title":"Inequalities: Theory of Majorization and Its Applications","author":"AW Marshall","year":"2011","unstructured":"Marshall, A.W., Olkin, I., Arnold, B.C.: Inequalities: Theory of Majorization and Its Applications, 2nd edn. Springer, New York (2011). https:\/\/doi.org\/10.1007\/978-0-387-68276-1","edition":"2"},{"issue":"3","key":"17_CR14","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1287\/moor.1060.0201","volume":"31","author":"N Megow","year":"2006","unstructured":"Megow, N., Uetz, M., Vredeveld, T.: Models and algorithms for stochastic online scheduling. Math. Oper. Res. 31(3), 513\u2013525 (2006)","journal-title":"Math. Oper. Res."},{"issue":"7","key":"17_CR15","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF01919323","volume":"28","author":"R M\u00f6hring","year":"1984","unstructured":"M\u00f6hring, R., Radermacher, F., Weiss, G.: Stochastic scheduling problems I-general strategies. Z. Oper. Res. 28(7), 193\u2013260 (1984). https:\/\/doi.org\/10.1007\/BF01919323","journal-title":"Z. Oper. Res."},{"key":"17_CR16","doi-asserted-by":"publisher","unstructured":"Pinedo, M.L.: Scheduling: Theory, Algorithms, and Systems. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-642-46773-8_5","DOI":"10.1007\/978-3-642-46773-8_5"},{"issue":"2","key":"17_CR17","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1006\/jeth.1999.2606","volume":"90","author":"H Ramos","year":"2000","unstructured":"Ramos, H., Ollero, J., Sordo, M.: A sufficient condition for generalized Lorenz order. J. Econ. Theory 90(2), 286\u2013292 (2000)","journal-title":"J. Econ. Theory"},{"issue":"3","key":"17_CR18","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0022-0531(70)90038-4","volume":"2","author":"M Rothschild","year":"1970","unstructured":"Rothschild, M., Stiglitz, J.: Increasing risk: I. A definition. J. Econ. Theory 2(3), 225\u2013243 (1970)","journal-title":"J. Econ. Theory"},{"issue":"2","key":"17_CR19","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1016\/j.ejor.2018.05.022","volume":"271","author":"G sagnol","year":"2018","unstructured":"sagnol, G., et al.: Robust allocation of operating rooms: a cutting plane approach to handle lognormal case durations. Eur. J. Oper. Res. 271(2), 420\u2013435 (2018)","journal-title":"Eur. J. Oper. Res."},{"key":"17_CR20","unstructured":"Sagnol, G., Schmidt genannt Waldschmidt, D.: Stochastic extensible bin packing (2020). arXiv:2002.00060 [cs.DS]"},{"key":"17_CR21","unstructured":"Sagnol, G., Schmidt genannt Waldschmidt, D.: Restricted adaptivity in stochastic scheduling. In: European Symposium on Algorithms, ESA 2021. LIPIcs, vol. 204, pp. 1\u201314 (2021)"},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"Sagnol, G., Schmidt genannt Waldschmidt, D., Tesch, A.: The price of fixed assignments in stochastic extensible bin packing. In: Approximation and Online Algorithms WAOA 2018. LNCS, vol. 11312, pp. 327\u2013347 (2018)","DOI":"10.1007\/978-3-030-04693-4_20"},{"key":"17_CR23","doi-asserted-by":"publisher","first-page":"105523","DOI":"10.1016\/j.cor.2021.105523","volume":"137","author":"KS Shehadeh","year":"2022","unstructured":"Shehadeh, K.S., Padman, R.: Stochastic optimization approaches for elective surgery scheduling with downstream capacity constraints: models, challenges, and opportunities. Comput. Oper. Res. 137, 105523 (2022)","journal-title":"Comput. Oper. Res."},{"issue":"2S","key":"17_CR24","doi-asserted-by":"publisher","first-page":"47S","DOI":"10.1097\/00000539-199802001-00047","volume":"86","author":"D Strum","year":"1998","unstructured":"Strum, D., May, J., Vargas, L.: Surgical procedure times are well modeled by the lognormal distribution. Anesth. Analg. 86(2S), 47S (1998)","journal-title":"Anesth. Analg."},{"key":"17_CR25","unstructured":"Uetz, M.: Algorithms for Deterministic and Stochastic Scheduling. Cuvillier (2001)"}],"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-031-18530-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,20]],"date-time":"2022-11-20T23:03:42Z","timestamp":1668985422000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-18530-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031185298","9783031185304"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-18530-4_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"21 November 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 May 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 May 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isco2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/isco2022.sciencesconf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4-5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4-5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}