{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T00:50:56Z","timestamp":1773103856058,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T00:00:00Z","timestamp":1557446400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004281","name":"Narodowe Centrum Nauki","doi-asserted-by":"publisher","award":["2017\/26\/D\/ST6\/00423"],"award-info":[{"award-number":["2017\/26\/D\/ST6\/00423"]}],"id":[{"id":"10.13039\/501100004281","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2020,1]]},"DOI":"10.1007\/s10479-019-03263-6","type":"journal-article","created":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T13:42:26Z","timestamp":1557495746000},"page":"263-282","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Robust min\u2013max regret scheduling to minimize the weighted number of late jobs with interval processing times"],"prefix":"10.1007","volume":"284","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8999-8748","authenticated-orcid":false,"given":"Maciej","family":"Drwal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jerzy","family":"J\u00f3zefczyk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,10]]},"reference":[{"issue":"2","key":"3263_CR1","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/j.ejor.2008.09.012","volume":"197","author":"H Aissi","year":"2009","unstructured":"Aissi, H., Bazgan, C., & Vanderpooten, D. (2009). Min\u2013max and min\u2013max regret versions of combinatorial optimization problems: A survey. European Journal of Operational Research, 197(2), 427\u2013438.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"3263_CR2","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., & Della Croce, F. (2008). Complexity of single machine scheduling problems under scenario-based uncertainty. Operations Research Letters, 36(3), 338\u2013342.","journal-title":"Operations Research Letters"},{"issue":"2","key":"3263_CR3","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/PL00011424","volume":"90","author":"I Averbakh","year":"2001","unstructured":"Averbakh, I. (2001). On the complexity of a class of combinatorial optimization problems with uncertainty. Mathematical Programming, 90(2), 263\u2013272.","journal-title":"Mathematical Programming"},{"key":"3263_CR4","doi-asserted-by":"publisher","DOI":"10.1515\/9781400831050","volume-title":"Robust optimization","author":"A Ben-Tal","year":"2009","unstructured":"Ben-Tal, A., El Ghaoui, L., & Nemirovski, A. (2009). Robust optimization. Princeton: Princeton University Press."},{"issue":"3","key":"3263_CR5","doi-asserted-by":"publisher","first-page":"740","DOI":"10.1016\/j.ejor.2003.10.026","volume":"162","author":"D Biskup","year":"2005","unstructured":"Biskup, D., & Feldmann, M. (2005). On scheduling around large restrictive common due windows. European Journal of Operational Research, 162(3), 740\u2013761.","journal-title":"European Journal of Operational Research"},{"key":"3263_CR6","volume-title":"Scheduling algorithms","author":"P Brucker","year":"2007","unstructured":"Brucker, P. (2007). Scheduling algorithms. Berlin: Springer."},{"issue":"1","key":"3263_CR7","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s10479-007-0176-2","volume":"153","author":"B Colson","year":"2007","unstructured":"Colson, B., Marcotte, P., & Savard, G. (2007). An overview of bilevel optimization. Annals of Operations Research, 153(1), 235\u2013256.","journal-title":"Annals of Operations Research"},{"issue":"4","key":"3263_CR8","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.disopt.2010.03.008","volume":"7","author":"VG Deineko","year":"2010","unstructured":"Deineko, V. G., & Woeginger, G. J. (2010). Pinpointing the complexity of the interval min\u2013max regret Knapsack problem. Discrete Optimization, 7(4), 191\u2013196.","journal-title":"Discrete Optimization"},{"key":"3263_CR9","doi-asserted-by":"crossref","unstructured":"Drwal, M. (2017). Min\u2013max regret scheduling to minimize the total weight of late jobs with interval uncertainty. In International conference on optimization and decision science (pp. 611\u2013619). Springer.","DOI":"10.1007\/978-3-319-67308-0_61"},{"key":"3263_CR10","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.cor.2017.10.010","volume":"91","author":"M Drwal","year":"2018","unstructured":"Drwal, M. (2018). Robust scheduling to minimize the number of late jobs with interval due-date uncertainty. Computers & Operations Research, 91, 13\u201320.","journal-title":"Computers & Operations Research"},{"issue":"3","key":"3263_CR11","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1016\/j.orl.2016.03.005","volume":"44","author":"M Drwal","year":"2016","unstructured":"Drwal, M., & Rischke, R. (2016). Complexity of interval minmax regret scheduling on parallel identical machines with total completion time criterion. Operations Research Letters, 44(3), 354\u2013358.","journal-title":"Operations Research Letters"},{"issue":"2","key":"3263_CR12","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1287\/ijoc.2014.0632","volume":"27","author":"F Furini","year":"2015","unstructured":"Furini, F., Iori, M., Martello, S., & Yagiura, M. (2015). Heuristic and exact algorithms for the interval min\u2013max regret Knapsack problem. INFORMS Journal on Computing, 27(2), 392\u2013405.","journal-title":"INFORMS Journal on Computing"},{"key":"3263_CR13","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-319-49487-6_8","volume-title":"Algorithm engineering","author":"M Goerigk","year":"2016","unstructured":"Goerigk, M., & Sch\u00f6bel, A. (2016). Algorithm engineering in robust optimization. In L. Kliemann & P. Sanders (Eds.), Algorithm engineering (pp. 245\u2013279). Berlin: Springer."},{"issue":"1","key":"3263_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(01)00181-3","volume":"139","author":"V Gordon","year":"2002","unstructured":"Gordon, V., Proth, J. M., & Chu, C. (2002). A survey of the state-of-the-art of common due date assignment and scheduling research. European Journal of Operational Research, 139(1), 1\u201325.","journal-title":"European Journal of Operational Research"},{"key":"3263_CR15","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham, R. L., Lawler, E. L., Lenstra, J. K., & Kan, A. R. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"issue":"2","key":"3263_CR16","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.ejor.2004.04.002","volume":"165","author":"W Herroelen","year":"2005","unstructured":"Herroelen, W., & Leus, R. (2005). Project scheduling under uncertainty: Survey and research potentials. European Journal of Operational Research, 165(2), 289\u2013306.","journal-title":"European Journal of Operational Research"},{"key":"3263_CR17","unstructured":"Karp, R. M. (1972). Reducibility among combinatorial problems. In R. E. Miller, J. W. Thatcher & J. D. Bohlinger (Eds.), Complexity of computer computations (pp. 85\u2013103). Berlin: Springer."},{"key":"3263_CR18","volume-title":"Discrete optimization with interval data: Minmax regret and fuzzy approach","author":"A Kasperski","year":"2008","unstructured":"Kasperski, A. (2008). Discrete optimization with interval data: Minmax regret and fuzzy approach. Berlin: Springer."},{"key":"3263_CR19","first-page":"159","volume-title":"Sequencing and scheduling with inaccurate data","author":"A Kasperski","year":"2014","unstructured":"Kasperski, A., & Zielinski, P. (2014). Minmax (regret) scheduling problems. In Y. Sotskov & F. Werner (Eds.), Sequencing and scheduling with inaccurate data (pp. 159\u2013210). New York: Nova Publishers."},{"key":"3263_CR20","unstructured":"Kasperski, A., & Zieli\u0144ski, P. (2016). Robust discrete optimization under discrete and interval uncertainty: A survey. In M. Doumpos, C. Zopounidis & E. Grigoroudis (Eds.), Robustness analysis in decision aiding, optimization, and analytics (pp. 113\u2013143). Berlin: Springer."},{"key":"3263_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2620-6","volume-title":"Robust discrete optimization and its applications","author":"P Kouvelis","year":"1997","unstructured":"Kouvelis, P., & Yu, G. (1997). Robust discrete optimization and its applications. Berlin: Springer."},{"issue":"15","key":"3263_CR22","doi-asserted-by":"publisher","first-page":"2167","DOI":"10.1016\/j.dam.2005.04.015","volume":"154","author":"V Lebedev","year":"2006","unstructured":"Lebedev, V., & Averbakh, I. (2006). Complexity of minimizing the total flow time with interval data and minmax regret criterion. Discrete Applied Mathematics, 154(15), 2167\u20132177.","journal-title":"Discrete Applied Mathematics"},{"issue":"4\u20135","key":"3263_CR23","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1016\/j.compchemeng.2007.03.001","volume":"32","author":"Z Li","year":"2008","unstructured":"Li, Z., & Ierapetritou, M. (2008). Process scheduling under uncertainty: Review and challenges. Computers & Chemical Engineering, 32(4\u20135), 715\u2013727.","journal-title":"Computers & Chemical Engineering"},{"key":"3263_CR24","unstructured":"Milnor, J. (1951). Games against nature. Technical report, DTIC Document"},{"issue":"2","key":"3263_CR25","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/s10852-006-9044-3","volume":"6","author":"R Montemanni","year":"2007","unstructured":"Montemanni, R. (2007). A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data. Journal of Mathematical Modelling and Algorithms, 6(2), 287\u2013296.","journal-title":"Journal of Mathematical Modelling and Algorithms"},{"issue":"6","key":"3263_CR26","doi-asserted-by":"publisher","first-page":"1886","DOI":"10.1016\/j.cor.2008.06.001","volume":"36","author":"G Mosheiov","year":"2009","unstructured":"Mosheiov, G., & Sarig, A. (2009). Minmax scheduling problems with a common due-window. Computers & Operations Research, 36(6), 1886\u20131892.","journal-title":"Computers & Operations Research"},{"issue":"3","key":"3263_CR27","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1287\/opre.31.3.559","volume":"31","author":"M Pinedo","year":"1983","unstructured":"Pinedo, M. (1983). Stochastic scheduling with release dates and due dates. Operations Research, 31(3), 559\u2013572.","journal-title":"Operations Research"},{"issue":"3","key":"3263_CR28","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1016\/j.mcm.2009.03.006","volume":"50","author":"YN Sotskov","year":"2009","unstructured":"Sotskov, Y. N., Egorova, N. G., & Lai, T. C. (2009). Minimizing total weighted flow time of a set of jobs with interval processing times. Mathematical and Computer Modelling, 50(3), 556\u2013573.","journal-title":"Mathematical and Computer Modelling"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-019-03263-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-019-03263-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-019-03263-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,8]],"date-time":"2020-05-08T19:20:01Z","timestamp":1588965601000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-019-03263-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,10]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["3263"],"URL":"https:\/\/doi.org\/10.1007\/s10479-019-03263-6","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,5,10]]},"assertion":[{"value":"10 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}