{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T10:38:05Z","timestamp":1762252685691,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2018,2,19]],"date-time":"2018-02-19T00:00:00Z","timestamp":1518998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001829","name":"Utrecht University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100001829","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1007\/s10951-018-0559-z","type":"journal-article","created":{"date-parts":[[2018,2,19]],"date-time":"2018-02-19T08:08:31Z","timestamp":1519027711000},"page":"607-617","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Combining two-stage stochastic programming and recoverable robustness to minimize the number of late jobs in the case of uncertain processing times"],"prefix":"10.1007","volume":"21","author":[{"given":"Marjan","family":"van den Akker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8544-8848","authenticated-orcid":false,"given":"Han","family":"Hoogeveen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Judith","family":"Stoef","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,2,19]]},"reference":[{"key":"559_CR1","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.trb.2015.06.001","volume":"79","author":"E \u00c1lvarez-Miranda","year":"2015","unstructured":"\u00c1lvarez-Miranda, E., Fern\u00e1ndez, E., & Ljubic, I. (2015a). The recoverable robust facility location problem. Transportation Research Part B: Methodological, 79, 93\u2013120.","journal-title":"Transportation Research Part B: Methodological"},{"key":"559_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/ijoc.2014.0606","volume":"27","author":"E \u00c1lvarez-Miranda","year":"2015","unstructured":"\u00c1lvarez-Miranda, E., Ljubic, I., Raghavan, S., & Toth, P. (2015b). The recoverable robust two-level network design problem. INFORMS Journal on Computing, 27, 1\u201319.","journal-title":"INFORMS Journal on Computing"},{"key":"559_CR3","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C Barnhart","year":"1998","unstructured":"Barnhart, C., Johnson, E. L., Nemhauser, G. L., Savelsbergh, M. W. P., & Vance, P. H. (1998). Branch-and-price: Column generation for huge integer programs. Operations Research, 46, 316\u2013329.","journal-title":"Operations Research"},{"key":"559_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."},{"key":"559_CR5","volume-title":"Introduction to stochastic programming","author":"J Birge","year":"1997","unstructured":"Birge, J., & Louveaux, F. (1997). Introduction to stochastic programming. New York: Springer."},{"key":"559_CR6","first-page":"215","volume-title":"Algorithms\u2014ESA\u201911. Lecture notes in computer science","author":"PC Bouman","year":"2011","unstructured":"Bouman, P. C., van den Akker, J. M., & Hoogeveen, J. A. (2011). Recoverable robustness by column generation. In C. Demetrescu & M. M. Hald\u00f3rsson (Eds.), Algorithms\u2014ESA\u201911. Lecture notes in computer science (Vol. 6942, pp. 215\u2013226). Berlin: Springer."},{"key":"559_CR7","first-page":"583","volume-title":"Network optimization. Lecture notes in computer science","author":"C B\u00fcsing","year":"2011","unstructured":"B\u00fcsing, C., Koster, A. M. C. A., & Kutschka, M. (2011a). Recoverable robust knapsacks: \n                    \n                      \n                    \n                    $$\\Gamma $$\n                    \n                      \n                        \u0393\n                      \n                    \n                  -scenarios. In J. Pahl, T. Reiners, & S. Vo\u00df (Eds.), Network optimization. Lecture notes in computer science (Vol. 6701, pp. 583\u2013588). Berlin: Springer."},{"key":"559_CR8","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/s11590-011-0307-1","volume":"5","author":"C B\u00fcsing","year":"2011","unstructured":"B\u00fcsing, C., Koster, A. M. C. A., & Kutschka, M. (2011b). Recoverable robust knapsacks: The discrete scenario case. Optimization Letters, 5, 379\u2013392.","journal-title":"Optimization Letters"},{"key":"559_CR9","unstructured":"Cacchiani, V., Caprara, A., Galli, L., Kroon, L., & Mar\u00f3ti, G. (2008). Recoverable robustness for railway rolling stock planning. In OASIcs-OpenAccess series in informatics (Vol. 9). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik. \n                    http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2008\/1590\/pdf\/08002.Cacchiani.1590.pdf"},{"key":"559_CR10","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-3-642-05465-5_2","volume-title":"Robust and online large-scale optimization. Lecture notes in computer science","author":"S Cicerone","year":"2009","unstructured":"Cicerone, S., D\u2019Angelo, G., Di Stefano, G., Frigioni, D., Navarra, A., Schachtebeck, M., et al. (2009). Recoverable robustness in shunting and timetabling. Robust and online large-scale optimization. Lecture notes in computer science (Vol. 5686, pp. 28\u201360). Berlin: Springer."},{"key":"559_CR11","doi-asserted-by":"crossref","unstructured":"Dhamdhere, K., Goyal, V., Ravi, R., & Singh, M. (2005). How to pay, come what may: Approximation algorithms for demand-robust covering problems. In Proceedings of the 46th annual IEEE symposium on foundations of computer science, FOCS\u201905, Washington, DC, USA, 2005 (pp. 367\u2013378). IEEE ComputerSociety.","DOI":"10.1109\/SFCS.2005.42"},{"key":"559_CR12","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., & Rinnooy Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"key":"559_CR13","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/j.orl.2012.05.006","volume":"40","author":"JA Hoogeveen","year":"2012","unstructured":"Hoogeveen, J. A., & T\u2019kindt, V. (2012). Minimizing the number of late jobs when the start time of the machine is variable. Operations Research Letters, 40, 353\u2013355.","journal-title":"Operations Research Letters"},{"key":"559_CR14","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1287\/mnsc.16.1.77","volume":"16","author":"EL Lawler","year":"1969","unstructured":"Lawler, E. L., & Moore, J. M. (1969). A functional equation and its application to resource allocation and sequencing problems. Management Science, 16, 77\u201384.","journal-title":"Management Science"},{"key":"559_CR15","first-page":"1","volume-title":"Robust and online large-scale optimization. Lecture notes in computer science","author":"C Liebchen","year":"2009","unstructured":"Liebchen, C., L\u00fcbbecke, M., M\u00f6hring, R. H., & Stiller, S. (2009). The concept of recoverable robustness, linear programming recovery, and railway applications. Robust and online large-scale optimization. Lecture notes in computer science (Vol. 5686, pp. 1\u201327). Berlin: Springer."},{"key":"559_CR16","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1016\/j.ejor.2005.09.017","volume":"176","author":"Y Lin","year":"2007","unstructured":"Lin, Y., & Wang, X. (2007). Necessary and sufficient conditions of optimality for some classical scheduling problems. European Journal of Operational Research, 176, 809\u2013818.","journal-title":"European Journal of Operational Research"},{"key":"559_CR17","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1287\/mnsc.15.1.102","volume":"15","author":"JM Moore","year":"1968","unstructured":"Moore, J. M. (1968). An \n                    \n                      \n                    \n                    $$n$$\n                    \n                      \n                        n\n                      \n                    \n                   job, one machine sequencing algorithm for minimizing the number of late jobs. Management Science, 15, 102\u2013109.","journal-title":"Management Science"},{"key":"559_CR18","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1287\/opre.33.2.363","volume":"33","author":"CN Potts","year":"1985","unstructured":"Potts, C. N., & van Wassenhove, L. N. (1985). A branch and bound algorithm for the total weighted tardiness problem. Operations Research, 33, 363\u2013377.","journal-title":"Operations Research"},{"key":"559_CR19","unstructured":"Stoef, J. M. J. (2015). Recoverable robustness in scheduling problems. Master thesis at Utrecht University. \n                    http:\/\/dspace.library.uu.nl\/handle\/1874\/319992"},{"key":"559_CR20","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.cor.2017.02.009","volume":"83","author":"DD T\u00f6nissen","year":"2017","unstructured":"T\u00f6nissen, D. D., van den Akker, J. M., & Hoogeveen, J. A. (2017). Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem. Computers and Operations Research, 83, 125\u2013139. (Department of Information and Computing Sciences, Utrecht University).","journal-title":"Computers and Operations Research"},{"key":"559_CR21","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10951-007-0022-z","volume":"11","author":"D Trietsch","year":"2008","unstructured":"Trietsch, D., & Baker, K. R. (2008). Minimizing the number of tardy jobs with stochastically-ordered processing times. Journal of Scheduling, 11, 71\u201373.","journal-title":"Journal of Scheduling"},{"key":"559_CR22","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1016\/j.ejor.2015.12.008","volume":"251","author":"JM Akker van den","year":"2016","unstructured":"van den Akker, J. M., Bouman, P. C., Hoogeveen, J. A., & T\u00f6nissen, D. D. (2016). Decomposition approaches for recoverable robust optimization problems. European Journal of Operational Research, 251, 739\u2013750.","journal-title":"European Journal of Operational Research"},{"key":"559_CR23","first-page":"227","volume-title":"Handbook of scheduling: Algorithms models and performance analysis","author":"JM Akker van den","year":"2004","unstructured":"van den Akker, J. M., & Hoogeveen, J. A. (2004). Minimizing the number of tardy jobs. In J. Y.-T. Leung (Ed.), Handbook of scheduling: Algorithms models and performance analysis (pp. 227\u2013243). Boca Raton: CRC Press."},{"key":"559_CR24","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s10951-007-0034-8","volume":"11","author":"JM Akker van den","year":"2008","unstructured":"van den Akker, J. M., & Hoogeveen, J. A. (2008). Minimizing the number of late jobs in a stochastic setting using a chance constraint. Journal of Scheduling, 11, 59\u201369.","journal-title":"Journal of Scheduling"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-018-0559-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-018-0559-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-018-0559-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,18]],"date-time":"2019-02-18T21:06:46Z","timestamp":1550524006000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-018-0559-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,19]]},"references-count":24,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["559"],"URL":"https:\/\/doi.org\/10.1007\/s10951-018-0559-z","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"type":"print","value":"1094-6136"},{"type":"electronic","value":"1099-1425"}],"subject":[],"published":{"date-parts":[[2018,2,19]]},"assertion":[{"value":"19 February 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}