{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T10:02:10Z","timestamp":1743069730498,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030046927"},{"type":"electronic","value":"9783030046934"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-04693-4_20","type":"book-chapter","created":{"date-parts":[[2018,11,28]],"date-time":"2018-11-28T05:03:12Z","timestamp":1543381392000},"page":"327-347","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["The Price of Fixed Assignments in Stochastic Extensible Bin Packing"],"prefix":"10.1007","author":[{"given":"Guillaume","family":"Sagnol","sequence":"first","affiliation":[]},{"given":"Daniel","family":"Schmidt genannt Waldschmidt","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Tesch","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,29]]},"reference":[{"issue":"1","key":"20_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":"1\u20132","key":"20_CR2","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s10107-015-0927-9","volume":"154","author":"N Bansal","year":"2015","unstructured":"Bansal, N., Nagarajan, V.: On the adaptivity gap of stochastic orienteering. Math. Program. 154(1\u20132), 145\u2013172 (2015)","journal-title":"Math. Program."},{"issue":"4","key":"20_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."},{"key":"20_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"issue":"4","key":"20_CR5","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1137\/S0097539795283292","volume":"27","author":"R Canetti","year":"1998","unstructured":"Canetti, R., Irani, S.: Bounding the power of preemption in randomized scheduling. SIAM J. Comput. 27(4), 993\u20131015 (1998)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"20_CR6","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1287\/moor.1110.0520","volume":"37","author":"JR Correa","year":"2012","unstructured":"Correa, J.R., Skutella, M., Verschae, J.: The power of preemption on unrelated machines and applications to scheduling orders. Math. Oper. Res. 37(2), 379\u2013398 (2012)","journal-title":"Math. Oper. Res."},{"key":"20_CR7","unstructured":"Dean, B.C., Goemans, M.X., Vondr\u00e1k, J.: Adaptivity and approximation for stochastic packing problems. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 395\u2013404. Society for Industrial and Applied Mathematics (2005)"},{"issue":"4","key":"20_CR8","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1287\/moor.1080.0330","volume":"33","author":"BC Dean","year":"2008","unstructured":"Dean, B.C., Goemans, M.X., Vondr\u00e1k, J.: Approximating the stochastic knapsack problem: the benefit of adaptivity. Math. Oper. Res. 33(4), 945\u2013964 (2008)","journal-title":"Math. Oper. Res."},{"issue":"5","key":"20_CR9","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. Process. Lett. 65(5), 229\u2013233 (1998)","journal-title":"Inf. Process. Lett."},{"issue":"1\u20133","key":"20_CR10","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0166-218X(99)00020-7","volume":"94","author":"P Dell\u2019Olmo","year":"1999","unstructured":"Dell\u2019Olmo, P., Speranza, M.: Approximation algorithms for partitioning small items in unequal bins to minimize the total size. Discret. Appl. Math. 94(1\u20133), 181\u2013191 (1999)","journal-title":"Discret. Appl. Math."},{"issue":"4\u2013part\u20131","key":"20_CR11","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\u2013part\u20131), 802\u2013816 (2010)","journal-title":"Oper. Res."},{"issue":"4","key":"20_CR12","doi-asserted-by":"publisher","first-page":"933","DOI":"10.1097\/00000539-200204000-00030","volume":"94","author":"F Dexter","year":"2002","unstructured":"Dexter, F., Traub, R.: How to schedule elective surgical cases into specific operating rooms to maximize the efficiency of use of operating room time. Anesth. Analg. 94(4), 933\u2013942 (2002)","journal-title":"Anesth. Analg."},{"key":"20_CR13","volume-title":"Computers and Intractability: A Guide to NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to NP-Completeness. WH Freeman and Company, San Francisco (1979)"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Gupta, A., Nagarajan, V., Singla, S.: Algorithms and adaptivity gaps for stochastic probing. In: Proceedings of the Twenty-seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1731\u20131747. SIAM (2016)","DOI":"10.1137\/1.9781611974331.ch120"},{"issue":"3","key":"20_CR15","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.ijmedinf.2010.01.003","volume":"79","author":"D Isern","year":"2010","unstructured":"Isern, D., S\u00e1nchez, D., Moreno, A.: Agents applied in health care: a review. Int. J. Med. Inform. 79(3), 145\u2013166 (2010)","journal-title":"Int. J. Med. Inform."},{"issue":"5","key":"20_CR16","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1016\/j.orl.2006.12.002","volume":"35","author":"S Kolliopoulos","year":"2007","unstructured":"Kolliopoulos, S., Steiner, G.: Approximation algorithms for scheduling problems with a modified total weighted tardiness objective. Oper. Res. Lett. 35(5), 685\u2013692 (2007)","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"20_CR17","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1023\/A:1015487829051","volume":"8","author":"MY Kovalyov","year":"2002","unstructured":"Kovalyov, M.Y., Werner, F.: Approximation schemes for scheduling jobs with common due date on parallel machines to minimize total tardiness. J. Heuristics 8(4), 415\u2013428 (2002)","journal-title":"J. Heuristics"},{"key":"20_CR18","doi-asserted-by":"crossref","DOI":"10.1201\/9780203489802","volume-title":"Handbook of Scheduling: Algorithms, Models, and Performance Analysis","author":"JYT Leung","year":"2004","unstructured":"Leung, J.Y.T.: Handbook of Scheduling: Algorithms, Models, and Performance Analysis. CRC Press, Boca Raton (2004)"},{"issue":"47\u201349","key":"20_CR19","doi-asserted-by":"publisher","first-page":"5039","DOI":"10.1016\/j.tcs.2009.07.055","volume":"410","author":"M Liu","year":"2009","unstructured":"Liu, M., Xu, Y., Chu, C., Zheng, F.: Online scheduling to minimize modified total tardiness with an availability constraint. Theor. Comput. Sci. 410(47\u201349), 5039\u20135046 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"20_CR20","volume-title":"Inequalities: Theory of Majorization and its Applications","author":"A Marshall","year":"1979","unstructured":"Marshall, A., Olkin, I., Arnold, B.: Inequalities: Theory of Majorization and its Applications. Elsevier, Amsterdam (1979)"},{"issue":"3","key":"20_CR21","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":"20_CR22","first-page":"193","volume":"28","author":"R M\u00f6hring","year":"1984","unstructured":"M\u00f6hring, R., Radermacher, F., Weiss, G.: Stochastic scheduling problems I-general strategies. Z. f\u00fcr Oper. Res. 28(7), 193\u2013260 (1984)","journal-title":"Z. f\u00fcr Oper. Res."},{"issue":"2","key":"20_CR23","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1016\/j.ejor.2018.05.022","volume":"271","author":"Guillaume 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. (2018). https:\/\/doi.org\/10.1016\/j.ejor.2018.05.022, e-pub ahead of print","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"20_CR24","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1137\/S0895480199357078","volume":"15","author":"AS Schulz","year":"2002","unstructured":"Schulz, A.S., Skutella, M.: Scheduling unrelated machines by randomized rounding. SIAM J. Discret. Math. 15(4), 450\u2013469 (2002)","journal-title":"SIAM J. Discret. Math."},{"issue":"3","key":"20_CR25","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1287\/moor.2015.0757","volume":"41","author":"M Skutella","year":"2016","unstructured":"Skutella, M., Sviridenko, M., Uetz, M.: Unrelated machine scheduling with stochastic processing times. Math. Oper. Res. 41(3), 851\u2013864 (2016)","journal-title":"Math. Oper. Res."},{"key":"20_CR26","unstructured":"Soper, A.J., Strusevich, V.A.: Power of preemption on uniform parallel machines. In: 17th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2014), pp. 392\u2013402 (2014)"},{"key":"20_CR27","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1023\/A:1018935608981","volume":"86","author":"M Speranza","year":"1999","unstructured":"Speranza, M., Tuza, Z.: On-line approximation algorithms for scheduling tasks on identical machines with extendable working time. Ann. Oper. Res. 86, 491\u2013506 (1999)","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"20_CR28","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1080\/00207543.2017.1328140","volume":"56","author":"G Xiao","year":"2018","unstructured":"Xiao, G., van Jaarsveld, W., Dong, M., van de Klundert, J.: Models, algorithms and performance analysis for adaptive operating room scheduling. Int. J. Prod. Res. 56(4), 1389\u20131413 (2018)","journal-title":"Int. J. Prod. Res."},{"issue":"3","key":"20_CR29","doi-asserted-by":"publisher","first-page":"680","DOI":"10.1109\/TASE.2013.2267273","volume":"11","author":"Z Zhang","year":"2014","unstructured":"Zhang, Z., Xie, X., Geng, N.: Dynamic surgery assignment of multiple operating rooms with planned surgeon arrival times. IEEE Trans. Autom. Sci. Eng. 11(3), 680\u2013691 (2014)","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"issue":"4","key":"20_CR30","first-page":"20","volume":"1","author":"M Zhu","year":"2016","unstructured":"Zhu, M., et al.: Managerial decision-making for daily case allocation scheduling and the impact on perioperative quality assurance. Transl. Perioper. Pain Med. 1(4), 20 (2016)","journal-title":"Transl. Perioper. Pain Med."}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04693-4_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T13:24:43Z","timestamp":1710249883000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04693-4_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030046927","9783030046934"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04693-4_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"29 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Approximation and Online Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Helsinki","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Finland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waoa2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/algo2018.hiit.fi\/waoa\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}