{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T03:31:13Z","timestamp":1778729473297,"version":"3.51.4"},"reference-count":65,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,11,2]],"date-time":"2023-11-02T00:00:00Z","timestamp":1698883200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,2]],"date-time":"2023-11-02T00:00:00Z","timestamp":1698883200000},"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":["Ann Oper Res"],"published-print":{"date-parts":[[2024,7]]},"DOI":"10.1007\/s10479-023-05647-1","type":"journal-article","created":{"date-parts":[[2023,11,2]],"date-time":"2023-11-02T18:01:44Z","timestamp":1698948104000},"page":"741-764","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Robust scheduling in a two-machine re-entrant flow shop to minimise the value-at-risk of the makespan: branch-and-bound and heuristic algorithms based on Markovian activity networks and phase-type distributions"],"prefix":"10.1007","volume":"338","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7132-3961","authenticated-orcid":false,"given":"Lei","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcello","family":"Urgo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,2]]},"reference":[{"issue":"12","key":"5647_CR1","doi-asserted-by":"crossref","first-page":"1404","DOI":"10.3390\/math9121404","volume":"9","author":"A Angius","year":"2021","unstructured":"Angius, A., Horv\u00e1th, A., & Urgo, M. (2021). A kronecker algebra formulation for markov activity networks with phase-type distributions. Mathematics, 9(12), 1404.","journal-title":"Mathematics"},{"issue":"1\u20132","key":"5647_CR2","first-page":"25","volume":"248","author":"S Atakan","year":"2016","unstructured":"Atakan, S., B\u00fclb\u00fcl, K., & Noyan, N. (2016). Minimizing value-at-risk in single-machine scheduling. Annals of Operations Research, 248(1\u20132), 25\u201373.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"5647_CR3","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1016\/j.ejor.2011.07.021","volume":"216","author":"KR Baker","year":"2012","unstructured":"Baker, K. R., & Altheimer, D. (2012). Heuristic solution methods for the stochastic flow shop problem. European Journal of Operational Research, 216(1), 172\u2013177.","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"5647_CR4","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/s10951-010-0219-4","volume":"14","author":"KR Baker","year":"2010","unstructured":"Baker, K. R., & Trietsch, D. (2010). Three heuristic procedures for the stochastic, two-machine flow shop problem. Journal of Scheduling, 14(5), 445\u2013454.","journal-title":"Journal of Scheduling"},{"issue":"2","key":"5647_CR5","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1016\/j.ejor.2021.05.014","volume":"297","author":"AJ Benavides","year":"2022","unstructured":"Benavides, A. J., & Vera, A. (2022). The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem. European Journal of Operational Research, 297(2), 407\u2013421.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"5647_CR6","doi-asserted-by":"crossref","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.","journal-title":"Operations Research"},{"issue":"3","key":"5647_CR7","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1007\/s10687-022-00436-8","volume":"25","author":"M Bladt","year":"2022","unstructured":"Bladt, M., & Yslas, J. (2022). Heavy-tailed phase-type distributions: A unified approach. Extremes, 25(3), 529\u2013565.","journal-title":"Extremes"},{"key":"5647_CR8","unstructured":"Boost. (2020). Boost C++ Libraries. http:\/\/www.boost.org\/."},{"key":"5647_CR9","unstructured":"Butools. (2018). Butools 2.0. http:\/\/webspn.hit.bme.hu\/~telek\/tools\/butools\/doc\/RandomPH.html#butools.ph.RandomPH."},{"issue":"1","key":"5647_CR10","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/j.ejor.2016.06.025","volume":"256","author":"Z Chang","year":"2017","unstructured":"Chang, Z., Song, S., Zhang, Y., Ding, J. Y., Zhang, R., & Chiong, R. (2017). Distributionally robust single machine scheduling with risk aversion. European Journal of Operational Research, 256(1), 261\u2013274.","journal-title":"European Journal of Operational Research"},{"issue":"7","key":"5647_CR11","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1057\/palgrave.jors.2602220","volume":"58","author":"SW Choi","year":"2007","unstructured":"Choi, S. W., & Kim, Y. D. (2007). Minimizing makespan on a two-machine re-entrant flowshop. Journal of the Operational Research Society, 58(7), 972\u2013981.","journal-title":"Journal of the Operational Research Society"},{"issue":"5","key":"5647_CR12","doi-asserted-by":"crossref","first-page":"1684","DOI":"10.1016\/j.cor.2006.09.028","volume":"35","author":"SW Choi","year":"2008","unstructured":"Choi, S. W., & Kim, Y. D. (2008). Minimizing makespan on an m-machine re-entrant flowshop. Computers & Operations Research, 35(5), 1684\u20131696.","journal-title":"Computers & Operations Research"},{"issue":"2","key":"5647_CR13","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/j.ejor.2008.11.037","volume":"199","author":"SW Choi","year":"2009","unstructured":"Choi, S. W., & Kim, Y. D. (2009). Minimizing total tardiness on a two-machine re-entrant flowshop. European Journal of Operational Research, 199(2), 375\u2013384.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"5647_CR14","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1287\/opre.9.2.145","volume":"9","author":"CE Clark","year":"1961","unstructured":"Clark, C. E. (1961). The greatest of a finite set of random variables. Operations Research, 9(2), 145\u2013162.","journal-title":"Operations Research"},{"issue":"1","key":"5647_CR15","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1002\/nav.3800200107","volume":"20","author":"AA Cunningham","year":"1973","unstructured":"Cunningham, A. A., & Dutta, S. K. (1973). Scheduling jobs with exponentially distributed processing times, on two machines of a flow shop. Naval Research Logistics Quarterly, 20(1), 69\u201381.","journal-title":"Naval Research Logistics Quarterly"},{"issue":"3","key":"5647_CR16","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0925-5273(92)90017-2","volume":"28","author":"P De","year":"1992","unstructured":"De, P., Ghosh, J. B., & Wells, C. E. (1992). Expectation-variance analyss of job sequences under processing time uncertainty. International Journal of Production Economics, 28(3), 289\u2013297.","journal-title":"International Journal of Production Economics"},{"issue":"3","key":"5647_CR17","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1002\/(SICI)1099-1425(200005\/06)3:3<155::AID-JOS39>3.0.CO;2-E","volume":"3","author":"E Demirkol","year":"2000","unstructured":"Demirkol, E., & Uzsoy, R. (2000). Decomposition methods for reentrant flow shops with sequence-dependent setup times. Journal of Scheduling, 3(3), 155\u2013177.","journal-title":"Journal of Scheduling"},{"issue":"1\u20132","key":"5647_CR18","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/s10479-019-03214-1","volume":"285","author":"V Dixit","year":"2020","unstructured":"Dixit, V., & Tiwari, M. K. (2020). Project portfolio selection and scheduling optimization based on risk measure: A conditional value at risk approach. Annals of Operations Research, 285(1\u20132), 9\u201333.","journal-title":"Annals of Operations Research"},{"key":"5647_CR19","unstructured":"Djerrah, A., Cun, B. L., Cung, V. D., Roucairol, C. (2006). Bob++: Framework for solving optimization problems with branch-and-bound methods. In 15th IEEE international conference on high performance distributed computing, IEEE"},{"issue":"4","key":"5647_CR20","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1287\/opre.33.4.862","volume":"33","author":"B Dodin","year":"1985","unstructured":"Dodin, B. (1985). Bounding the project completion time distribution in pert networks. Operations Research, 33(4), 862\u2013881.","journal-title":"Operations Research"},{"issue":"9","key":"5647_CR21","doi-asserted-by":"crossref","first-page":"829","DOI":"10.1016\/0305-0548(95)00083-6","volume":"23","author":"B Dodin","year":"1996","unstructured":"Dodin, B. (1996). Determining the optimal sequences and the distributional properties of their completion times in stochastic flow shops. Computers & Operations Research, 23(9), 829\u2013843.","journal-title":"Computers & Operations Research"},{"key":"5647_CR22","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1023\/A:1018927407164","volume":"86","author":"IG Drobouchevitch","year":"1999","unstructured":"Drobouchevitch, I. G., & Strusevich, V. A. (1999). A heuristic algorithm for two-machine re-entrant shop scheduling. Annals of Operations Research, 86, 417\u2013439.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"5647_CR23","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.ejor.2009.06.031","volume":"203","author":"F Dugardin","year":"2010","unstructured":"Dugardin, F., Yalaoui, F., & Amodeo, L. (2010). New multi-objective method to solve reentrant hybrid flow shop scheduling problem. European Journal of Operational Research, 203(1), 22\u201331.","journal-title":"European Journal of Operational Research"},{"key":"5647_CR24","doi-asserted-by":"crossref","unstructured":"Emmons, H., Vairaktarakis, G. (2012). Flow shop scheduling: Theoretical results, algorithms, and applications, vol 182. Springer","DOI":"10.1007\/978-1-4614-5152-5"},{"issue":"3","key":"5647_CR25","doi-asserted-by":"crossref","first-page":"1277","DOI":"10.1111\/itor.12726","volume":"27","author":"C Filippi","year":"2020","unstructured":"Filippi, C., Guastaroba, G., & Speranza, M. G. (2020). Conditional value-at-risk beyond finance: A survey. International Transactions in Operational Research, 27(3), 1277\u20131319.","journal-title":"International Transactions in Operational Research"},{"issue":"2","key":"5647_CR26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/12460125.2000.9736710","volume":"9","author":"M Gourgand","year":"2000","unstructured":"Gourgand, M., Grangeon, N., & Norre, S. (2000). A review of the static stochastic flow-shop scheduling problem. Journal of Decision Systems, 9(2), 1\u201331.","journal-title":"Journal of Decision Systems"},{"issue":"4","key":"5647_CR27","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0272-6963(83)90004-9","volume":"3","author":"SC Graves","year":"1983","unstructured":"Graves, S. C., Meal, H. C., Stefek, D., & Zeghmi, A. H. (1983). Scheduling of re-entrant flow shops. Journal of Operations Management, 3(4), 197\u2013207.","journal-title":"Journal of Operations Management"},{"key":"5647_CR28","unstructured":"Guennebaud, G., Jacob, B., et\u00a0al. (2010). Eigen v3. http:\/\/eigen.tuxfamily.org."},{"key":"5647_CR29","doi-asserted-by":"crossref","unstructured":"Horvath, G., Telek, M. (2017). BuTools 2: A rich toolbox for markovian performance evaluation. In Proceedings of the 10th EAI international conference on performance evaluation methodologies and tools, ACM.","DOI":"10.4108\/eai.25-10-2016.2266400"},{"key":"5647_CR30","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/j.cor.2014.02.002","volume":"47","author":"B Jeong","year":"2014","unstructured":"Jeong, B., & Kim, Y. D. (2014). Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times. Computers & Operations Research, 47, 72\u201380.","journal-title":"Computers & Operations Research"},{"issue":"2","key":"5647_CR31","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1007\/s10479-021-04142-9","volume":"320","author":"AA Juan","year":"2023","unstructured":"Juan, A. A., Keenan, P., Mart\u00ed, R., McGarraghy, S., Panadero, J., Carroll, P., & Oliva, D. (2023). A review of the role of heuristics in stochastic optimisation: From metaheuristics to learnheuristics. Annals of Operations Research, 320(2), 831\u2013861.","journal-title":"Annals of Operations Research"},{"key":"5647_CR32","doi-asserted-by":"crossref","unstructured":"Juvin, C., Houssin, L., Lopez, P. (2023). Constraint programming for the robust two-machine flow-shop scheduling problem with budgeted uncertainty. In 20th international conference on the integration of constraint programming, artificial intelligence, and operations research (CPAIOR).","DOI":"10.1007\/978-3-031-33271-5_23"},{"issue":"5","key":"5647_CR33","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1007\/s10951-019-00599-6","volume":"22","author":"A Kasperski","year":"2019","unstructured":"Kasperski, A., & Zieli\u0144ski, P. (2019). Risk-averse single machine scheduling: Complexity and approximation. Journal of Scheduling, 22(5), 567\u2013580.","journal-title":"Journal of Scheduling"},{"issue":"5","key":"5647_CR34","first-page":"421","volume":"32","author":"P Kouvelis","year":"2000","unstructured":"Kouvelis, P., Daniels, R. L., & Vairaktarakis, G. (2000). Robust scheduling of a two-machine flow shop with uncertain processing times. IIE Transactions, 32(5), 421\u2013432.","journal-title":"IIE Transactions"},{"issue":"5","key":"5647_CR35","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1287\/opre.34.5.769","volume":"34","author":"VG Kulkarni","year":"1986","unstructured":"Kulkarni, V. G., & Adlakha, V. (1986). Markov and markov-regenerative pert networks. Operations Research, 34(5), 769\u2013781.","journal-title":"Operations Research"},{"issue":"9","key":"5647_CR36","first-page":"1105","volume":"56","author":"CK Lee","year":"2011","unstructured":"Lee, C. K., Lin, D., Ho, W., & Wu, Z. (2011). Design of a genetic algorithm for bi-objective flow shop scheduling problems with re-entrant jobs. The International Journal of Advanced Manufacturing Technology, 56(9), 1105\u20131113.","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"issue":"1","key":"5647_CR37","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/j.ejor.2021.10.021","volume":"300","author":"M Levorato","year":"2022","unstructured":"Levorato, M., Figueiredo, R., & Frota, Y. (2022). Exact solutions for the two-machine robust flow shop with budgeted uncertainty. European Journal of Operational Research, 300(1), 46\u201357.","journal-title":"European Journal of Operational Research"},{"key":"5647_CR38","unstructured":"Liu, L., Urgo, M. (2022a). A branch and bound approach for stochastic 2-machine flow shop scheduling with rework. In 18th international conference on project management and scheduling."},{"issue":"6","key":"5647_CR39","doi-asserted-by":"crossref","first-page":"3034","DOI":"10.3390\/app12063034","volume":"12","author":"L Liu","year":"2022","unstructured":"Liu, L., & Urgo, M. (2022). A robust scheduling framework for re-manufacturing activities of turbine blades. Applied Sciences, 12(6), 3034.","journal-title":"Applied Sciences"},{"key":"5647_CR40","first-page":"63","volume":"2","author":"L Liu","year":"2023","unstructured":"Liu, L., & Urgo, M. (2023). A branch-and-bound approach to minimise the value-at-risk of the makespan in a stochastic two-machine flow shop. International Journal of Production Research., 2, 63.","journal-title":"International Journal of Production Research."},{"key":"5647_CR41","doi-asserted-by":"crossref","unstructured":"Louren\u00e7o, H.R., Martin, O.C., St\u00fctzle, T. (2019). Iterated local search: Framework and applications. In Handbook of metaheuristics (pp. 129\u2013168) Springer.","DOI":"10.1007\/978-3-319-91086-4_5"},{"issue":"2","key":"5647_CR42","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1016\/j.ejor.2010.05.043","volume":"207","author":"C Ma","year":"2010","unstructured":"Ma, C., & Wong, W. K. (2010). Stochastic dominance and risk measure: A decision-theoretic foundation for var and c-var. European Journal of Operational Research, 207(2), 927\u2013935.","journal-title":"European Journal of Operational Research"},{"key":"5647_CR43","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jmsy.2015.10.001","volume":"37","author":"M Manzini","year":"2015","unstructured":"Manzini, M., & Urgo, M. (2015). Makespan estimation of a production process affected by uncertainty: Application on mto production of nc machine tools. Journal of Manufacturing Systems, 37, 1\u201316.","journal-title":"Journal of Manufacturing Systems"},{"key":"5647_CR44","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/j.jmsy.2017.11.006","volume":"46","author":"M Manzini","year":"2018","unstructured":"Manzini, M., & Urgo, M. (2018). A risk based approach to support the supplying of components in a mto assembly process. Journal of Manufacturing Systems, 46, 67\u201378.","journal-title":"Journal of Manufacturing Systems"},{"issue":"3","key":"5647_CR45","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1007\/s10696-019-09358-3","volume":"32","author":"C Meloni","year":"2020","unstructured":"Meloni, C., & Pranzo, M. (2020). Expected shortfall for the makespan in activity networks under imperfect information. Flexible Services and Manufacturing Journal, 32(3), 668\u2013692.","journal-title":"Flexible Services and Manufacturing Journal"},{"issue":"1","key":"5647_CR46","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M Nawaz","year":"1983","unstructured":"Nawaz, M., Enscore, E. E., Jr., & Ham, I. (1983). A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega, 11(1), 91\u201395.","journal-title":"Omega"},{"key":"5647_CR47","unstructured":"Neuts, M. F. (1994). Matrix-geometric solutions in stochastic models: an algorithmic approach. Courier Corporation."},{"issue":"6","key":"5647_CR48","doi-asserted-by":"crossref","first-page":"642","DOI":"10.1057\/palgrave.jors.2601556","volume":"54","author":"JH Pan","year":"2003","unstructured":"Pan, J. H., & Chen, J. S. (2003). Minimizing makespan in re-entrant permutation flow-shops. Journal of the Operational Research Society, 54(6), 642\u2013653.","journal-title":"Journal of the Operational Research Society"},{"key":"5647_CR49","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-26580-3","volume-title":"Scheduling: Theory, algorithms, and systems","author":"M Pinedo","year":"2016","unstructured":"Pinedo, M. (2016). Scheduling: Theory, algorithms, and systems. Springer."},{"key":"5647_CR50","volume-title":"Stochastic processes","author":"SM Ross","year":"1996","unstructured":"Ross, S. M., Kelly, J. J., Sullivan, R. J., Perry, W. J., Mercer, D., Davis, R. M., Washburn, T. D., Sager, E. V., Boyce, J. B., & Bristow, V. L. (1996). Stochastic processes (Vol. 2). New York: Wiley."},{"issue":"3","key":"5647_CR51","doi-asserted-by":"crossref","first-page":"2033","DOI":"10.1016\/j.ejor.2005.12.009","volume":"177","author":"R Ruiz","year":"2007","unstructured":"Ruiz, R., & St\u00fctzle, T. (2007). A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research, 177(3), 2033\u20132049.","journal-title":"European Journal of Operational Research"},{"key":"5647_CR52","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511778032","volume-title":"Stochastic scheduling: Expectation-variance analysis of a schedule","author":"SC Sarin","year":"2010","unstructured":"Sarin, S. C., Nagarajan, B., & Liao, L. (2010). Stochastic scheduling: Expectation-variance analysis of a schedule. Cambridge University Press."},{"issue":"1","key":"5647_CR53","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10951-013-0349-6","volume":"17","author":"SC Sarin","year":"2014","unstructured":"Sarin, S. C., Sherali, H. D., & Liao, L. (2014). Minimizing conditional-value-at-risk for stochastic scheduling problems. Journal of Scheduling, 17(1), 5\u201315.","journal-title":"Journal of Scheduling"},{"issue":"3","key":"5647_CR54","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/S0167-9473(98)00062-0","volume":"29","author":"RB Sidje","year":"1999","unstructured":"Sidje, R. B., & Stewart, W. J. (1999). A numerical study of large sparse matrix exponentials arising in markov chains. Computational Statistics & Data Analysis, 29(3), 345\u2013368.","journal-title":"Computational Statistics & Data Analysis"},{"issue":"2","key":"5647_CR55","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E Taillard","year":"1993","unstructured":"Taillard, E. (1993). Benchmarks for basic scheduling problems. European Journal of Operational Research, 64(2), 278\u2013285.","journal-title":"European Journal of Operational Research"},{"issue":"3\u20134","key":"5647_CR56","first-page":"93","volume":"9","author":"P Talwar","year":"1967","unstructured":"Talwar, P. (1967). A note on sequencing problems with uncertain job times. Journal of the Operations Research Society of Japan, 9(3\u20134), 93\u201397.","journal-title":"Journal of the Operations Research Society of Japan"},{"issue":"1","key":"5647_CR57","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/j.jeconom.2011.06.013","volume":"166","author":"A Tetenov","year":"2012","unstructured":"Tetenov, A. (2012). Statistical treatment choice based on asymmetric minimax regret criteria. Journal of Econometrics, 166(1), 157\u2013165.","journal-title":"Journal of Econometrics"},{"issue":"2","key":"5647_CR58","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/j.jmsy.2012.12.003","volume":"32","author":"T Tolio","year":"2013","unstructured":"Tolio, T., & Urgo, M. (2013). Design of flexible transfer lines: A case-based reconfiguration cost assessment. Journal of Manufacturing Systems, 32(2), 325\u2013334.","journal-title":"Journal of Manufacturing Systems"},{"issue":"1","key":"5647_CR59","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1016\/j.cirp.2011.03.047","volume":"60","author":"T Tolio","year":"2011","unstructured":"Tolio, T., Urgo, M., & V\u00e1ncza, J. (2011). Robust production control against propagation of disruptions. CIRP Annals, 60(1), 489\u2013492.","journal-title":"CIRP Annals"},{"key":"5647_CR60","unstructured":"Urgo, M. (2014). Stochastic scheduling with general distributed activity durations using markov activity networks and phase-type distributions. Nova"},{"key":"5647_CR61","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/j.cie.2019.01.002","volume":"129","author":"M Urgo","year":"2019","unstructured":"Urgo, M. (2019). A branch-and-bound approach to schedule a no-wait flow shop to minimize the cvar of the residual work content. Computers & Industrial Engineering, 129, 67\u201375.","journal-title":"Computers & Industrial Engineering"},{"issue":"2","key":"5647_CR62","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1007\/s10696-018-9316-z","volume":"31","author":"M Urgo","year":"2019","unstructured":"Urgo, M., & V\u00e1ncza, J. (2019). A branch-and-bound approach for the single machine maximum lateness stochastic scheduling problem to minimize the value-at-risk. Flexible Services and Manufacturing Journal, 31(2), 472\u2013496.","journal-title":"Flexible Services and Manufacturing Journal"},{"issue":"11","key":"5647_CR63","doi-asserted-by":"crossref","first-page":"1157","DOI":"10.1007\/s00170-003-1961-y","volume":"25","author":"L Wang","year":"2005","unstructured":"Wang, L., Zhang, L., & Zheng, D. Z. (2005). A class of hypothesis-test-based genetic algorithms for flow shop scheduling with stochastic processing time. The International Journal of Advanced Manufacturing Technology, 25(11), 1157\u20131163.","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"issue":"1","key":"5647_CR64","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1007\/s00170-004-2154-z","volume":"27","author":"L Wang","year":"2005","unstructured":"Wang, L., Zhang, L., & Zheng, D. Z. (2005). Genetic ordinal optimisation for stochastic flow shop scheduling. The International Journal of Advanced Manufacturing Technology, 27(1), 166\u2013173.","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"issue":"2","key":"5647_CR65","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1016\/j.ejor.2019.09.036","volume":"282","author":"TS Yu","year":"2020","unstructured":"Yu, T. S., & Pinedo, M. (2020). Flow shops with reentry: Reversibility properties and makespan optimal schedules. European Journal of Operational Research, 282(2), 478\u2013490.","journal-title":"European Journal of Operational Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-023-05647-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-023-05647-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-023-05647-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,15]],"date-time":"2024-07-15T16:25:13Z","timestamp":1721060713000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-023-05647-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,2]]},"references-count":65,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["5647"],"URL":"https:\/\/doi.org\/10.1007\/s10479-023-05647-1","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11,2]]},"assertion":[{"value":"18 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 October 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 November 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}