{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,9]],"date-time":"2024-04-09T06:35:21Z","timestamp":1712644521538},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2021,7,28]],"date-time":"2021-07-28T00:00:00Z","timestamp":1627430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,7,28]],"date-time":"2021-07-28T00:00:00Z","timestamp":1627430400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-16-CE40-0018"],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"name":"DFG, German Research Foundation","award":["Robuste Online-Algorithmen f\u00fcr Scheduling-und Packungsprobleme\u201d, JA 612\/19-1"]},{"DOI":"10.13039\/501100007493","name":"Fondation Math\u00e9matique Jacques Hadamard","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100007493","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2021,8]]},"DOI":"10.1007\/s00224-020-10024-7","type":"journal-article","created":{"date-parts":[[2021,7,28]],"date-time":"2021-07-28T17:02:46Z","timestamp":1627491766000},"page":"903-915","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Approximation Results for Makespan Minimization with Budgeted Uncertainty"],"prefix":"10.1007","volume":"65","author":[{"given":"Marin","family":"Bougeret","sequence":"first","affiliation":[]},{"given":"Klaus","family":"Jansen","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Poss","sequence":"additional","affiliation":[]},{"given":"Lars","family":"Rohwedder","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,7,28]]},"reference":[{"issue":"3","key":"10024_CR1","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1016\/j.orl.2007.11.005","volume":"36","author":"MA Aloulou","year":"2008","unstructured":"Aloulou, M. A., Croce, F. D.: Complexity of single machine scheduling problems under scenario-based uncertainty. Oper. Res. Lett. 36(3), 338\u2013342 (2008)","journal-title":"Oper. Res. Lett."},{"key":"10024_CR2","doi-asserted-by":"crossref","unstructured":"Basu Roy, A., Bougeret, M., Goldberg, N., Poss, M.: Approximating robust bin-packing with budgeted uncertainty. In: Algorithms and Data Structures Symposium (WADS) 2019, August 5-7 2019, Edmonton, Canada, (2019)","DOI":"10.1007\/978-3-030-24766-9_6"},{"issue":"1-3","key":"10024_CR3","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. 98(1-3), 49\u201371 (2003)","journal-title":"Math. Program."},{"issue":"1","key":"10024_CR4","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1287\/opre.1030.0065","volume":"52","author":"D Bertsimas","year":"2004","unstructured":"Bertsimas, D., Sim, M.: The price of robustness. Oper. Res. 52(1), 35\u201353 (2004)","journal-title":"Oper. Res."},{"key":"10024_CR5","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.dam.2018.07.001","volume":"261","author":"M Bougeret","year":"2019","unstructured":"Bougeret, M., Pessoa, A. A., Poss, M.: Robust scheduling with budgeted uncertainty. Discret. Appl. Math. 261, 93\u2013107 (2019)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"10024_CR6","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1287\/mnsc.41.2.363","volume":"41","author":"RL Daniels","year":"1995","unstructured":"Daniels, R. L., Kouvelis, P.: Robust scheduling to hedge against processing time uncertainty in single-stage production. Manag. Sci. 41(2), 363\u2013376 (1995)","journal-title":"Manag. Sci."},{"issue":"4","key":"10024_CR7","doi-asserted-by":"publisher","first-page":"1371","DOI":"10.1287\/moor.2019.1036","volume":"45","author":"K Jansen","year":"2020","unstructured":"Jansen, K., Klein, K. -M., Verschae, J.: Closing the gap for makespan scheduling via sparsification techniques. Math. Oper. Res. 45(4), 1371\u20131392 (2020)","journal-title":"Math. Oper. Res."},{"issue":"10","key":"10024_CR8","doi-asserted-by":"publisher","first-page":"4134","DOI":"10.1007\/s00453-019-00581-w","volume":"81","author":"K Jansen","year":"2019","unstructured":"Jansen, K., Maack, M.: An eptas for scheduling on unrelated machines of few different types. Algorithmica 81(10), 4134\u20134164 (2019)","journal-title":"Algorithmica"},{"issue":"1","key":"10024_CR9","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.ejor.2011.08.029","volume":"217","author":"A Kasperski","year":"2012","unstructured":"Kasperski, A., Kurpisz, A., Zielinski, P.: Approximating a two-machine flow shop scheduling under discrete scenario uncertainty. Eur. J. Oper. Res. 217(1), 36\u201343 (2012)","journal-title":"Eur. J. Oper. Res."},{"key":"10024_CR10","unstructured":"Kasperski, A., Kurpisz, A., Zielinski, P.: Parallel machine scheduling under uncertainty. In: Advances in Computational Intelligence - 14th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, IPMU 2012, Catania, Italy, July 9-13, 2012, Proceedings, Part IV, pp 74\u201383 (2012)"},{"key":"10024_CR11","doi-asserted-by":"crossref","unstructured":"Kurpisz, A.: Approximation schemes for robust makespan scheduling problems. In: L\u00fcbbecke, M., Koster, A., Letmathe, P., Madlener, R., Peis, B., Walther, G. (eds.) Operations Research Proceedings 2014, pp 327\u2013333. Springer International Publishing, Cham (2016)","DOI":"10.1007\/978-3-319-28697-6_46"},{"issue":"1-3","key":"10024_CR12","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF01585745","volume":"46","author":"JK Lenstra","year":"1990","unstructured":"Lenstra, J. K., Shmoys, D. B., Tardos, E.: Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming 46 (1-3), 259\u2013271 (1990)","journal-title":"Mathematical Programming"},{"key":"10024_CR13","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.tcs.2012.12.006","volume":"477","author":"M Mastrolilli","year":"2013","unstructured":"Mastrolilli, M., Mutsanas, N., Svensson, O.: Single machine scheduling with scenarios. Theor. Comput. Sci. 477, 57\u201366 (2013)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"10024_CR14","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/s10951-015-0418-0","volume":"18","author":"B Tadayon","year":"2015","unstructured":"Tadayon, B., Smith, J. C.: Algorithms and complexity analysis for robust single-machine scheduling problems. J. Scheduling 18(6), 575\u2013592 (2015)","journal-title":"J. Scheduling"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-020-10024-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00224-020-10024-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-020-10024-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,7]],"date-time":"2021-08-07T22:03:15Z","timestamp":1628373795000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00224-020-10024-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,28]]},"references-count":14,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2021,8]]}},"alternative-id":["10024"],"URL":"https:\/\/doi.org\/10.1007\/s00224-020-10024-7","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7,28]]},"assertion":[{"value":"7 December 2020","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 July 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}