{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T14:40:31Z","timestamp":1773931231812,"version":"3.50.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,7,5]],"date-time":"2022-07-05T00:00:00Z","timestamp":1656979200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,7,5]],"date-time":"2022-07-05T00:00:00Z","timestamp":1656979200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2023,2]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Carrier-based aircraft maintenance tasks are conducted in time-critical, resource-constrained, and uncertain environments. Optimizing the scheduling allocation scheme of maintenance personnel and equipment, reasonably responding to uncertainty disturbances, and maintaining a high fleet availability are vital to the combat and training missions of carrier-based aircraft. The maintenance task scheduling problem for carrier-based aircraft is investigated in this study. First, a mathematical model for comprehensive carrier-based aircraft maintenance task scheduling that considers constraints such as maintenance personnel, equipment\/shop, space, and parallel capacity is developed. Second, to generate the baseline scheduling scheme, an improved non-dominated sorting genetic algorithm II (I_NSGA-II) with local neighborhood search is proposed for the model optimization solution; I_NSGA-II uses the serial scheduling generation scheme mechanism to generate the time sequence scheduling scheme for maintenance personnel and equipment\/workshop of different fleet sizes. Third, to cope with dynamic uncertainty disturbances, two reactive scheduling methods, i.e., complete rescheduling and partial rescheduling, are proposed to perform reactive scheduling corrections to the baseline schedule. Case simulation shows that the established mathematical model is reasonable and practical, and that the proposed I_NSGA-II is superior to the current mainstream algorithms. In addition, the decision maker can select between the two reactive scheduling methods flexibly based on the different forms and scales of disturbance.<\/jats:p>","DOI":"10.1007\/s40747-022-00784-9","type":"journal-article","created":{"date-parts":[[2022,7,5]],"date-time":"2022-07-05T05:02:33Z","timestamp":1656997353000},"page":"367-397","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["A baseline-reactive scheduling method for carrier-based aircraft maintenance tasks"],"prefix":"10.1007","volume":"9","author":[{"given":"Yong","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Changjiu","family":"Li","sequence":"additional","affiliation":[]},{"given":"Xichao","family":"Su","sequence":"additional","affiliation":[]},{"given":"Rongwei","family":"Cui","sequence":"additional","affiliation":[]},{"given":"Bing","family":"Wan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,7,5]]},"reference":[{"key":"784_CR1","doi-asserted-by":"publisher","first-page":"49","DOI":"10.12011\/1000-6788(2017)01-0049-12","volume":"37","author":"A Liu","year":"2017","unstructured":"Liu A, Liu K (2017) Advances in carrier-based aircraft deck operation scheduling. Syst Eng Theory Pract 37:49\u201360. https:\/\/doi.org\/10.12011\/1000-6788(2017)01-0049-12","journal-title":"Syst Eng Theory Pract"},{"key":"784_CR2","doi-asserted-by":"publisher","first-page":"226","DOI":"10.3901\/JME.2018.24.226","volume":"54","author":"X Zan","year":"2018","unstructured":"Zan X, Chen C, Zhang S, Chen W, Mei Y (2018) Task scheduling method for wartime equipment maintenance considering time uncertainty. J Mech Eng 54:226\u2013232. https:\/\/doi.org\/10.3901\/JME.2018.24.226","journal-title":"J Mech Eng"},{"key":"784_CR3","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s12204-019-2039-9","volume":"24","author":"R Dong","year":"2019","unstructured":"Dong R, Wang S, Wang G, Wang X (2019) Hybrid optimization algorithm based on wolf pack search and local search for solving traveling salesman problem. J Shanghai Jiaotong Univ (Science) 24:41\u201347. https:\/\/doi.org\/10.1007\/s12204-019-2039-9","journal-title":"J Shanghai Jiaotong Univ (Science)"},{"key":"784_CR4","doi-asserted-by":"publisher","first-page":"1103","DOI":"10.17559\/TV-20171214025731","volume":"25","author":"J Cui","year":"2018","unstructured":"Cui J (2018) The application of improved bacteria foraging algorithm to the optimization of aviation equipment maintenance scheduling. Tehnicki Vjesnik 25:1103\u20131109. https:\/\/doi.org\/10.17559\/TV-20171214025731","journal-title":"Tehnicki Vjesnik"},{"key":"784_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.104943","volume":"122","author":"R Boufellouh","year":"2020","unstructured":"Boufellouh R, Belkaid F (2020) Bi-objective optimization algorithms for joint production and maintenance scheduling under a global resource constraint: application to the permutation flow shop problem. Comput Oper Res 122:104943. https:\/\/doi.org\/10.1016\/j.cor.2020.104943","journal-title":"Comput Oper Res"},{"key":"784_CR6","doi-asserted-by":"publisher","unstructured":"Abrah\u00e3o FTM, Gualda NDF (2006) Fleet maintenance scheduling with an ant colony system approach. In: International workshop on ant colony optimization and swarm intelligence. Springer, pp 412\u20139. https:\/\/doi.org\/10.1007\/11839088_40","DOI":"10.1007\/11839088_40"},{"key":"784_CR7","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/j.cie.2018.05.001","volume":"120","author":"M Rashidnejad","year":"2018","unstructured":"Rashidnejad M, Ebrahimnejad S, Safari J (2018) A bi-objective model of preventive maintenance planning in distributed systems considering vehicle routing problem. Comput Ind Eng 120:360\u2013381. https:\/\/doi.org\/10.1016\/j.cie.2018.05.001","journal-title":"Comput Ind Eng"},{"key":"784_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.04.030","volume":"81","author":"J Li","year":"2019","unstructured":"Li J, Li T, Yu Y, Zhang Z, Pardalos PM, Zhang Y et al (2019) Discrete firefly algorithm with compound neighborhoods for asymmetric multi-depot vehicle routing problem in the maintenance of farm machinery. Appl Soft Comput 81:105460. https:\/\/doi.org\/10.1016\/j.asoc.2019.04.030","journal-title":"Appl Soft Comput"},{"key":"784_CR9","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.endm.2014.11.030","volume":"47","author":"A Dhahri","year":"2015","unstructured":"Dhahri A, Zidi K, Ghedira K (2015) A variable neighborhood search for the vehicle routing problem with time windows and preventive maintenance activities. Electron Notes Discrete Math 47:229\u2013236. https:\/\/doi.org\/10.1016\/j.endm.2014.11.030","journal-title":"Electron Notes Discrete Math"},{"key":"784_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2021.100933","author":"Y Wang","year":"2021","unstructured":"Wang Y, Limmer S, Olhofer M, Emmerich M, B\u00e4ck T (2021) Automatic preference based multi-objective evolutionary algorithm on vehicle fleet maintenance scheduling optimization. Swarm Evolut Comput. https:\/\/doi.org\/10.1016\/j.swevo.2021.100933","journal-title":"Swarm Evolut Comput"},{"key":"784_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106981","volume":"151","author":"RK Chakrabortty","year":"2021","unstructured":"Chakrabortty RK, Rahman HF, Haque KMA, Paul SK, Ryan MJ (2021) An event-based reactive scheduling approach for the resource constrained project scheduling problem with unreliable resources. Comput Ind Eng 151:106981. https:\/\/doi.org\/10.1016\/j.cie.2020.106981","journal-title":"Comput Ind Eng"},{"key":"784_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.orp.2019.100129","volume":"6","author":"ZT Koszty\u00e1n","year":"2019","unstructured":"Koszty\u00e1n ZT, Pribojszki-N\u00e9meth A, Szalkai I (2019) Hybrid multimode resource-constrained maintenance project scheduling problem. Oper Res Perspect 6:100129. https:\/\/doi.org\/10.1016\/j.orp.2019.100129","journal-title":"Oper Res Perspect"},{"key":"784_CR13","doi-asserted-by":"publisher","first-page":"1856","DOI":"10.12305\/j.issn.1001-506X.2021.07.17","volume":"43","author":"B Zeng","year":"2021","unstructured":"Zeng B, Chen Y, Li H (2021) Launch scheduling optimization considering availability of maintenance equipment for carrier aircraft. Syst Eng Electron 43:1856\u20131865. https:\/\/doi.org\/10.12305\/j.issn.1001-506X.2021.07.17","journal-title":"Syst Eng Electron"},{"key":"784_CR14","doi-asserted-by":"publisher","first-page":"1428","DOI":"10.4028\/www.scientific.net\/AMM.239-240.1428","volume":"239","author":"Q Han","year":"2013","unstructured":"Han Q, Cao W, Zhang Y (2013) Research on maintenance resources distribution based on queuing theory. Appl Mech Mater 239:1428\u20131431. https:\/\/doi.org\/10.4028\/www.scientific.net\/AMM.239-240.1428","journal-title":"Appl Mech Mater"},{"key":"784_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.dss.2021.113545","volume":"146","author":"Q Deng","year":"2021","unstructured":"Deng Q, Santos BF, Verhagen WJC (2021) A novel decision support system for optimizing aircraft maintenance check schedule and task allocation. Decis Support Syst 146:113545. https:\/\/doi.org\/10.1016\/j.dss.2021.113545","journal-title":"Decis Support Syst"},{"key":"784_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105755","volume":"85","author":"L Lin","year":"2019","unstructured":"Lin L, Wang F, Luo B (2019) An optimization algorithm inspired by propagation of yeast for fleet maintenance decision making problem involving fatigue structures. Appl Soft Comput 85:105755. https:\/\/doi.org\/10.1016\/j.asoc.2019.105755","journal-title":"Appl Soft Comput"},{"key":"784_CR17","doi-asserted-by":"publisher","first-page":"2303","DOI":"10.3969\/j.issn.1001-506X.2016.10.12","volume":"38","author":"X Su","year":"2016","unstructured":"Su X, Han W, Xiao W, Jiang T (2016) Pit-stop support scheduling on deck of carrier plane based on memetic algorithm. Syst Eng Electron 38:2303\u20132309. https:\/\/doi.org\/10.3969\/j.issn.1001-506X.2016.10.12","journal-title":"Syst Eng Electron"},{"key":"784_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.ast.2020.106346","volume":"107","author":"R Cui","year":"2020","unstructured":"Cui R, Han W, Su X, Zhang Y, Guo F (2020) A multi-objective hyper heuristic framework for integrated optimization of carrier-based aircraft flight deck operations scheduling and resource configuration. Aerosp Sci Technol 107:106346. https:\/\/doi.org\/10.1016\/j.ast.2020.106346","journal-title":"Aerosp Sci Technol"},{"key":"784_CR19","doi-asserted-by":"publisher","first-page":"331","DOI":"10.23919\/JSEE.2021.000028","volume":"32","author":"R Cui","year":"2021","unstructured":"Cui R, Han W, Su X, Liang H, Li Z (2021) A dual population multi-operator genetic algorithm for flight deck operations scheduling problem. J Syst Eng Electron 32:331\u2013346. https:\/\/doi.org\/10.23919\/JSEE.2021.000028","journal-title":"J Syst Eng Electron"},{"key":"784_CR20","doi-asserted-by":"publisher","first-page":"1546","DOI":"10.3390\/app8091546","volume":"8","author":"P Yuan","year":"2018","unstructured":"Yuan P, Han W, Su X, Liu J, Song J (2018) A dynamic scheduling method for carrier aircraft support operation under uncertain conditions based on rolling horizon strategy. Appl Sci 8:1546. https:\/\/doi.org\/10.3390\/app8091546","journal-title":"Appl Sci"},{"key":"784_CR21","doi-asserted-by":"publisher","first-page":"69918","DOI":"10.1109\/ACCESS.2018.2879503","volume":"6","author":"X Su","year":"2018","unstructured":"Su X, Han W, Wu Y, Zhang Y, Song J (2018) A robust scheduling optimization method for flight deck operations of aircraft carrier with ternary interval durations. IEEE Access 6:69918\u201369936. https:\/\/doi.org\/10.1109\/ACCESS.2018.2879503","journal-title":"IEEE Access"},{"key":"784_CR22","doi-asserted-by":"publisher","DOI":"10.1155\/2018\/6932985","author":"X Su","year":"2018","unstructured":"Su X, Han W, Wu Y, Zhang Y, Liu J (2018) A proactive robust scheduling method for aircraft carrier flight deck operations with stochastic durations. Complexity. https:\/\/doi.org\/10.1155\/2018\/6932985","journal-title":"Complexity"},{"key":"784_CR23","doi-asserted-by":"publisher","DOI":"10.7527\/S1000-6893.2021.25971","volume":"42","author":"B Wan","year":"2021","unstructured":"Wan B, Su X, Guo F, Han W, Liang Y (2021) A study for proactive robust scheduling of aircraft carrier flight deck operations with uncertain activity durations. Acta Aeronaut Astronaut Sin 42:325971. https:\/\/doi.org\/10.7527\/S1000-6893.2021.25971","journal-title":"Acta Aeronaut Astronaut Sin"},{"key":"784_CR24","doi-asserted-by":"publisher","first-page":"595","DOI":"10.3969\/j.issn.1001-506X.2016.03.19","volume":"38","author":"B Zeng","year":"2016","unstructured":"Zeng B, Yao L, Hu W, Yang G (2016) Scheduling algorithm for maintenance tasks under uncertainty. Syst Eng Electron 38:595\u2013601. https:\/\/doi.org\/10.3969\/j.issn.1001-506X.2016.03.19","journal-title":"Syst Eng Electron"},{"key":"784_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.114132","volume":"167","author":"S Elloumi","year":"2021","unstructured":"Elloumi S, Loukil T, Fortemps P (2021) Reactive heuristics for disrupted multi-mode resource-constrained project scheduling problem. Expert Syst Appl 167:114132. https:\/\/doi.org\/10.1016\/j.eswa.2020.114132","journal-title":"Expert Syst Appl"},{"key":"784_CR26","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s10951-016-0505-x","volume":"21","author":"S Rostami","year":"2018","unstructured":"Rostami S, Creemers S, Leus R (2018) New strategies for stochastic resource-constrained project scheduling. J Sched 21:349\u2013365. https:\/\/doi.org\/10.1007\/s10951-016-0505-x","journal-title":"J Sched"},{"key":"784_CR27","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/s10951-008-0090-8","volume":"12","author":"D Ouelhadj","year":"2009","unstructured":"Ouelhadj D, Petrovic S (2009) A survey of dynamic scheduling in manufacturing systems. J Sched 12:417\u2013431. https:\/\/doi.org\/10.1007\/s10951-008-0090-8","journal-title":"J Sched"},{"key":"784_CR28","doi-asserted-by":"publisher","first-page":"871","DOI":"10.1111\/itor.12066","volume":"21","author":"J Teghem","year":"2014","unstructured":"Teghem J, Tuyttens D (2014) A bi-objective approach to reschedule new jobs in a one machine model. Int Trans Oper Res 21:871\u2013898. https:\/\/doi.org\/10.1111\/itor.12066","journal-title":"Int Trans Oper Res"},{"key":"784_CR29","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s10951-013-0311-7","volume":"16","author":"Q Zhao","year":"2013","unstructured":"Zhao Q, Yuan J (2013) Pareto optimization of rescheduling with release dates to minimize makespan and total sequence disruption. J Sched 16:253\u2013260. https:\/\/doi.org\/10.1007\/s10951-013-0311-7","journal-title":"J Sched"},{"key":"784_CR30","doi-asserted-by":"publisher","first-page":"746","DOI":"10.1287\/opre.1090.0751","volume":"58","author":"NG Hall","year":"2010","unstructured":"Hall NG, Potts CN (2010) Rescheduling for job unavailability. Oper Res 58:746\u2013755. https:\/\/doi.org\/10.1287\/opre.1090.0751","journal-title":"Oper Res"},{"key":"784_CR31","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1016\/j.jmsy.2013.04.002","volume":"32","author":"F Liu","year":"2013","unstructured":"Liu F, Wang J-J, Yang D-L (2013) Solving single machine scheduling under disruption with discounted costs by quantum-inspired hybrid heuristics. J Manuf Syst 32:715\u2013723. https:\/\/doi.org\/10.1016\/j.jmsy.2013.04.002","journal-title":"J Manuf Syst"},{"key":"784_CR32","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s10951-014-0372-2","volume":"17","author":"Z Liu","year":"2014","unstructured":"Liu Z, Ro YK (2014) Rescheduling for machine disruption to minimize makespan and maximum lateness. J Sched 17:339\u2013352. https:\/\/doi.org\/10.1007\/s10951-014-0372-2","journal-title":"J Sched"},{"key":"784_CR33","doi-asserted-by":"publisher","first-page":"1899","DOI":"10.1080\/002075400188654","volume":"38","author":"GE Vieira","year":"2000","unstructured":"Vieira GE, Herrmann JW, Lin E (2000) Analytical models to predict the performance of a single-machine system under periodic and event-driven rescheduling strategies. Int J Prod Res 38:1899\u20131915. https:\/\/doi.org\/10.1080\/002075400188654","journal-title":"Int J Prod Res"},{"key":"784_CR34","doi-asserted-by":"publisher","first-page":"2065","DOI":"10.1080\/002075497195074","volume":"35","author":"RJ Abumaizar","year":"1997","unstructured":"Abumaizar RJ, Svestka JA (1997) Rescheduling job shops under random disruptions. Int J Prod Res 35:2065\u20132082. https:\/\/doi.org\/10.1080\/002075497195074","journal-title":"Int J Prod Res"},{"key":"784_CR35","doi-asserted-by":"publisher","first-page":"1157","DOI":"10.1016\/S0098-1354(96)00327-4","volume":"21","author":"E Sanmart\u00ed","year":"1997","unstructured":"Sanmart\u00ed E, Espu\u00f1a A, Puigjaner L (1997) Batch production and preventive maintenance scheduling under equipment failure uncertainty. Comput Chem Eng 21:1157\u20131168. https:\/\/doi.org\/10.1016\/S0098-1354(96)00327-4","journal-title":"Comput Chem Eng"},{"key":"784_CR36","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-1-4615-5533-9_7","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 Evol Comput 6:182\u2013197. https:\/\/doi.org\/10.1007\/978-1-4615-5533-9_7","journal-title":"IEEE Trans Evol Comput"},{"key":"784_CR37","doi-asserted-by":"crossref","unstructured":"Kolisch R, Hartmann S (1999) Heuristic algorithms for the resource-constrained project scheduling problem: Classification and computational analysis. Project scheduling. Springer, pp 147\u201378","DOI":"10.1007\/978-1-4615-5533-9_7"},{"key":"784_CR38","doi-asserted-by":"publisher","first-page":"641","DOI":"10.13195\/j.cd.2010.05.3.fangch.027","volume":"25","author":"C Fang","year":"2010","unstructured":"Fang C, Wang L (2010) Survey on resource-constrained project scheduling. Control Decis 25:641\u2013656. https:\/\/doi.org\/10.13195\/j.cd.2010.05.3.fangch.027","journal-title":"Control Decis"},{"key":"784_CR39","doi-asserted-by":"publisher","first-page":"2751","DOI":"10.13195\/j.kzyjc.2020.0523","volume":"36","author":"W Han","year":"2021","unstructured":"Han W, Cui R, Su X, Zhang Y (2021) Flight deck operations scheduling based on dual population fuzzy gravitational search algorithm. Control Decis 36:2751\u20132759. https:\/\/doi.org\/10.13195\/j.kzyjc.2020.0523","journal-title":"Control Decis"},{"key":"784_CR40","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2020.107183","volume":"172","author":"C Khammassi","year":"2020","unstructured":"Khammassi C, Krichen S (2020) A NSGA2-LR wrapper approach for feature selection in network intrusion detection. Comput Netw 172:107183. https:\/\/doi.org\/10.1016\/j.comnet.2020.107183","journal-title":"Comput Netw"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-022-00784-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-022-00784-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-022-00784-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,22]],"date-time":"2023-02-22T18:50:24Z","timestamp":1677091824000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-022-00784-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,5]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["784"],"URL":"https:\/\/doi.org\/10.1007\/s40747-022-00784-9","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,5]]},"assertion":[{"value":"26 January 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 May 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 July 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All authors certify that they have no affiliations with or involvement in any organization or entity with any financial interest or non-financial interest in the subject matter or materials discussed in this manuscript.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}