{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T22:30:40Z","timestamp":1772317840000,"version":"3.50.1"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,2,7]],"date-time":"2023-02-07T00:00:00Z","timestamp":1675728000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,2,7]],"date-time":"2023-02-07T00:00:00Z","timestamp":1675728000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s10951-022-00775-1","type":"journal-article","created":{"date-parts":[[2023,2,7]],"date-time":"2023-02-07T20:33:45Z","timestamp":1675802025000},"page":"169-191","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty"],"prefix":"10.1007","volume":"26","author":[{"given":"Fran\u00e7ois","family":"Clautiaux","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0554-1407","authenticated-orcid":false,"given":"Boris","family":"Detienne","sequence":"additional","affiliation":[]},{"given":"Henri","family":"Lefebvre","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,7]]},"reference":[{"issue":"2","key":"775_CR1","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1016\/0377-2217(93)E0318-R","volume":"81","author":"A Allahverdi","year":"1995","unstructured":"Allahverdi, A., & Mittenthal, J. (1995). Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function. European Journal of Operational Research, 81(2), 376\u2013387. https:\/\/doi.org\/10.1016\/0377-2217(93)E0318-R.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"775_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. https:\/\/doi.org\/10.1016\/j.orl.2007.11.005.","journal-title":"Operations Research Letters"},{"issue":"2","key":"775_CR3","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1287\/ijoc.2021.1061","volume":"34","author":"AN Arslan","year":"2022","unstructured":"Arslan, A. N., & Detienne, B. (2022). Decomposition-Based Approaches for a Class of Two-Stage Robust Binary Optimization Problems. INFORMS Journal on Computing, 34(2), 857\u2013871. https:\/\/doi.org\/10.1287\/ijoc.2021.1061.","journal-title":"INFORMS Journal on Computing"},{"issue":"2","key":"775_CR4","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s10287-016-0249-2","volume":"13","author":"J Ayoub","year":"2016","unstructured":"Ayoub, J., & Poss, M. (2016). Decomposition for adjustable robust linear optimization subject to uncertainty polytope. Computational Management Science, 13(2), 219\u2013239.","journal-title":"Computational Management Science"},{"issue":"1","key":"775_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(01)00353-8","volume":"144","author":"P Baptiste","year":"2003","unstructured":"Baptiste, P., Peridy, L., & Pinson, E. (2003). A branch and bound to minimize the number of late jobs on a single machine with release time constraints. European Journal of Operational Research, 144(1), 1\u201311. https:\/\/doi.org\/10.1016\/S0377-2217(01)00353-8.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"775_CR6","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.ejor.2017.02.007","volume":"261","author":"P Bendotti","year":"2017","unstructured":"Bendotti, P., Chr\u00e9tienne, P., Fouilhoux, P., & Quilliot, A. (2017). Anchored reactive and proactive solutions to the cpm-scheduling problem. European Journal of Operational Research, 261(1), 67\u201374. https:\/\/doi.org\/10.1016\/j.ejor.2017.02.007.","journal-title":"European Journal of Operational Research"},{"issue":"12","key":"775_CR7","doi-asserted-by":"publisher","first-page":"2751","DOI":"10.1109\/TAC.2010.2049764","volume":"55","author":"D Bertsimas","year":"2010","unstructured":"Bertsimas, D., & Caramanis, C. (2010). Finite adaptability in multistage linear optimization. IEEE Transactions on Automatic Control, 55(12), 2751\u20132766. https:\/\/doi.org\/10.1109\/TAC.2010.2049764.","journal-title":"IEEE Transactions on Automatic Control"},{"issue":"3","key":"775_CR8","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1287\/opre.2015.1365","volume":"63","author":"D Bertsimas","year":"2015","unstructured":"Bertsimas, D., & Georghiou, A. (2015). Design of near optimal decision rules in multistage adaptive mixed-integer optimization. Operations Research, 63(3), 610\u2013627.","journal-title":"Operations Research"},{"issue":"1","key":"775_CR9","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1109\/TPWRS.2012.2205021","volume":"28","author":"D Bertsimas","year":"2013","unstructured":"Bertsimas, D., Litvinov, E., Sun, X. A., Zhao, J., & Zheng, T. (2013). Adaptive robust optimization for the security constrained unit commitment problem. IEEE Transactions on Power Systems, 28(1), 52\u201363.","journal-title":"IEEE Transactions on Power Systems"},{"issue":"5","key":"775_CR10","doi-asserted-by":"publisher","first-page":"1218","DOI":"10.1287\/opre.2013.1200","volume":"61","author":"D Bertsimas","year":"2013","unstructured":"Bertsimas, D., Nasrabadi, E., & Stiller, S. (2013). Robust and adaptive network flows. Operations Research, 61(5), 1218\u20131242. https:\/\/doi.org\/10.1287\/opre.2013.1200.","journal-title":"Operations Research"},{"issue":"1","key":"775_CR11","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. (2004). The price of robustness. Operations Research, 52(1), 35\u201353. https:\/\/doi.org\/10.1287\/opre.1030.0065.","journal-title":"Operations Research"},{"issue":"5","key":"775_CR12","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1002\/1520-6750(199010)37:5<661::AID-NAV3220370506>3.0.CO;2-3","volume":"37","author":"J Birge","year":"1990","unstructured":"Birge, J., Frenk, J. B. G., Mittenthal, J., & Kan, A. H. G. R. (1990). Single-machine scheduling subject to stochastic breakdowns. Naval Research Logistics (NRL), 37(5), 661\u2013677.","journal-title":"Naval Research Logistics (NRL)"},{"key":"775_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2018.07.001","author":"M Bougeret","year":"2018","unstructured":"Bougeret, M., Pessoa, A., & Poss, M. (2018). Robust scheduling with budgeted uncertainty. Discrete Applied Mathematics. https:\/\/doi.org\/10.1016\/j.dam.2018.07.001.","journal-title":"Discrete Applied Mathematics"},{"issue":"5","key":"775_CR14","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1016\/j.orl.2020.07.006","volume":"48","author":"M Claus","year":"2020","unstructured":"Claus, M., & Simmoteit, M. (2020). A note on $$\\sigma _2^p$$-completeness of a robust binary linear program with binary uncertainty set. Operations Research Letters, 48(5), 594\u2013598. https:\/\/doi.org\/10.1016\/j.orl.2020.07.006.","journal-title":"Operations Research Letters"},{"issue":"1","key":"775_CR15","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/0377-2217(94)00116-T","volume":"81","author":"S Dauz\u00e8re-P\u00e9r\u00e8s","year":"1995","unstructured":"Dauz\u00e8re-P\u00e9r\u00e8s, S. (1995). Minimizing late jobs in the general one machine scheduling problem. European Journal of Operational Research, 81(1), 134\u2013142. https:\/\/doi.org\/10.1016\/0377-2217(94)00116-T.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"775_CR16","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1002\/nav.10056","volume":"50","author":"S Dauz\u00e8re-P\u00e9r\u00e8s","year":"2003","unstructured":"Dauz\u00e8re-P\u00e9r\u00e8s, S., & Sevaux, M. (2003). Using lagrangean relaxation to minimize the weighted number of late jobs. Naval Research Logistics, 50(3), 273\u2013288. https:\/\/doi.org\/10.1002\/nav.10056.","journal-title":"Naval Research Logistics"},{"key":"775_CR17","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1016\/j.ejor.2013.10.052","volume":"235","author":"B Detienne","year":"2014","unstructured":"Detienne, B. (2014). A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints. European Journal of Operational Research, 235, 540\u2013552.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"775_CR18","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E. D., & Mor\u00e9, J. J. (2002). Benchmarking optimization software with performance profiles. Mathematical Programming, 91(2), 201\u2013213. https:\/\/doi.org\/10.1007\/s101070100263.","journal-title":"Mathematical Programming"},{"key":"775_CR19","doi-asserted-by":"publisher","first-page":"A87","DOI":"10.1051\/0004-6361\/201628577","volume":"604","author":"A Garcia-Piquer","year":"2017","unstructured":"Garcia-Piquer, A., Morales, J. C., Ribas, I., Colom\u00e9, J., Gu\u00e0rdia, J., Perger, M., et al. (2017). Efficient scheduling of astronomical observations - Application to the CARMENES radial-velocity survey. Astronomy & Astrophysics, 604, A87. https:\/\/doi.org\/10.1051\/0004-6361\/201628577.","journal-title":"Astronomy & Astrophysics"},{"key":"775_CR20","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2018.1835","author":"A Georghiou","year":"2019","unstructured":"Georghiou, A., Tsoukalas, A., & Wiesemann, W. (2019). Robust dual dynamic programming. Operations Research. https:\/\/doi.org\/10.1287\/opre.2018.1835.","journal-title":"Operations Research"},{"key":"775_CR21","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume-title":"Discrete optimization II, Annals of discrete mathematics","author":"R Graham","year":"1979","unstructured":"Graham, R., Lawler, E., Lenstra, J., & Kan, A. (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. In P. Hammer, E. Johnson, & B. Korte (Eds.), Discrete optimization II, Annals of discrete mathematics (Vol. 5, pp. 287\u2013326). Elsevier. https:\/\/doi.org\/10.1016\/S0167-5060(08)70356-X."},{"issue":"4","key":"775_CR22","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1287\/opre.2015.1392","volume":"63","author":"GA Hanasusanto","year":"2015","unstructured":"Hanasusanto, G. A., Kuhn, D., & Wiesemann, W. (2015). K-adaptability in two-stage robust binary programming. Operations Research, 63(4), 877\u2013891. https:\/\/doi.org\/10.1287\/opre.2015.1392.","journal-title":"Operations Research"},{"key":"775_CR23","unstructured":"Jackson, J. (1955). Scheduling a production line to minimize maximum tardiness. Office of Technical Services: Research report."},{"issue":"3","key":"775_CR24","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1016\/j.ejor.2013.09.028","volume":"234","author":"R Jiang","year":"2014","unstructured":"Jiang, R., Zhang, M., Li, G., & Guan, Y. (2014). Two-stage network constrained robust unit commitment problem. European Journal of Operational Research, 234(3), 751\u2013762.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"775_CR25","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1287\/opre.26.1.121","volume":"26","author":"H Kise","year":"1978","unstructured":"Kise, H., Ibaraki, T., & Mine, H. (1978). A solvable case of the one-machine scheduling problem with ready and due times. Operations Research, 26(1), 121\u2013126. https:\/\/doi.org\/10.1287\/opre.26.1.121.","journal-title":"Operations Research"},{"issue":"5","key":"775_CR26","doi-asserted-by":"publisher","first-page":"1646","DOI":"10.1002\/aic.15183","volume":"62","author":"NH Lappas","year":"2016","unstructured":"Lappas, N. H., & Gounaris, C. E. (2016). Multi-stage adjustable robust optimization for process scheduling under uncertainty. AIChE Journal, 62(5), 1646\u20131667. https:\/\/doi.org\/10.1002\/aic.15183.","journal-title":"AIChE Journal"},{"issue":"2","key":"775_CR27","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1016\/j.ejor.2005.08.013","volume":"176","author":"R M\u2019Hallah","year":"2007","unstructured":"M\u2019Hallah, R., & Bulfin, R. (2007). Minimizing the weighted number of tardy jobs on a single machine with release dates. European Journal of Operational Research, 176(2), 727\u2013744. https:\/\/doi.org\/10.1016\/j.ejor.2005.08.013.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"775_CR28","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01448847","volume":"100","author":"JV Neumann","year":"1928","unstructured":"Neumann, J. V. (1928). Zur theorie der gesellschaftsspiele. Mathematische Annalen, 100(1), 295\u2013320.","journal-title":"Zur theorie der gesellschaftsspiele. Mathematische Annalen"},{"issue":"3","key":"775_CR29","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1016\/S0377-2217(02)00438-1","volume":"148","author":"L P\u00e9ridy","year":"2003","unstructured":"P\u00e9ridy, L., Pinson, E., & Rivreau, D. (2003). Using short-term memory to minimize the weighted number of late jobs on a single machine. European Journal of Operational Research, 148(3), 591\u2013603. https:\/\/doi.org\/10.1016\/S0377-2217(02)00438-1.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"775_CR30","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1287\/ijoc.2017.0784","volume":"30","author":"A Pessoa","year":"2018","unstructured":"Pessoa, A., Sadykov, R., Uchoa, E., & Vanderbeck, F. (2018). Automation and combination of linear-programming based stabilization techniques in column generation. INFORMS Journal on Computing, 30(2), 339\u2013360.","journal-title":"INFORMS Journal on Computing"},{"key":"775_CR31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-26580-3","volume-title":"Scheduling: Theory, algorithms, and systems","author":"ML Pinedo","year":"2016","unstructured":"Pinedo, M. L. (2016). Scheduling: Theory, algorithms, and systems (6th ed.). Springer Publishing Company.","edition":"6"},{"issue":"3","key":"775_CR32","doi-asserted-by":"publisher","first-page":"1284","DOI":"10.1016\/j.ejor.2006.06.078","volume":"189","author":"R Sadykov","year":"2008","unstructured":"Sadykov, R. (2008). A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates. European Journal of Operational Research, 189(3), 1284\u20131304. https:\/\/doi.org\/10.1016\/j.ejor.2006.06.078.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"775_CR33","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1016\/j.ejor.2011.11.005","volume":"219","author":"A Shapiro","year":"2012","unstructured":"Shapiro, A. (2012). Minimax and risk averse multistage stochastic programming. European Journal of Operational Research, 219(3), 719\u2013726. https:\/\/doi.org\/10.1016\/j.ejor.2011.11.005.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"775_CR34","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s12532-019-00174-2","volume":"12","author":"A Subramanyam","year":"2019","unstructured":"Subramanyam, A., Gounaris, C. E., & Wiesemann, W. (2019). K-adaptability in two-stage mixed-integer robust optimization. Mathematical Programming Computation, 12(2), 193\u2013224. https:\/\/doi.org\/10.1007\/s12532-019-00174-2.","journal-title":"Mathematical Programming Computation"},{"issue":"6","key":"775_CR35","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1007\/s10951-018-0559-z","volume":"21","author":"M van den Akker","year":"2018","unstructured":"van den Akker, M., Hoogeveen, H., & Stoef, J. (2018). Combining two-stage stochastic programming and recoverable robustness to minimize the number of late jobs in the case of uncertain processing times. Journal of Scheduling, 21(6), 607\u2013617. https:\/\/doi.org\/10.1007\/s10951-018-0559-z.","journal-title":"Journal of Scheduling"},{"key":"775_CR36","doi-asserted-by":"publisher","unstructured":"van Rooyen, R., Maartens, D. S., & Martinez, P. (2018) Autonomous observation scheduling in astronomy. In: A. B. Peck, R.L. Seaman, C. R. Benn (eds.) Observatory operations: strategies, processes, and systems VII, vol. 10704, pp. 393 \u2013 408. International society for optics and photonics, SPIE. https:\/\/doi.org\/10.1117\/12.2311839.","DOI":"10.1117\/12.2311839"},{"key":"775_CR37","unstructured":"Vanderbeck, F. (2005). Bapcod - a generic branch-and-price code. https:\/\/realopt.bordeaux.inria.fr\/?page_id=2"},{"key":"775_CR38","doi-asserted-by":"publisher","unstructured":"Yang, J., & Yu, G. (2002). On the robust single machine scheduling problem. Journal of Combinatorial Optimization,6(1), 17\u201333. https:\/\/doi.org\/10.1023\/A:1013333232691.","DOI":"10.1023\/A:1013333232691"},{"key":"775_CR39","unstructured":"Zhao, L., & Zeng, B. (2012). Robust unit commitment problem with demand response and wind energy. In Power and Energy Society General Meeting, (pp. 1\u20138) 2012 IEEE, IEEE"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-022-00775-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10951-022-00775-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-022-00775-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,29]],"date-time":"2023-03-29T07:10:18Z","timestamp":1680073818000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10951-022-00775-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,7]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["775"],"URL":"https:\/\/doi.org\/10.1007\/s10951-022-00775-1","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2,7]]},"assertion":[{"value":"21 December 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 February 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}