{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,18]],"date-time":"2026-02-18T04:30:55Z","timestamp":1771389055498,"version":"3.50.1"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031162091","type":"print"},{"value":"9783031162107","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-16210-7_48","type":"book-chapter","created":{"date-parts":[[2022,9,20]],"date-time":"2022-09-20T23:03:09Z","timestamp":1663714989000},"page":"587-597","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A New Variant of\u00a0the\u00a0Distributed Permutation Flow Shop Scheduling Problem with\u00a0Worker Flexibility"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1186-9540","authenticated-orcid":false,"given":"Tasnim","family":"Mraihi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3077-6240","authenticated-orcid":false,"given":"Olfa Belkahla","family":"Driss","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4746-5342","authenticated-orcid":false,"given":"Hind Bril","family":"EL-Haouzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,21]]},"reference":[{"issue":"14","key":"48_CR1","doi-asserted-by":"publisher","first-page":"2895","DOI":"10.1080\/0020754050056417","volume":"43","author":"S Reza Hejazi","year":"2005","unstructured":"Reza Hejazi, S., Saghafian, S.: Flowshop-scheduling problems with makespan criterion: a review. Int. J. Prod. Res. 43(14), 2895\u20132929 (2005)","journal-title":"Int. J. Prod. Res."},{"issue":"1","key":"48_CR2","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"SM Johnson","year":"1954","unstructured":"Johnson, S.M.: Optimal two- and three-stage production schedules with setup times included. Naval Res. Logist. Quart. 1(1), 61\u201368 (1954)","journal-title":"Naval Res. Logist. Quart."},{"key":"48_CR3","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/978-3-319-07593-8_60","volume-title":"Distributed Computing and Artificial Intelligence, 11th International Conference","author":"H Bargaoui","year":"2014","unstructured":"Bargaoui, H., Driss, O.B.: Multi-agent model based on Tabu search for the permutation flow shop scheduling problem. In: Omatu, S., Bersini, H., Corchado, J.M., Rodr\u00edguez, S., Pawlewski, P., Bucciarelli, E. (eds.) Distributed Computing and Artificial Intelligence, 11th International Conference. AISC, vol. 290, pp. 519\u2013527. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07593-8_60"},{"issue":"11","key":"48_CR4","doi-asserted-by":"publisher","first-page":"1891","DOI":"10.1016\/S0305-0548(03)00145-X","volume":"31","author":"J Grabowski","year":"2004","unstructured":"Grabowski, J., Wodecki, M.: A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion. Comput. Oper. Res. 31(11), 1891\u20131909 (2004)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"48_CR5","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1016\/j.cor.2009.06.019","volume":"37","author":"B Naderi","year":"2010","unstructured":"Naderi, B., Ruiz, R.: The distributed permutation flowshop scheduling problem. Comput. Oper. Res. 37(4), 754\u2013768 (2010)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"48_CR6","doi-asserted-by":"publisher","first-page":"1111","DOI":"10.1080\/00207543.2014.948578","volume":"53","author":"V Fernandez-Viagas","year":"2015","unstructured":"Fernandez-Viagas, V., Framinan, J.M.: A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problem. Int. J. Prod. Res. 53(4), 1111\u20131123 (2015)","journal-title":"Int. J. Prod. Res."},{"key":"48_CR7","doi-asserted-by":"crossref","unstructured":"Bargaoui, H., Belkahla Driss, O., Ghedira, K.: Minimizing makespan in multi-factory flow shop problem using a chemical reaction metaheuristic. In: 2016 IEEE Congress on Evolutionary Computation (CEC) (2016)","DOI":"10.1109\/CEC.2016.7744158"},{"key":"48_CR8","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/978-3-319-57264-2_38","volume-title":"Cybernetics and Mathematics Applications in Intelligent Systems","author":"I Chaouch","year":"2017","unstructured":"Chaouch, I., Driss, O.B., Ghedira, K.: A survey of optimization techniques for distributed job shop scheduling problems in multi-factories. In: Silhavy, R., Senkerik, R., Kominkova Oplatkova, Z., Prokopova, Z., Silhavy, P. (eds.) CSOC 2017. AISC, vol. 574, pp. 369\u2013378. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57264-2_38"},{"key":"48_CR9","doi-asserted-by":"crossref","unstructured":"Lodree, E.J., Geiger, C.D., Jiang, X.: . Taxonomy for integrating scheduling theory and human factors: Review and research opportunities. Int. J. Ind. Ergon. 39(1), 39\u201351 (2009)","DOI":"10.1016\/j.ergon.2008.05.001"},{"key":"48_CR10","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/j.cie.2016.07.027","volume":"99","author":"S-W Lin","year":"2016","unstructured":"Lin, S.-W., Ying, K.-C.: Minimizing makespan for solving the distributed no-wait flowshop scheduling problem. Comput. Ind. Eng. 99, 202\u2013209 (2016)","journal-title":"Comput. Ind. Eng."},{"key":"48_CR11","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/j.cie.2017.07.020","volume":"111","author":"H Bargaoui","year":"2017","unstructured":"Bargaoui, H., Belkahla Driss, O., Gh\u00e9dira, K.: A novel chemical reaction optimization for the distributed permutation flowshop scheduling problem with makespan criterion. Comput. Ind. Eng. 111, 239\u2013250 (2017)","journal-title":"Comput. Ind. Eng."},{"key":"48_CR12","doi-asserted-by":"publisher","first-page":"1531","DOI":"10.1016\/j.procs.2017.08.057","volume":"112","author":"H Bargaoui","year":"2017","unstructured":"Bargaoui, H., Belkahla Driss, O., Gh\u00e9dira, K.: Towards a distributed implementation of chemical reaction optimization for the multi-factory permutation flowshop scheduling problem. Procedia Comput. Sci. 112, 1531\u20131541 (2017)","journal-title":"Procedia Comput. Sci."},{"key":"48_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105482","volume":"136","author":"W Shao","year":"2021","unstructured":"Shao, W., Shao, Z., Pi, D.: Effective constructive heuristics for distributed no-wait flexible flow shop scheduling problem. Comput. Oper. Res. 136, 105482 (2021)","journal-title":"Comput. Oper. Res."},{"key":"48_CR14","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1016\/j.procs.2019.12.208","volume":"164","author":"H Ochi","year":"2019","unstructured":"Ochi, H., Belkahla Driss, O.: Scheduling the distributed assembly flowshop problem to minimize the makespan. Procedia Comput. Sci. 164, 471\u2013477 (2019)","journal-title":"Procedia Comput. Sci."},{"issue":"2","key":"48_CR15","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/j.ejor.2014.05.024","volume":"239","author":"B Naderi","year":"2014","unstructured":"Naderi, B., Ruiz, R.: A scatter search algorithm for the distributed permutation flowshop scheduling problem. Eur. J. Oper. Res. 239(2), 323\u2013334 (2014)","journal-title":"Eur. J. Oper. Res."},{"key":"48_CR16","doi-asserted-by":"crossref","unstructured":"Meng, T., Pan, Q.-K., Wang, L.; A distributed permutation flowshop scheduling problem with the customer order constraint. Knowledge-Based Systems, 104894 (2019)","DOI":"10.1016\/j.knosys.2019.104894"},{"key":"48_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.105204","volume":"129","author":"F Xiong","year":"2021","unstructured":"Xiong, F., Chu, M., Li, Z., Du, Y., Wang, L.: Just-in-time scheduling for a distributed concrete precast flow shop system. Comput. Oper. Res. 129, 105204 (2021)","journal-title":"Comput. Oper. Res."},{"key":"48_CR18","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1016\/j.cie.2018.03.014","volume":"118","author":"V Fernandez-Viagas","year":"2018","unstructured":"Fernandez-Viagas, V., Perez-Gonzalez, P., Framinan, J.M.: The distributed permutation flow shop to minimize the total flowtime. Comput. Ind. Eng. 118, 464\u2013477 (2018)","journal-title":"Comput. Ind. Eng."},{"key":"48_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106545","volume":"146","author":"A Costa","year":"2020","unstructured":"Costa, A., Fernandez Viagas, V., Framinam, J.M.: Solving the hybrid flow shop scheduling problem with limited human resource constraint. Comput. Ind. Eng. 146, 106545 (2020)","journal-title":"Comput. Ind. Eng."},{"key":"48_CR20","doi-asserted-by":"crossref","unstructured":"Gong, G., Chiong, R., Deng, Q., Han, W., Zhang, L., Lin, W., Li, K.; Energy-efficient flexible flow shop scheduling with worker flexibility. Expert Syst. Appl. 141, 112902 (2019)","DOI":"10.1016\/j.eswa.2019.112902"},{"key":"48_CR21","doi-asserted-by":"crossref","unstructured":"Pargar, F., Zandieh, M., Kauppila, O., Kujala, J. (2018). The Effect of Worker Learning on Scheduling Jobs in a Hybrid Flow Shop: A Bi-Objective Approach. J. Syst. Sci. Syst. Eng. 27, 265\u2013291","DOI":"10.1007\/s11518-018-5361-0"},{"key":"48_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2021.107309","volume":"158","author":"D Bai","year":"2021","unstructured":"Bai, D., Bai, X., Yang, J., Zhang, X., Ren, T., Xie, C., Liu, B.: Minimization of maximum lateness in a flowshop learning effect scheduling with release dates. Comput. Ind. Eng. 158, 107309 (2021)","journal-title":"Comput. Ind. Eng."},{"key":"48_CR23","doi-asserted-by":"crossref","unstructured":"Marichelvam, M.K., Geetha, M., Tosun, \u00d6.; An improved particle swarm optimization algorithm to solve hybrid flowshop scheduling problems with the effect of human factors - a case study. Comput. Oper. Res. 114, 104812 (2019)","DOI":"10.1016\/j.cor.2019.104812"},{"key":"48_CR24","doi-asserted-by":"crossref","unstructured":"Kerdsiri, S., Aramkul, S., Champrasert, P.: Fatigue consideration optimization model for employee allocation in flow shop scheduling problems. In: 2019 IEEE 6th International Conference on Industrial Engineering and Applications (ICIEA) (2019)","DOI":"10.1109\/IEA.2019.8714919"},{"issue":"2","key":"48_CR25","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Sethi, R.: The Complexity of Flowshop and Jobshop Scheduling. Math. Oper. Res. 1(2), 117\u2013129 (1976)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"48_CR26","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.: A heuristic algorithm for the m-machine, n-job flow shop sequencing problem. OMEGA Int. J. Manage. Sci. 11(1), 91\u201395 (1983)","journal-title":"OMEGA Int. J. Manage. Sci."},{"key":"48_CR27","doi-asserted-by":"publisher","first-page":"3001","DOI":"10.1016\/j.cor.2007.01.020","volume":"35","author":"PJ Kalczynski","year":"2008","unstructured":"Kalczynski, P.J., Kamburowski, J.: An improved NEH heuristic to minimize makespan in permutation Flow shops. Comput. Oper. Res. 35, 3001\u20133008 (2008)","journal-title":"Comput. Oper. Res."},{"key":"48_CR28","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1080\/00207540210161650","volume":"41","author":"JM Framinan","year":"2003","unstructured":"Framinan, J.M., Leisten, R., Rajendran, C.: Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem. Int. J. Prod. Res. 41, 121\u2013148 (2003)","journal-title":"Int. J. Prod. Res."}],"container-title":["Communications in Computer and Information Science","Advances in Computational Collective Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-16210-7_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,9]],"date-time":"2023-03-09T12:22:54Z","timestamp":1678364574000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-16210-7_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031162091","9783031162107"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-16210-7_48","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"21 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}