{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,27]],"date-time":"2026-06-27T15:08:56Z","timestamp":1782572936331,"version":"3.54.5"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T00:00:00Z","timestamp":1602633600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T00:00:00Z","timestamp":1602633600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"National Key Technology Research and Development Program of China","award":["2016YFB1101700"],"award-info":[{"award-number":["2016YFB1101700"]}]},{"DOI":"10.13039\/501100003819","name":"Natural Science Foundation of Hubei Province","doi-asserted-by":"crossref","award":["2015CFA115"],"award-info":[{"award-number":["2015CFA115"]}],"id":[{"id":"10.13039\/501100003819","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2021,2]]},"DOI":"10.1007\/s00500-020-05347-z","type":"journal-article","created":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T19:02:56Z","timestamp":1602702176000},"page":"2863-2889","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":62,"title":["A novel multi-objective optimization algorithm for the integrated scheduling of flexible job shops considering preventive maintenance activities and transportation processes"],"prefix":"10.1007","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7170-9311","authenticated-orcid":false,"given":"Hui","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Buyun","family":"Sheng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qibing","family":"Lu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiyan","family":"Yin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Feiyu","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xincheng","family":"Lu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ruiping","family":"Luo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gaocai","family":"Fu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,10,14]]},"reference":[{"key":"5347_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113348","author":"M Abedi","year":"2020","unstructured":"Abedi M, Chiong R, Noman N, Zhang R (2020) A multi-population, multi-objective memetic algorithm for energy-efficient job-shop scheduling with deteriorating machines. Expert Syst Appl. https:\/\/doi.org\/10.1016\/j.eswa.2020.113348","journal-title":"Expert Syst Appl"},{"issue":"4","key":"5347_CR2","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/j.future.2009.10.004","volume":"26","author":"A Bagheri","year":"2010","unstructured":"Bagheri A, Zandieh M, Mahdavi I, Yazdani M (2010) An artificial immune algorithm for the flexible job-shop scheduling problem. Future Gener Comput Syst 26(4):533\u2013541","journal-title":"Future Gener Comput Syst"},{"issue":"2","key":"5347_CR3","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evolut Comput 6(2):182\u2013197","journal-title":"IEEE Trans Evolut Comput"},{"issue":"3","key":"5347_CR4","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s10845-007-0026-8","volume":"18","author":"P Fattahi","year":"2007","unstructured":"Fattahi P, Mehrabad MS, Jolai F (2007) Mathematical modeling and heuristic approaches to flexible job shop scheduling problems. J Intell Manuf 18(3):331\u2013342","journal-title":"J Intell Manuf"},{"issue":"3","key":"5347_CR5","doi-asserted-by":"publisher","first-page":"1802","DOI":"10.1016\/j.ifacol.2015.06.348","volume":"48","author":"N Fnaiech","year":"2015","unstructured":"Fnaiech N, Fitouri C, Varnier C, Fnaiech F, Zerhouni N (2015) A new heuristic method for solving joint job shop scheduling of production and maintenance. IFAC-Papers OnLine 48(3):1802\u20131808","journal-title":"IFAC-Papers OnLine"},{"issue":"4","key":"5347_CR6","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/s10845-005-0021-x","volume":"17","author":"J Gao","year":"2006","unstructured":"Gao J, Gen M, Sun L (2006) Scheduling jobs and maintenances in flexible job shop with a hybrid genetic algorithm. J Intell Manuf 17(4):493\u2013507","journal-title":"J Intell Manuf"},{"key":"5347_CR7","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1016\/j.procir.2019.02.119","volume":"79","author":"J Heger","year":"2018","unstructured":"Heger J, Vo\u00df T (2018) Dynamic priority based dispatching of AGVs in flexible job shops. Procedia CIRP 79:445\u2013449","journal-title":"Procedia CIRP"},{"key":"5347_CR8","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1016\/j.asoc.2017.04.062","volume":"57","author":"RH Huang","year":"2017","unstructured":"Huang RH, Yu TH (2017) An effective ant colony optimization algorithm for multi-objective job-shop scheduling with equal-size lot-splitting. Appl Soft Comput 57:642\u2013656","journal-title":"Appl Soft Comput"},{"key":"5347_CR9","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/j.eswa.2016.01.054","volume":"55","author":"A Jamili","year":"2016","unstructured":"Jamili A (2016) Robust job shop scheduling problem: mathematical models, exact and heuristic algorithms. Expert Syst Appl 55:341\u2013350","journal-title":"Expert Syst Appl"},{"issue":"3","key":"5347_CR10","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1109\/TEVC.2016.2592479","volume":"21","author":"S Jiang","year":"2017","unstructured":"Jiang S, Yang S (2017) A strength pareto evolutionary algorithm based on reference direction for multiobjective and many-objective optimization. IEEE Trans Evolut Comput 21(3):329\u2013346","journal-title":"IEEE Trans Evolut Comput"},{"key":"5347_CR11","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.eswa.2015.09.050","volume":"45","author":"V Kaplano\u011flu","year":"2016","unstructured":"Kaplano\u011flu V (2016) An object-oriented approach for multi-objective flexible job-shop scheduling problem. Expert Syst Appl 45:71\u201384","journal-title":"Expert Syst Appl"},{"key":"5347_CR12","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1016\/j.apm.2016.09.022","volume":"41","author":"S Karimi","year":"2017","unstructured":"Karimi S, Ardalan Z, Naderi B, Mohammadi M (2017) Scheduling flexible job-shops with transportation times: mathematical models and a hybrid imperialist competitive algorithm. Appl Math Modell 41:667\u2013682","journal-title":"Appl Math Modell"},{"key":"5347_CR13","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.cie.2016.10.019","volume":"106","author":"FE Khoukhi","year":"2017","unstructured":"Khoukhi FE, Boukachour J, Alaoui AEH (2017) The \u201cDual-Ants Colony\u201d: a novel hybrid approach for the flexible job shop scheduling problem with preventive maintenance. Comput Ind Eng 106:236\u2013255","journal-title":"Comput Ind Eng"},{"issue":"3","key":"5347_CR15","doi-asserted-by":"publisher","first-page":"1111","DOI":"10.1016\/j.apm.2013.07.038","volume":"38","author":"JQ Li","year":"2014","unstructured":"Li JQ, Pan QK, Tasgetiren MF (2014) A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities. Appl Math Modell 38(3):1111\u20131132","journal-title":"Appl Math Modell"},{"key":"5347_CR16","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/j.cie.2017.09.005","volume":"113","author":"XX Li","year":"2017","unstructured":"Li XX, Zhao P, Du BG, Guo J, Xu WX, Zhuang KJ (2017) Hybrid artificial bee colony algorithm with a rescheduling strategy for solving flexible job shop scheduling problems. Comput Ind Eng 113:10\u201326","journal-title":"Comput Ind Eng"},{"key":"5347_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.jclepro.2020.120009","author":"YF Li","year":"2020","unstructured":"Li YF, He Y, Wang YL, Tao F, Sutherland JW (2020) An optimization method for energy-conscious production in flexible machining job shops with dynamic job arrivals and machine breakdowns. J Clean Product. https:\/\/doi.org\/10.1016\/j.jclepro.2020.120009","journal-title":"J Clean Product"},{"key":"5347_CR18","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/j.asoc.2016.11.014","volume":"50","author":"JP Luo","year":"2017","unstructured":"Luo JP, Liu QQ, Yang Y, Li X, Chen MR, Cao WM (2017) An artificial bee colony algorithm for multi-objective optimisation. Appl Soft Comput 50:235\u2013251","journal-title":"Appl Soft Comput"},{"key":"5347_CR19","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.asoc.2017.01.024","volume":"54","author":"H Maghsoudlou","year":"2017","unstructured":"Maghsoudlou H, Afshar-Nadjafi B, Niaki STA (2017) Multi-skilled project scheduling with level-dependent rework risk; three multi-objective mechanisms based on cuckoo search. Appl Soft Comput 54:46\u201361","journal-title":"Appl Soft Comput"},{"key":"5347_CR20","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1016\/j.cie.2015.06.006","volume":"87","author":"R Manzini","year":"2015","unstructured":"Manzini R, Accorsi R, Cennerazzo T, Ferrari E, Maranesi F (2015) The scheduling of maintenance. A resource-constraints mixed integer linear programming model. Comput Ind Eng 87:561\u2013568","journal-title":"Comput Ind Eng"},{"key":"5347_CR21","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.cie.2019.05.034","volume":"135","author":"HH Miyata","year":"2019","unstructured":"Miyata HH, Nagano MS, Gupta JND (2019) Integrating preventive maintenance activities to the no-wait flow shop scheduling problem with dependent-sequence setup times and makespan minimization. Comput Ind Eng 135:79\u2013104","journal-title":"Comput Ind Eng"},{"key":"5347_CR22","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.cor.2015.02.014","volume":"61","author":"H Mokhtari","year":"2015","unstructured":"Mokhtari H, Dadgar M (2015) Scheduling optimization of a stochastic flexible job-shop system with time-varying machine failure rate. Comput Oper Res 61:31\u201345","journal-title":"Comput Oper Res"},{"issue":"5","key":"5347_CR23","doi-asserted-by":"publisher","first-page":"1275","DOI":"10.1016\/j.cam.2010.08.013","volume":"235","author":"B Naderi","year":"2011","unstructured":"Naderi B, Ghomi SMTF, Aminnayeri M, Zandieh M (2011) Scheduling open shops with parallel machines to minimize total completion time. J Comput Appl Math 235(5):1275\u20131287","journal-title":"J Comput Appl Math"},{"issue":"3","key":"5347_CR24","doi-asserted-by":"publisher","first-page":"1492","DOI":"10.1016\/j.mspro.2014.07.336","volume":"5","author":"M Nageswararao","year":"2014","unstructured":"Nageswararao M, Narayanarao K, Ranagajanardhana G (2014) Simultaneous scheduling of machines and AGVs in flexible manufacturing system with minimization of tardiness criterion. Proc Mater Sci 5(3):1492\u20131501","journal-title":"Proc Mater Sci"},{"issue":"3","key":"5347_CR25","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1007\/s10845-015-1039-3","volume":"29","author":"M Nouiri","year":"2018","unstructured":"Nouiri M, Bekrar A, Jemai A, Niar S, Ammari AC (2018) An effective and distributed particle swarm optimization algorithm for flexible job-shop scheduling problem. J Intell Manuf 29(3):603\u2013615","journal-title":"J Intell Manuf"},{"key":"5347_CR26","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1016\/j.cie.2016.02.024","volume":"102","author":"HE Nouri","year":"2016","unstructured":"Nouri HE, Driss OB, Ghedira K (2016) Simultaneous scheduling of machines and transport robots in flexible job shop environment using hybrid metaheuristics based on clustered holonic multiagent model. Comput Ind Eng 102:488\u2013501","journal-title":"Comput Ind Eng"},{"key":"5347_CR27","first-page":"895","volume":"17","author":"R Ojstersek","year":"2018","unstructured":"Ojstersek R, Zhang HK, Liu SF, Buchmeister B (2018) Improved heuristic kalman algorithm for solving multi-objective flexible job shop scheduling problem. Proc Manuf 17:895\u2013902","journal-title":"Proc Manuf"},{"issue":"1","key":"5347_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(98)00367-1","volume":"121","author":"G Schmidt","year":"2000","unstructured":"Schmidt G (2000) Scheduling with limited machine availability. Eur J Oper Res 121(1):1\u201315","journal-title":"Eur J Oper Res"},{"issue":"4","key":"5347_CR29","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1109\/TEVC.2011.2161872","volume":"16","author":"O Schutze","year":"2012","unstructured":"Schutze O, Esquivel X, Lara A, Coello Coello CA (2012) Using the averaged Hausdorff distance as a performance measure in evolutionary multi-objective optimization. IEEE Trans Evolut Comput 16(4):504\u2013522","journal-title":"IEEE Trans Evolut Comput"},{"key":"5347_CR30","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.cor.2015.11.004","volume":"68","author":"O Sobeyko","year":"2016","unstructured":"Sobeyko O, M\u00f6nch L (2016) Heuristic approaches for scheduling jobs in large-scale flexible job shops. Comput Oper Res 68:97\u2013109","journal-title":"Comput Oper Res"},{"key":"5347_CR31","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2019.100632","author":"C Soto","year":"2020","unstructured":"Soto C, Dorronsoro B, Fraire H, Cruz-Reyes L, Gomez-Santillan C, Rangel N (2020) Solving the multi-objective flexible job shop scheduling problem with a novel parallel branch and bound algorithm. Swarm Evolut Comput. https:\/\/doi.org\/10.1016\/j.swevo.2019.100632","journal-title":"Swarm Evolut Comput"},{"key":"5347_CR33","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.neucom.2013.06.043","volume":"127","author":"SM Venske","year":"2014","unstructured":"Venske SM, Goncalves RA, Delgado MR (2014) ADEMO\/D: multiobjective optimization by an adaptive differential evolution algorithm. Neurocomputing 127:65\u201377","journal-title":"Neurocomputing"},{"key":"5347_CR34","first-page":"1","volume":"2013","author":"W Wan","year":"2013","unstructured":"Wan W, Birch JB (2013) An improved hybrid genetic algorithm with a new local search procedure. J Appl Math 2013:1\u201310","journal-title":"J Appl Math"},{"key":"5347_CR35","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1016\/j.cie.2010.05.016","volume":"59","author":"SJ Wang","year":"2010","unstructured":"Wang SJ, Yu JB (2010) An effective heuristic for flexible job-shop scheduling problem with maintenance activities. Comput Ind Eng 59:436\u2013447","journal-title":"Comput Ind Eng"},{"key":"5347_CR36","doi-asserted-by":"publisher","first-page":"1004","DOI":"10.1016\/j.cie.2019.06.048","volume":"135","author":"XL Wu","year":"2019","unstructured":"Wu XL, Shen XL, Li CB (2019) The flexible job-shop scheduling problem considering deterioration effect and energy consumption simultaneously. Comput Ind Eng 135:1004\u20131024","journal-title":"Comput Ind Eng"},{"issue":"1","key":"5347_CR37","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1109\/TEVC.2016.2587808","volume":"21","author":"Y Xiang","year":"2017","unstructured":"Xiang Y, Zhou Y, Li M, Chen Z (2017) A vector angle-based evolutionary algorithm for unconstrained many-objective optimization. IEEE Trans Evolut Comput 21(1):131\u2013152","journal-title":"IEEE Trans Evolut Comput"},{"key":"5347_CR38","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.ress.2015.10.013","volume":"146","author":"L Xiao","year":"2016","unstructured":"Xiao L, Song SL, Chen XH, Coit DW (2016) Joint optimization of production scheduling and machine group preventive maintenance. Reliab Eng Syst Saf 146:68\u201378","journal-title":"Reliab Eng Syst Saf"},{"key":"5347_CR39","first-page":"1194","volume":"39","author":"J Xie","year":"2019","unstructured":"Xie J, Gao L, Pan QK, Tasgetiren MF (2019) An effective multi-objective artificial bee colony algorithm for energy efficient distributed job shop scheduling. Proc Manuf 39:1194\u20131203","journal-title":"Proc Manuf"},{"key":"5347_CR41","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/j.asoc.2017.04.060","volume":"58","author":"M Zandieh","year":"2017","unstructured":"Zandieh M, Khatami AR, Rahmati SHA (2017) Flexible job shop scheduling under condition-based maintenance: improved version of imperialist competitive algorithm. Appl Soft Comput 58:449\u2013464","journal-title":"Appl Soft Comput"},{"key":"5347_CR43","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.procs.2013.09.243","volume":"20","author":"WQ Zhang","year":"2013","unstructured":"Zhang WQ, Xu W, Gen M (2013) Multi-objective evolutionary algorithm with strong convergence of multi-area for assembly line balancing problem with worker capability. Proc Comput Sci 20:83\u201389","journal-title":"Proc Comput Sci"},{"key":"5347_CR44","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100664","author":"GH Zhang","year":"2020","unstructured":"Zhang GH, Hu YF, Sun JH, Zhang WQ (2020) An improved genetic algorithm for the flexible job shop scheduling problem with multiple time constraints. Swarm Evolut Comput. https:\/\/doi.org\/10.1016\/j.swevo.2020.100664","journal-title":"Swarm Evolut Comput"},{"key":"5347_CR45","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106217","author":"BH Zhou","year":"2020","unstructured":"Zhou BH, Liao XM (2020) Particle filter and Levy flight-based decomposed multi-objective evolution hybridized particle swarm for flexible job shop greening scheduling with crane transportation. Appl Soft Comput J. https:\/\/doi.org\/10.1016\/j.asoc.2020.106217","journal-title":"Appl Soft Comput J"},{"issue":"4","key":"5347_CR46","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans Evolut Comput 3(4):257\u2013271","journal-title":"IEEE Trans Evolut Comput"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-020-05347-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-020-05347-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-020-05347-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,14]],"date-time":"2021-10-14T01:29:35Z","timestamp":1634174975000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-020-05347-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,14]]},"references-count":42,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,2]]}},"alternative-id":["5347"],"URL":"https:\/\/doi.org\/10.1007\/s00500-020-05347-z","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,10,14]]},"assertion":[{"value":"14 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"We declare that we have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Human participants"}}]}}