{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:35:04Z","timestamp":1740123304722,"version":"3.37.3"},"reference-count":83,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,11,10]],"date-time":"2023-11-10T00:00:00Z","timestamp":1699574400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,10]],"date-time":"2023-11-10T00:00:00Z","timestamp":1699574400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100002322","name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","doi-asserted-by":"publisher","award":["88881.187708\/2018-01"],"award-info":[{"award-number":["88881.187708\/2018-01"]}],"id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["301254"],"award-info":[{"award-number":["301254"]}],"id":[{"id":"10.13039\/501100003593","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":[[2024,7]]},"DOI":"10.1007\/s10479-023-05661-3","type":"journal-article","created":{"date-parts":[[2023,11,10]],"date-time":"2023-11-10T08:01:35Z","timestamp":1699603295000},"page":"765-799","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient solutions to the m-machine robust flow shop under budgeted uncertainty"],"prefix":"10.1007","volume":"338","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0095-0319","authenticated-orcid":false,"given":"Mario","family":"Levorato","sequence":"first","affiliation":[]},{"given":"David","family":"Sotelo","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0344-2686","authenticated-orcid":false,"given":"Rosa","family":"Figueiredo","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3434-3074","authenticated-orcid":false,"given":"Yuri","family":"Frota","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,10]]},"reference":[{"issue":"2","key":"5661_CR1","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1016\/j.ejor.2008.09.012","volume":"197","author":"H Aissi","year":"2009","unstructured":"Aissi, H., et al. (2009). Min-max and min-max regret versions of combinatorial optimization problems: A survey. European Journal of Operational Research, 197(2), 427\u2013438. https:\/\/doi.org\/10.1016\/j.ejor.2008.09.012","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"5661_CR2","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1016\/j.ejor.2004.07.073","volume":"169","author":"I Averbakh","year":"2006","unstructured":"Averbakh, I. (2006). The minmax regret permutation flow-shop problem with two jobs. European Journal of Operational Research, 169(3), 761\u2013766. https:\/\/doi.org\/10.1016\/j.ejor.2004.07.073","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"5661_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":"5661_CR4","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/s10951-010-0219-4","volume":"14","author":"KR Baker","year":"2011","unstructured":"Baker, K. R., & Trietsch, D. (2011). Three heuristic procedures for the stochastic, two-machine flow shop problem. Journal of Scheduling, 14(5), 445\u2013454. https:\/\/doi.org\/10.1007\/s10951-010-0219-4","journal-title":"Journal of Scheduling"},{"issue":"1","key":"5661_CR5","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0098-1354(01)00735-9","volume":"26","author":"J Balasubramanian","year":"2002","unstructured":"Balasubramanian, J., & Grossmann, I. E. (2002). A novel branch and bound algorithm for scheduling flowshop plants with uncertain processing times. Computers and Chemical Engineering, 26(1), 41\u201357. https:\/\/doi.org\/10.1016\/S0098-1354(01)00735-9","journal-title":"Computers and Chemical Engineering"},{"key":"5661_CR6","doi-asserted-by":"publisher","unstructured":"Ben-Tal, A., El Ghaoui, L., & Nemirovski, A. (2009). Robust optimization. Princeton Series in Applied Mathematics 28, 1\u2013542. Princeton University Press. https:\/\/doi.org\/10.1515\/9781400831050","DOI":"10.1515\/9781400831050"},{"issue":"3","key":"5661_CR7","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/PL00011380","volume":"88","author":"A Ben-Tal","year":"2000","unstructured":"Ben-Tal, A., & Nemirovski, A. (2000). Robust solutions of linear programming problems contaminated with uncertain data. Mathematical Programming, 88(3), 411\u2013424.","journal-title":"Mathematical Programming"},{"issue":"1","key":"5661_CR8","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"},{"key":"5661_CR9","doi-asserted-by":"crossref","unstructured":"Binato, S., Hery, W., Loewenstern, D., & Resende, M. G. (2002). A grasp for job shop scheduling. Essays and surveys in metaheuristics (pp. 59\u201379). Berlin: Springer.","DOI":"10.1007\/978-1-4615-1507-4_3"},{"key":"5661_CR10","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1016\/j.acme.2018.09.010","volume":"19","author":"W Bozejko","year":"2019","unstructured":"Bozejko, W., Hejducki, Z., & Wodecki, M. (2019). Flowshop scheduling of construction processes with uncertain parameters. Archives of Civil and Mechanical Engineering, 19, 194\u2013204.","journal-title":"Archives of Civil and Mechanical Engineering"},{"issue":"11","key":"5661_CR11","doi-asserted-by":"crossref","first-page":"2706","DOI":"10.1021\/ie00023a037","volume":"32","author":"HM Cartwright","year":"1993","unstructured":"Cartwright, H. M., & Long, R. A. (1993). Simultaneous optimization of chemical flowshop sequencing and topology using genetic algorithms. Industrial & Engineering Chemistry Research, 32(11), 2706\u20132713.","journal-title":"Industrial & Engineering Chemistry Research"},{"issue":"10","key":"5661_CR12","doi-asserted-by":"publisher","first-page":"1760","DOI":"10.3390\/math10101760","volume":"10","author":"J Castaneda","year":"2022","unstructured":"Castaneda, J., Martin, X. A., Ammouriova, M., Panadero, J., & Juan, A. A. (2022). A fuzzy simheuristic for the permutation flow shop problem under stochastic and fuzzy uncertainty. Mathematics, 10(10), 1760. https:\/\/doi.org\/10.3390\/math10101760","journal-title":"Mathematics"},{"issue":"3","key":"5661_CR13","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1515\/mper-2015-0021","volume":"6","author":"M \u0106wik","year":"2015","unstructured":"\u0106wik, M., & J\u00f3zefczyk, J. (2015). Evolutionary algorithm for minmax regret flow-shop problem. Management and Production Engineering Review, 6(3), 3\u20139. https:\/\/doi.org\/10.1515\/mper-2015-0021","journal-title":"Management and Production Engineering Review"},{"issue":"1","key":"5661_CR14","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s10100-017-0485-8","volume":"26","author":"M Cwik","year":"2018","unstructured":"Cwik, M., & J\u00f3zefczyk, J. (2018). Heuristic algorithms for the minmax regret flow-shop problem with interval processing times. Central European Journal of Operations Research, 26(1), 215\u2013238. https:\/\/doi.org\/10.1007\/s10100-017-0485-8","journal-title":"Central European Journal of Operations Research"},{"issue":"4","key":"5661_CR15","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0098-1354(94)85030-5","volume":"18","author":"D Deal","year":"1994","unstructured":"Deal, D., Yang, T., & Hallquist, S. (1994). Job scheduling in petrochemical production: Two-stage processing with finite intermediate storage. Computers & Chemical Engineering, 18(4), 333\u2013344.","journal-title":"Computers & Chemical Engineering"},{"issue":"9","key":"5661_CR16","doi-asserted-by":"publisher","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 and Operations Research, 23(9), 829\u2013843. https:\/\/doi.org\/10.1016\/0305-0548(95)00083-6","journal-title":"Computers and Operations Research"},{"issue":"5","key":"5661_CR17","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1080\/07408179908969849","volume":"31","author":"SE Elmaghraby","year":"1999","unstructured":"Elmaghraby, S. E., & Thoney, K. A. (1999). The two-machine stochastic flowshop problem with arbitrary processing time distributions. IIE Transactions, 31(5), 467\u2013477. https:\/\/doi.org\/10.1080\/07408179908969849","journal-title":"IIE Transactions"},{"issue":"2","key":"5661_CR18","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"TA Feo","year":"1995","unstructured":"Feo, T. A., & Resende, M. G. (1995). Greedy randomized adaptive search procedures. Journal of Global Optimization, 6(2), 109\u2013133.","journal-title":"Journal of Global Optimization"},{"issue":"3","key":"5661_CR19","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1016\/j.ejor.2016.09.055","volume":"257","author":"V Fernandez-Viagas","year":"2017","unstructured":"Fernandez-Viagas, V., Ruiz, R., & Framinan, J. M. (2017). A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation. European Journal of Operational Research, 257(3), 707\u2013721.","journal-title":"European Journal of Operational Research"},{"key":"5661_CR20","doi-asserted-by":"publisher","unstructured":"Ferone, D., Festa, P., Gruler, A., & Juan, A.A. (2016). Combining simulation with a GRASP metaheuristic for solving the permutation flow-shop problem with stochastic processing times. In 2016 winter simulation conference (WSC) (pp. 2205-2215). IEEE. Retrieved from http:\/\/ieeexplore.ieee.org\/document\/7822262\/. https:\/\/doi.org\/10.1109\/WSC.2016.7822262","DOI":"10.1109\/WSC.2016.7822262"},{"key":"5661_CR21","doi-asserted-by":"publisher","unstructured":"Framinan, J.M., et\u00a0al. (2018). The value of real-time data in stochastic flowshop scheduling: A simulation study for makespan. In Proceedings\u2014winter simulation conference (pp. 3299\u20133310). https:\/\/doi.org\/10.1109\/WSC.2017.8248047","DOI":"10.1109\/WSC.2017.8248047"},{"issue":"2","key":"5661_CR22","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/j.ejor.2015.05.006","volume":"246","author":"JM Framinan","year":"2015","unstructured":"Framinan, J. M., & Perez-Gonzalez, P. (2015). On heuristic solutions for the stochastic flowshop scheduling problem. European Journal of Operational Research, 246(2), 413\u2013420. https:\/\/doi.org\/10.1016\/j.ejor.2015.05.006","journal-title":"European Journal of Operational Research"},{"key":"5661_CR23","doi-asserted-by":"crossref","unstructured":"Fumagalli, L., Negri, E., Cattaneo, L., Ragazzini, L., & Macchi, M. (2022). Towards viable modelling for robust flow shop scheduling in production environments under uncertainty. In International scientific conference on digital transformation in industry: Trends, management, strategies (pp. 267\u2013279).","DOI":"10.1007\/978-3-031-30351-7_21"},{"issue":"2","key":"5661_CR24","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey, M. R., et al. (1976). The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research, 1(2), 117\u2013129.","journal-title":"Mathematics of Operations Research"},{"issue":"3","key":"5661_CR25","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/s11633-016-0964-8","volume":"13","author":"J-C Geng","year":"2016","unstructured":"Geng, J.-C., Cui, Z., & Gu, X.-S. (2016). Scatter search based particle swarm optimization algorithm for earliness\/tardiness flowshop scheduling with uncertainty. International Journal of Automation and Computing, 13(3), 285\u2013295.","journal-title":"International Journal of Automation and Computing"},{"key":"5661_CR26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s40314-019-0966-6","volume":"38","author":"A Ghafarimoghadam","year":"2019","unstructured":"Ghafarimoghadam, A., Ghayebloo, S., & Pishvaee, M. S. (2019). A fuzzybudgeted robust optimization model for joint network design-pricing problem in a forward- reverse supply chain: the viewpoint of third-party logistics. Computational and Applied Mathematics, 38, 1\u201329.","journal-title":"Computational and Applied Mathematics"},{"key":"5661_CR27","doi-asserted-by":"crossref","unstructured":"Ghodratnama, A., Amiri-Aref, M., & Tavakkoli-Moghaddam, R. (2023). Solving a new bi-objective mathematical model for a hybrid flow shop scheduling problem with robots and fuzzy maintenance time. Computers & Industrial Engineering, 109349.","DOI":"10.1016\/j.cie.2023.109349"},{"issue":"4","key":"5661_CR28","doi-asserted-by":"publisher","first-page":"399","DOI":"10.5267\/j.ijiec.2017.2.001","volume":"8","author":"EM Gonz\u00e1lez-Neira","year":"2017","unstructured":"Gonz\u00e1lez-Neira, E. M., et al. (2017). Flow-shop scheduling problem under uncertainties: Review and trends. International Journal of Industrial Engineering Computations, 8(4), 399\u2013426. https:\/\/doi.org\/10.5267\/j.ijiec.2017.2.001","journal-title":"International Journal of Industrial Engineering Computations"},{"issue":"3","key":"5661_CR29","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1080\/12460125.2017.1351863","volume":"26","author":"EM Gonz\u00e1lez-Neira","year":"2017","unstructured":"Gonz\u00e1lez-Neira, E. M., & Montoya-Torres, J. R. (2017). A grasp metaheuristic for the hybrid flowshop scheduling problem. Journal of Decision Systems, 26(3), 294\u2013306. https:\/\/doi.org\/10.1080\/12460125.2017.1351863","journal-title":"Journal of Decision Systems"},{"key":"5661_CR30","doi-asserted-by":"crossref","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":"3","key":"5661_CR31","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1287\/opre.44.3.510","volume":"44","author":"NG Hall","year":"1996","unstructured":"Hall, N. G., & Sriskandarajah, C. (1996). A survey of machine scheduling problems with blocking and no-wait in process. Operations Research, 44(3), 510\u2013525.","journal-title":"Operations Research"},{"key":"5661_CR32","doi-asserted-by":"publisher","unstructured":"Herbold, S. (2020). Autorank: A python package for automated ranking of classifiers. Journal of Open Source Software, 5(48), 2173. https:\/\/doi.org\/10.21105\/joss.02173","DOI":"10.21105\/joss.02173"},{"key":"5661_CR33","unstructured":"Heyman, D. P., & Sobel, M. J. (2004). Stochastic models in operations research (Vol. 2, pp. xviii+555). Mineola, NY: Dover Publications Inc."},{"key":"5661_CR34","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10479-023-05324-3","volume":"328","author":"F Hnaien","year":"2023","unstructured":"Hnaien, F., & Arbaoui, T. (2023). Minimizing the makespan for the twomachine flow shop scheduling problem with random breakdown. Annals of Operations Research, 328, 1\u201324.","journal-title":"Annals of Operations Research"},{"issue":"3","key":"5661_CR35","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1080\/10618600.2017.1305277","volume":"26","author":"H Hofmann","year":"2017","unstructured":"Hofmann, H., Wickham, H., & Kafadar, K. (2017). value plots: Boxplots for large data. Journal of Computational and Graphical Statistics, 26(3), 469\u2013477.","journal-title":"Journal of Computational and Graphical Statistics"},{"key":"5661_CR36","doi-asserted-by":"crossref","unstructured":"Inuiguchi, M., Ichihashi, H., & Tanaka, H. (1990). Fuzzy programming: a survey of recent developments. In Stochastic versus fuzzy approaches to multiobjective mathematical programming under uncertainty (pp. 45\u201368).","DOI":"10.1007\/978-94-009-2111-5_4"},{"issue":"2","key":"5661_CR37","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1111\/j.1937-5956.2002.tb00492.x","volume":"11","author":"Z Jin","year":"2002","unstructured":"Jin, Z., Ohno, K., Ito, T., & Elmaghraby, S. (2002). Scheduling hybrid flowshops in printed circuit board assembly lines. Production and Operations Management, 11(2), 216\u2013230.","journal-title":"Production and Operations Management"},{"issue":"1","key":"5661_CR38","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"SM Johnson","year":"1954","unstructured":"Johnson, S. M. (1954). Optimal two-and three-stage production schedules with setup times included. Naval Research Logistics (NRL), 1(1), 61\u201368.","journal-title":"Naval Research Logistics (NRL)"},{"issue":"3","key":"5661_CR39","first-page":"667","volume":"42","author":"J J\u00f3zefczyk","year":"2013","unstructured":"J\u00f3zefczyk, J., & Siepak, M. (2013). Scatter search based algorithms for minmax regret task scheduling problems with interval uncertainty. Control and Cybernetics, 42(3), 667\u2013698.","journal-title":"Control and Cybernetics"},{"key":"5661_CR40","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.simpat.2014.02.005","volume":"46","author":"AA Juan","year":"2014","unstructured":"Juan, A. A., Barrios, B. B., Vallada, E., Riera, D., & Jorba, J. (2014). A simheuristic algorithm for solving the permutation flow shop problem with stochastic processing times. Simulation Modelling Practice and Theory, 46, 101\u2013117. https:\/\/doi.org\/10.1016\/j.simpat.2014.02.005","journal-title":"Simulation Modelling Practice and Theory"},{"issue":"1","key":"5661_CR41","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1111\/itor.12028","volume":"21","author":"AA Juan","year":"2014","unstructured":"Juan, A. A., Louren\u00e7o, H. R., Mateo, M., Luo, R., & Castella, Q. (2014). Using iterated local search for solving the flow-shop problem: Parallelization, parametrization, and randomization issues. International Transactions in Operational Research, 21(1), 103\u2013126. https:\/\/doi.org\/10.1111\/itor.12028","journal-title":"International Transactions in Operational Research"},{"issue":"1","key":"5661_CR42","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/j.ejor.2011.08.029","volume":"217","author":"A Kasperski","year":"2012","unstructured":"Kasperski, A., Kurpisz, A., & Zieli\u0144ski, P. (2012). Approximating a two-machine flow shop scheduling under discrete scenario uncertainty. European Journal of Operational Research, 217(1), 36\u201343.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"5661_CR43","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1057\/jors.1993.3","volume":"44","author":"Y-D Kim","year":"1993","unstructured":"Kim, Y.-D. (1993). Heuristics for flowshop scheduling problems minimizing mean tardiness. Journal of the Operational Research Society, 44(1), 19\u201328.","journal-title":"Journal of the Operational Research Society"},{"issue":"1","key":"5661_CR44","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/0377-2217(95)00119-0","volume":"91","author":"Y-D Kim","year":"1996","unstructured":"Kim, Y.-D., Lim, H.-G., & Park, M.-W. (1996). Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process. European Journal of Operational Research, 91(1), 124\u2013143.","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"5661_CR45","first-page":"421","volume":"32","author":"P Kouvelis","year":"2000","unstructured":"Kouvelis, P., et al. (2000). Robust scheduling of a two-machine flow shop with uncertain processing times. IIE Transactions, 32(5), 421\u2013432.","journal-title":"IIE Transactions"},{"issue":"6","key":"5661_CR46","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1016\/j.engappai.2006.10.003","volume":"20","author":"D Laha","year":"2007","unstructured":"Laha, D., & Chakraborty, U. K. (2007). An efficient stochastic hybrid heuristic for flowshop scheduling. Engineering Applications of Artificial Intelligence, 20(6), 851\u2013856. https:\/\/doi.org\/10.1016\/j.engappai.2006.10.003","journal-title":"Engineering Applications of Artificial Intelligence"},{"issue":"1","key":"5661_CR47","doi-asserted-by":"publisher","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 twomachine robust flow shop with budgeted uncertainty. European Journal of Operational Research, 300(1), 46\u201357. https:\/\/doi.org\/10.1016\/j.ejor.2021.10.021","journal-title":"European Journal of Operational Research"},{"key":"5661_CR48","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.106117","volume":"151","author":"M Levorato","year":"2023","unstructured":"Levorato, M., Sotelo, D., Figueiredo, R., & Frota, Y. (2023). Robust permutation flow shop total weighted completion time problem: Solution and application to the oil and gas industry. Computers & Operations Research, 151, 106117. https:\/\/doi.org\/10.1016\/j.cor.2022.106117","journal-title":"Computers & Operations Research"},{"issue":"4","key":"5661_CR49","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1080\/0305215X.2019.1607848","volume":"52","author":"W Liao","year":"2020","unstructured":"Liao, W., & Fu, Y. (2020). Min-max regret criterion-based robust model for the permutation flow-shop scheduling problem. Engineering Optimization, 52(4), 687\u2013700.","journal-title":"Engineering Optimization"},{"key":"5661_CR50","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1016\/j.jclepro.2016.12.044","volume":"147","author":"G-S Liu","year":"2017","unstructured":"Liu, G.-S., Zhou, Y., & Yang, H.-D. (2017). Minimizing energy consumption and tardiness penalty for fuzzy flow shop scheduling with state-dependent setup time. Journal of Cleaner Production, 147, 470\u2013484.","journal-title":"Journal of Cleaner Production"},{"key":"5661_CR51","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2023.2217279","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. https:\/\/doi.org\/10.1080\/00207543.2023.2217279","journal-title":"International Journal of Production Research"},{"key":"5661_CR52","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/s00170-010-3149-6","volume":"56","author":"Q Liu","year":"2011","unstructured":"Liu, Q., Ullah, S., & Zhang, C. (2011). An improved genetic algorithm for robust permutation flowshop scheduling. The International Journal of Advanced Manufacturing Technology, 56, 345\u2013354.","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"key":"5661_CR53","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.orp.2016.09.002","volume":"3","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Dubois-Lacoste, J., C\u00e1ceres, L. P., Birattari, M., & St\u00fctzle, T. (2016). The irace package: Iterated racing for automatic algorithm configuration. Operations Research Perspectives, 3, 43\u201358.","journal-title":"Operations Research Perspectives"},{"issue":"5\u20136","key":"5661_CR54","doi-asserted-by":"crossref","first-page":"991","DOI":"10.1016\/j.mcm.2008.02.004","volume":"49","author":"NM Matsveichuk","year":"2009","unstructured":"Matsveichuk, N. M., Sotskov, Y. N., Egorova, N. G., & Lai, T.-C. (2009). Schedule execution for two-machine flow-shop with interval processing times. Mathematical and Computer Modelling, 49(5\u20136), 991\u20131011.","journal-title":"Mathematical and Computer Modelling"},{"issue":"11","key":"5661_CR55","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., & Hansen, P. (1997). Variable neighborhood search. Computers & Operations Research, 24(11), 1097\u20131100.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"5661_CR56","doi-asserted-by":"publisher","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. https:\/\/doi.org\/10.1016\/0305-0483(83)90088-9","journal-title":"Omega"},{"issue":"3","key":"5661_CR57","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1287\/ijoc.12.3.164.12639","volume":"12","author":"M Prais","year":"2000","unstructured":"Prais, M., & Ribeiro, C. C. (2000). Reactive grasp: An application to a matrix decomposition problem in TDMA traffic assignment. INFORMS Journal on Computing, 12(3), 164\u2013176.","journal-title":"INFORMS Journal on Computing"},{"issue":"1","key":"5661_CR58","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.jmsy.2013.03.004","volume":"33","author":"D Rahmani","year":"2014","unstructured":"Rahmani, D., & Heydari, M. (2014). Robust and stable flow shop scheduling with unexpected arrivals of new jobs and uncertain processing times. Journal of Manufacturing Systems, 33(1), 84\u201392. https:\/\/doi.org\/10.1016\/j.jmsy.2013.03.004","journal-title":"Journal of Manufacturing Systems"},{"key":"5661_CR59","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijepes.2021.107126","volume":"132","author":"A Rajaei","year":"2021","unstructured":"Rajaei, A., Fattaheian-Dehkordi, S., Fotuhi-Firuzabad, M., & Moeini-Aghtaie, M. (2021). Decentralized transactive energy management of multimicrogrid distribution systems based on ADMM. International Journal of Electrical Power & Energy Systems, 132, 107126. https:\/\/doi.org\/10.1016\/j.ijepes.2021.107126","journal-title":"International Journal of Electrical Power & Energy Systems"},{"key":"5661_CR60","volume-title":"Mathematical statistics and data analysis","author":"JA Rice","year":"2006","unstructured":"Rice, J. A. (2006). Mathematical statistics and data analysis. Cengage Learning."},{"issue":"3","key":"5661_CR61","doi-asserted-by":"publisher","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. https:\/\/doi.org\/10.1016\/j.ejor.2005.12.009","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"5661_CR62","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1080\/09511920802209033","volume":"22","author":"I Sabuncuoglu","year":"2009","unstructured":"Sabuncuoglu, I., & Goren, S. (2009). Hedging production schedules against uncertainty in manufacturing environment with a review of robustness and stability research. International Journal of Computer Integrated Manufacturing, 22(2), 138\u2013157. https:\/\/doi.org\/10.1080\/09511920802209033","journal-title":"International Journal of Computer Integrated Manufacturing"},{"key":"5661_CR63","volume-title":"Stochastic optimization","author":"J Schneider","year":"2007","unstructured":"Schneider, J., & Kirkpatrick, S. (2007). Stochastic optimization. Springer."},{"issue":"3","key":"5661_CR64","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1016\/j.ejor.2012.03.044","volume":"221","author":"MM Silva","year":"2012","unstructured":"Silva, M. M., Subramanian, A., Vidal, T., & Ochi, L. S. (2012). A simple and effective metaheuristic for the minimum latency problem. European Journal of Operational Research, 221(3), 513\u2013520. https:\/\/doi.org\/10.1016\/j.ejor.2012.03.044","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"5661_CR65","doi-asserted-by":"crossref","first-page":"1154","DOI":"10.1287\/opre.21.5.1154","volume":"21","author":"AL Soyster","year":"1973","unstructured":"Soyster, A. L. (1973). Convex programming with set-inclusive constraints and applications to inexact linear programming. Operations Research, 21(5), 1154\u20131157.","journal-title":"Operations Research"},{"issue":"12","key":"5661_CR66","doi-asserted-by":"crossref","first-page":"1163","DOI":"10.1057\/jors.1988.193","volume":"39","author":"EF Stafford","year":"1988","unstructured":"Stafford, E. F. (1988). On the development of a mixed-integer linear programming model for the flowshop sequencing problem. Journal of the Operational Research Society, 39(12), 1163\u20131174.","journal-title":"Journal of the Operational Research Society"},{"key":"5661_CR67","doi-asserted-by":"crossref","unstructured":"Student. (1908). The probable error of a mean. Biometrika, 1\u201325.","DOI":"10.2307\/2331554"},{"issue":"2","key":"5661_CR68","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"},{"key":"5661_CR69","doi-asserted-by":"crossref","DOI":"10.1002\/9780470496916","volume-title":"Metaheuristics\u2013from design to implementation","author":"E-G Talbi","year":"2009","unstructured":"Talbi, E.-G. (2009). Metaheuristics\u2013from design to implementation. Wiley."},{"issue":"10","key":"5661_CR70","doi-asserted-by":"publisher","first-page":"1373","DOI":"10.1057\/palgrave.jors.2602455","volume":"59","author":"FT Tseng","year":"2008","unstructured":"Tseng, F. T., & Stafford, E. F. (2008). New MILP models for the permutation flowshop problem. Journal of the Operational Research Society, 59(10), 1373\u20131386. https:\/\/doi.org\/10.1057\/palgrave.jors.2602455","journal-title":"Journal of the Operational Research Society"},{"issue":"4","key":"5661_CR71","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/j.omega.2003.12.001","volume":"32","author":"FT Tseng","year":"2004","unstructured":"Tseng, F. T., Stafford, E. F., Jr., & Gupta, J. N. (2004). An empirical analysis of integer programming formulations for the permutation flowshop. Omega, 32(4), 285\u2013293.","journal-title":"Omega"},{"key":"5661_CR72","unstructured":"Tyagi, N., Tripathi, R., & Chandramoul, A. (2017). Stochastic flowshop scheduling model for two machines. Journal of Graphic Era University, 34\u201344."},{"issue":"3","key":"5661_CR73","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1016\/j.ejor.2014.07.033","volume":"240","author":"E Vallada","year":"2015","unstructured":"Vallada, E., Ruiz, R., & Framinan, J. M. (2015). New hard benchmark for flowshop scheduling problems minimising makespan. European Journal of Operational Research, 240(3), 666\u2013677.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"5661_CR74","doi-asserted-by":"publisher","first-page":"1350","DOI":"10.1016\/j.cor.2006.08.016","volume":"35","author":"E Vallada","year":"2008","unstructured":"Vallada, E., Ruiz, R., & Minella, G. (2008). Minimising total tardiness in the m-machine flowshop problem: A review and evaluation of heuristics and metaheuristics. Computers & Operations Research, 35(4), 1350\u20131373. https:\/\/doi.org\/10.1016\/j.cor.2006.08.016","journal-title":"Computers & Operations Research"},{"issue":"2","key":"5661_CR75","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1002\/nav.3800060205","volume":"6","author":"HM Wagner","year":"1959","unstructured":"Wagner, H. M. (1959). An integer linear-programming model for machine scheduling. Naval Research Logistics Quarterly, 6(2), 131\u2013140.","journal-title":"Naval Research Logistics Quarterly"},{"key":"5661_CR76","doi-asserted-by":"publisher","unstructured":"Wang, B., & Yang, Z. (2007). A particle swarm optimization algorithm for robust flow-shop scheduling with fuzzy processing times. In 2007 IEEE international conference on automation and logistics (pp. 824\u2013828). https:\/\/doi.org\/10.1109\/ICAL.2007.4338678","DOI":"10.1109\/ICAL.2007.4338678"},{"issue":"6","key":"5661_CR77","doi-asserted-by":"crossref","first-page":"80","DOI":"10.2307\/3001968","volume":"1","author":"F Wilcoxon","year":"1945","unstructured":"Wilcoxon, F. (1945). Individual comparisons by ranking methods. Biometrics Bulletin, 1(6), 80\u201383.","journal-title":"Biometrics Bulletin"},{"issue":"4","key":"5661_CR78","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1057\/jors.1989.58","volume":"40","author":"J Wilson","year":"1989","unstructured":"Wilson, J. (1989). Alternative formulations of a flow-shop scheduling problem. Journal of the Operational Research Society, 40(4), 395\u2013399.","journal-title":"Journal of the Operational Research Society"},{"issue":"8","key":"5661_CR79","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1080\/07408170304348","volume":"35","author":"H-S Yan","year":"2003","unstructured":"Yan, H.-S., Xia, Q.-F., Zhu, M.-R., Liu, X.-L., & Guo, Z.-M. (2003). Integrated production planning and scheduling on automobile assembly lines. IIE Transactions, 35(8), 711\u2013725.","journal-title":"IIE Transactions"},{"issue":"9","key":"5661_CR80","doi-asserted-by":"crossref","first-page":"1413","DOI":"10.1057\/jors.2014.100","volume":"66","author":"KC Ying","year":"2015","unstructured":"Ying, K. C. (2015). Scheduling the two-machine flowshop to hedge against processing time uncertainty. Journal of the Operational Research Society, 66(9), 1413\u20131425.","journal-title":"Journal of the Operational Research Society"},{"key":"5661_CR81","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1016\/S0019-9958(65)90241-X","volume":"8","author":"L Zadeh","year":"1965","unstructured":"Zadeh, L. (1965). Fuzzy sets. Information. Control, 8, 338\u2013353.","journal-title":"Control"},{"issue":"3","key":"5661_CR82","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1287\/moor.6.3.319","volume":"6","author":"E Zemel","year":"1981","unstructured":"Zemel, E. (1981). Measuring the quality of approximate solutions to zeroone programming problems. Mathematics of operations research, 6(3), 319\u2013332.","journal-title":"Mathematics of operations research"},{"issue":"5","key":"5661_CR83","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/j.orl.2013.05.003","volume":"41","author":"B Zeng","year":"2013","unstructured":"Zeng, B., & Zhao, L. (2013). Solving two-stage robust optimization problems using a column-and- constraint generation method. Operations Research Letters, 41(5), 457\u2013461. https:\/\/doi.org\/10.1016\/j.orl.2013.05.003","journal-title":"Operations Research Letters"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-023-05661-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-023-05661-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-023-05661-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,15]],"date-time":"2024-07-15T16:24:45Z","timestamp":1721060685000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-023-05661-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,10]]},"references-count":83,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["5661"],"URL":"https:\/\/doi.org\/10.1007\/s10479-023-05661-3","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2023,11,10]]},"assertion":[{"value":"11 January 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 October 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 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 they have no conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}