{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T01:07:29Z","timestamp":1781744849613,"version":"3.54.5"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,7,10]],"date-time":"2023-07-10T00:00:00Z","timestamp":1688947200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,7,10]],"date-time":"2023-07-10T00:00:00Z","timestamp":1688947200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["72271222"],"award-info":[{"award-number":["72271222"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71871203"],"award-info":[{"award-number":["71871203"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["L1924063"],"award-info":[{"award-number":["L1924063"]}],"id":[{"id":"10.13039\/501100001809","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-05489-x","type":"journal-article","created":{"date-parts":[[2023,7,10]],"date-time":"2023-07-10T11:01:50Z","timestamp":1688986910000},"page":"709-739","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A distributionally robust approach for the two-machine permutation flow shop scheduling"],"prefix":"10.1007","volume":"338","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-2287-693X","authenticated-orcid":false,"given":"Haimin","family":"Lu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6808-1490","authenticated-orcid":false,"given":"Zhi","family":"Pei","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,7,10]]},"reference":[{"key":"5489_CR1","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1016\/S0377-2217(03)00261-3","volume":"153","author":"R Aggoune","year":"2004","unstructured":"Aggoune, R. (2004). Minimizing the makespan for the flow shop scheduling problem with availability constraints. European Journal of Operational Research, 153, 534\u2013543.","journal-title":"European Journal of Operational Research"},{"key":"5489_CR2","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1016\/j.ejor.2018.07.007","volume":"272","author":"Z Chang","year":"2019","unstructured":"Chang, Z., Ding, J. Y., & Song, S. (2019). Distributionally robust scheduling on parallel machines under moment uncertainty. European Journal of Operational Research, 272, 832\u2013846.","journal-title":"European Journal of Operational Research"},{"key":"5489_CR3","doi-asserted-by":"publisher","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, 261\u2013274.","journal-title":"European Journal of Operational Research"},{"key":"5489_CR4","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1287\/opre.1090.0741","volume":"58","author":"E Delage","year":"2010","unstructured":"Delage, E., & Ye, Y. Y. (2010). Distributionally robust optimization under moment uncertainty with application to data-driven problems. Operations Research, 58, 595\u2013612.","journal-title":"Operations Research"},{"key":"5489_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105595","volume":"138","author":"F Della Croce","year":"2022","unstructured":"Della Croce, F., Salassa, F., & T\u2019kindt, V. (2022). Exact solution of the two-machine flow shop problem with three operations. Computers & Operations Research, 138, 105595.","journal-title":"Computers & Operations Research"},{"key":"5489_CR6","doi-asserted-by":"publisher","first-page":"1154","DOI":"10.1016\/j.mcm.2012.10.017","volume":"57","author":"A Elyasi","year":"2013","unstructured":"Elyasi, A., & Salmasi, N. (2013). Stochastic scheduling with minimizing the number of tardy jobs using chance constrained programming. Mathematical and Computer Modelling, 57, 1154\u20131164.","journal-title":"Mathematical and Computer Modelling"},{"key":"5489_CR7","volume-title":"Flow shop scheduling: theoretical results, algorithms, and applications","author":"H Emmons","year":"2012","unstructured":"Emmons, H., & Vairaktarakis, G. (2012). Flow shop scheduling: theoretical results, algorithms, and applications. Springer."},{"key":"5489_CR8","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10107-017-1172-1","volume":"171","author":"PM Esfahani","year":"2018","unstructured":"Esfahani, P. M., & Kuhn, D. (2018). Data-driven distributionally robust optimization using the Wasserstein metric: Performance guarantees and tractable reformulations. Mathematical Programming, 171, 115\u2013166.","journal-title":"Mathematical Programming"},{"key":"5489_CR9","doi-asserted-by":"publisher","first-page":"3706","DOI":"10.1080\/00207543.2016.1162341","volume":"54","author":"X Feng","year":"2016","unstructured":"Feng, X., Zheng, F., & Xu, Y. (2016). Robust scheduling of a two-stage hybrid flow shop with uncertain interval processing times. International Journal of Production Research, 54, 3706\u20133717.","journal-title":"International Journal of Production Research"},{"key":"5489_CR10","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s10951-016-0484-y","volume":"20","author":"E Feuerstein","year":"2017","unstructured":"Feuerstein, E., Marchetti-Spaccamela, A., Schalekamp, F., Sitters, R., van der Ster, S., Stougie, L., & van Zuylen, A. (2017). Minimizing worst-case and average-case makespan over scenarios. Journal of Scheduling, 20, 545\u2013555.","journal-title":"Journal of Scheduling"},{"key":"5489_CR11","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, 413\u2013420.","journal-title":"European Journal of Operational Research"},{"key":"5489_CR12","doi-asserted-by":"publisher","first-page":"399","DOI":"10.5267\/j.ijiec.2017.2.001","volume":"8","author":"E Gonz\u00e1lez-Neira","year":"2017","unstructured":"Gonz\u00e1lez-Neira, E., Montoya-Torres, J., & Barrera, D. (2017). Flow-shop scheduling problem under uncertainties: Review and trends. International Journal of Industrial Engineering Computations, 8, 399\u2013426.","journal-title":"International Journal of Industrial Engineering Computations"},{"key":"5489_CR13","first-page":"287","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. Elsevier, 5, 287\u2013326.","journal-title":"Elsevier"},{"key":"5489_CR14","doi-asserted-by":"publisher","first-page":"163","DOI":"10.5267\/j.dsl.2013.04.005","volume":"2","author":"M Heydari","year":"2013","unstructured":"Heydari, M., Mazdeh, M., & Bayat, M. (2013). Scheduling stochastic two-machine flow shop problems to minimize expected makespan. Decision Science Letters, 2, 163\u2013174.","journal-title":"Decision Science Letters"},{"key":"5489_CR15","doi-asserted-by":"publisher","first-page":"1638","DOI":"10.1287\/opre.2017.1656","volume":"65","author":"RW Jiang","year":"2017","unstructured":"Jiang, R. W., Shen, S. Q., & Zhang, Y. L. (2017). Integer programming approaches for appointment scheduling with random no-shows and service durations. Operations Research, 65, 1638\u20131656.","journal-title":"Operations Research"},{"key":"5489_CR16","doi-asserted-by":"publisher","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, 36\u201343.","journal-title":"European Journal of Operational Research"},{"key":"5489_CR17","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1016\/j.cor.2019.06.012","volume":"111","author":"M Khatami","year":"2019","unstructured":"Khatami, M., Salehipour, A., & Hwang, F. (2019). Makespan minimization for the m-machine ordered flow shop scheduling problem. Computers & Operations Research, 111, 400\u2013414.","journal-title":"Computers & Operations Research"},{"key":"5489_CR18","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.cor.2016.09.023","volume":"79","author":"D Khorasanian","year":"2017","unstructured":"Khorasanian, D., & Moslehi, G. (2017). Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption. Computers & Operations Research, 79, 94\u2013108.","journal-title":"Computers & Operations Research"},{"key":"5489_CR19","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1137\/S1052623499363220","volume":"12","author":"AJ Kleywegt","year":"2002","unstructured":"Kleywegt, A. J., Shapiro, A., & Homem-de Mello, T. (2002). The sample average approximation method for stochastic discrete optimization. SIAM Journal on Optimization, 12, 479\u2013502.","journal-title":"SIAM Journal on Optimization"},{"key":"5489_CR20","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1080\/07408170008963918","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, 421\u2013432.","journal-title":"IIE Transactions"},{"key":"5489_CR21","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 two-machine robust flow shop with budgeted uncertainty. European Journal of Operational Research, 300, 46\u201357.","journal-title":"European Journal of Operational Research"},{"key":"5489_CR22","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.ejor.2022.11.005","volume":"308","author":"H Lu","year":"2023","unstructured":"Lu, H., & Pei, Z. (2023). Single machine scheduling with release dates: A distributionally robust approach. European Journal of Operational Research, 308, 19\u201337.","journal-title":"European Journal of Operational Research"},{"key":"5489_CR23","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1016\/j.ijpe.2009.07.003","volume":"122","author":"G Moslehi","year":"2009","unstructured":"Moslehi, G., Mirzaee, M., Vasei, M., Modarres, M., & Azaron, A. (2009). Two-machine flow shop scheduling to minimize the sum of maximum earliness and tardiness. International Journal of Production Economics, 122, 763\u2013773.","journal-title":"International Journal of Production Economics"},{"key":"5489_CR24","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1016\/j.ejor.2022.01.002","volume":"302","author":"A Novak","year":"2022","unstructured":"Novak, A., Gnatowski, A., & Sucha, P. (2022). Distributionally robust scheduling algorithms for total flow time minimization on parallel machines using norm regularizations. European Journal of Operational Research, 302, 438\u2013455.","journal-title":"European Journal of Operational Research"},{"key":"5489_CR25","doi-asserted-by":"publisher","first-page":"2498","DOI":"10.1016\/j.cor.2008.10.008","volume":"36","author":"QK Pan","year":"2009","unstructured":"Pan, Q. K., Wang, L., & Qian, B. (2009). A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems. Computers & Operations Research, 36, 2498\u20132511.","journal-title":"Computers & Operations Research"},{"key":"5489_CR26","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1016\/j.ejor.2021.08.034","volume":"299","author":"Z Pei","year":"2022","unstructured":"Pei, Z., Lu, H., Jin, Q., & Zhang, L. (2022). Target-based distributionally robust optimization for single machine scheduling. European Journal of Operational Research, 299, 420\u2013431.","journal-title":"European Journal of Operational Research"},{"key":"5489_CR27","volume-title":"Scheduling theory algorithms and systems","author":"M Pinedo","year":"2016","unstructured":"Pinedo, M. (2016). Scheduling theory algorithms and systems (5th ed.). Springer.","edition":"5"},{"key":"5489_CR28","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1007\/s00170-003-1926-1","volume":"25","author":"D Ravindran","year":"2005","unstructured":"Ravindran, D., Selvakumar, S., Sivaraman, R., & Haq, A. N. (2005). Flow shop scheduling with multiple objective of minimizing makespan and total flow time. The international journal of advanced manufacturing technology, 25, 1007\u20131012.","journal-title":"The international journal of advanced manufacturing technology"},{"key":"5489_CR29","doi-asserted-by":"publisher","first-page":"21","DOI":"10.21314\/JOR.2000.038","volume":"2","author":"RT Rockafellar","year":"2000","unstructured":"Rockafellar, R. T., & Uryasev, S. (2000). Optimization of conditional value-at-risk. Journal of Risk, 2, 21\u201341.","journal-title":"Journal of Risk"},{"key":"5489_CR30","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1016\/j.ejor.2019.11.039","volume":"283","author":"KS Shehadeh","year":"2020","unstructured":"Shehadeh, K. S., Cohn, A. E., & Jiang, R. (2020). A distributionally robust optimization approach for outpatient colonoscopy scheduling. European Journal of Operational Research, 283, 549\u2013561.","journal-title":"European Journal of Operational Research"},{"key":"5489_CR31","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1016\/j.ejor.2020.09.001","volume":"290","author":"KS Shehadeh","year":"2021","unstructured":"Shehadeh, K. S., & Padman, R. (2021). A distributionally robust optimization approach for stochastic elective surgery scheduling with limited intensive care unit capacity. European Journal of Operational Research, 290, 901\u2013913.","journal-title":"European Journal of Operational Research"},{"key":"5489_CR32","first-page":"159","volume":"12","author":"H Soroush","year":"2005","unstructured":"Soroush, H., & Allahverdi, A. (2005). Stochastic two-machine flowshop scheduling problem with total completion time criterion. International Journal of Industrial Engineering, 12, 159.","journal-title":"International Journal of Industrial Engineering"},{"key":"5489_CR33","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1016\/S0377-2217(03)00192-9","volume":"157","author":"B Tokta\u015f","year":"2004","unstructured":"Tokta\u015f, B., Azizo\u011flu, M., & K\u00f6ksalan, S. K. (2004). Two-machine flow shop scheduling with two criteria: Maximum earliness and makespan. European Journal of Operational Research, 157, 286\u2013295.","journal-title":"European Journal of Operational Research"},{"key":"5489_CR34","doi-asserted-by":"publisher","first-page":"740","DOI":"10.1016\/j.ejor.2018.08.037","volume":"273","author":"Y Wang","year":"2019","unstructured":"Wang, Y., Zhang, Y., & Tang, J. (2019). A distributionally robust optimization approach for surgery block allocation. European Journal of Operational Research, 273, 740\u2013753.","journal-title":"European Journal of Operational Research"},{"key":"5489_CR35","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.ejor.2020.01.009","volume":"284","author":"ZL Wang","year":"2020","unstructured":"Wang, Z. L., You, K. Y., Song, S. J., & Zhang, Y. L. (2020). Wasserstein distributionally robust shortest path problem. European Journal of Operational Research, 284, 31\u201343.","journal-title":"European Journal of Operational Research"},{"key":"5489_CR36","doi-asserted-by":"publisher","first-page":"5372","DOI":"10.1080\/00207543.2020.1778208","volume":"59","author":"CC Wu","year":"2021","unstructured":"Wu, C. C., Gupta, J. N., Cheng, S. R., Lin, B. M., Yip, S. H., & Lin, W. C. (2021). Robust scheduling for a two-stage assembly shop with scenario-dependent processing times. International Journal of Production Research, 59, 5372\u20135387.","journal-title":"International Journal of Production Research"},{"key":"5489_CR37","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.cor.2019.07.015","volume":"112","author":"SH Zhou","year":"2019","unstructured":"Zhou, S. H., & Yue, Q. (2019). Appointment scheduling for multi-stage sequential service systems with stochastic service durations. Computers & Operations Research, 112, 13. https:\/\/doi.org\/10.1016\/j.cor.2019.07.015","journal-title":"Computers & Operations Research"},{"key":"5489_CR38","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.cor.2019.07.015","volume":"112","author":"SH Zhou","year":"2019","unstructured":"Zhou, S. H., & Yue, Q. (2019). Appointment scheduling for multi-stage sequential service systems with stochastic service durations. Computers & Operations Research, 112, 13.","journal-title":"Computers & Operations Research"},{"key":"5489_CR39","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1287\/opre.1080.0684","volume":"57","author":"SS Zhu","year":"2009","unstructured":"Zhu, S. S., & Fukushima, M. (2009). Worst-case conditional value-at-risk with application to robust portfolio management. Operations Research, 57, 1155\u20131168.","journal-title":"Operations Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-023-05489-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-023-05489-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-023-05489-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,15]],"date-time":"2024-07-15T16:22:04Z","timestamp":1721060524000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-023-05489-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,10]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["5489"],"URL":"https:\/\/doi.org\/10.1007\/s10479-023-05489-x","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,10]]},"assertion":[{"value":"18 May 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 July 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}