{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,27]],"date-time":"2025-06-27T09:55:19Z","timestamp":1751018119257,"version":"3.37.3"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2023,6,14]],"date-time":"2023-06-14T00:00:00Z","timestamp":1686700800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,6,14]],"date-time":"2023-06-14T00:00:00Z","timestamp":1686700800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100010903","name":"Key Programme","doi-asserted-by":"publisher","award":["U2013602"],"award-info":[{"award-number":["U2013602"]}],"id":[{"id":"10.13039\/501100010903","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2023,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The disaster information collection mission should be executed after the disaster occurs to provide details for the decision-makers. During the execution of the information collection mission, some disruptions may occur and prevent the resource used for information collection from completing the mission as planned. It is difficult for decision-makers to make reactive resource scheduling plan that optimize the mission\u2019s execution time, quality, and cost at the same time under such circumstances. This article focuses on designing the reactive decision support algorithm for the disaster information collection resource scheduling, which aims to provide multi high-quality scheduling plans for decision-makers to choose. The problem studied in this article is modeled as an extension of Resource-Constrained Project Scheduling Problem (RCPSP). First, the basic problem formulation for a normal schedule and two disruption recovery models are presented. Second, a novel framework of a parallel pareto local search based on decomposition is designed to repair the schedule within the time limit. Third, two solution acceptance criteria based on constraint handling and negative correlation are specially designed to maintain high-quality population with diversity. The experiments show that the proposed method outperforms the other competitors with respect to Inverted Generational Distance, Spacing, and Hypervolume, which means that the proposed method can help decision-makers to make better decisions.<\/jats:p>","DOI":"10.1007\/s40747-023-01087-3","type":"journal-article","created":{"date-parts":[[2023,6,14]],"date-time":"2023-06-14T03:27:42Z","timestamp":1686713262000},"page":"7055-7073","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A problem-specific parallel pareto local search for the reactive decision support of a special RCPSP extension"],"prefix":"10.1007","volume":"9","author":[{"given":"Junqi","family":"Cai","sequence":"first","affiliation":[]},{"given":"Zhihong","family":"Peng","sequence":"additional","affiliation":[]},{"given":"Shuxin","family":"Ding","sequence":"additional","affiliation":[]},{"given":"Zhiguo","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Yue","family":"Wei","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,14]]},"reference":[{"key":"1087_CR1","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.tre.2015.01.008","volume":"75","author":"M Ahmadi","year":"2015","unstructured":"Ahmadi M, Seifi A, Tootooni B (2015) A humanitarian logistics model for disaster relief operation considering network failure and standard relief time: a case study on san francisco district. Transport Res Part E Logist Transport Rev 75:145\u2013163","journal-title":"Transport Res Part E Logist Transport Rev"},{"key":"1087_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106632","volume":"147","author":"X Wei","year":"2020","unstructured":"Wei X, Qiu H, Wang D, Duan J, Wang Y, Cheng T (2020) An integrated location-routing problem with post-disaster relief distribution. Comput Ind Eng 147:106632","journal-title":"Comput Ind Eng"},{"key":"1087_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2021.107655","volume":"161","author":"Y Feng","year":"2021","unstructured":"Feng Y, Liu T, Hu Z, Wang D, Cheng T, Yin Y (2021) Casualty transport scheduling considering survival probability and injury classification. Comput Ind Eng 161:107655","journal-title":"Comput Ind Eng"},{"key":"1087_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.118740","volume":"212","author":"L Jiao","year":"2023","unstructured":"Jiao L, Peng Z, Xi L, Guo M, Ding S, Wei Y (2023) A multi-stage heuristic algorithm based on task grouping for vehicle routing problem with energy constraint in disasters. Expert Syst Appl 212:118740","journal-title":"Expert Syst Appl"},{"key":"1087_CR5","first-page":"443","volume":"17","author":"Y Sun","year":"2021","unstructured":"Sun Y, Chen X, Jun L, Zhao J, Hu Q, Fang X, Yan Y (2021) Ship trajectory cleansing and prediction with historical ais data using an ensemble ann framework. Int J Innov Comput Inf Control 17:443\u2013459","journal-title":"Int J Innov Comput Inf Control"},{"key":"1087_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.ssci.2021.105529","volume":"146","author":"S Arena","year":"2022","unstructured":"Arena S, Florian E, Zennaro I, Orr\u00f9 P, Sgarbossa F (2022) A novel decision support system for managing predictive maintenance strategies based on machine learning approaches. Saf Sci 146:105529","journal-title":"Saf Sci"},{"key":"1087_CR7","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1016\/j.jbusres.2021.09.067","volume":"139","author":"Y Feng","year":"2022","unstructured":"Feng Y, Yin Y, Wang D, Dhamotharan L (2022) A dynamic ensemble selection method for bank telemarketing sales prediction. J Bus Res 139:368\u2013382","journal-title":"J Bus Res"},{"key":"1087_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2018.10.011","volume":"103","author":"D Wang","year":"2019","unstructured":"Wang D, Zhu J, Wei X, Cheng T, Yin Y, Wang Y (2019) Integrated production and multiple trips vehicle routing with time windows and uncertain travel times. Comput Oper Res 103:1\u201312","journal-title":"Comput Oper Res"},{"issue":"1","key":"1087_CR9","first-page":"50","volume":"7","author":"MW Mufana","year":"2022","unstructured":"Mufana MW, Ibrahim A (2022) Implementation of smart grid decision support systems. IDOSR J Sci Res 7(1):50\u201357","journal-title":"IDOSR J Sci Res"},{"issue":"1","key":"1087_CR10","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.ejor.2015.10.059","volume":"251","author":"J Xiao","year":"2016","unstructured":"Xiao J, Wu Z, Hong X-X, Tang J-C, Tang Y (2016) Integration of electromagnetism with multi-objective evolutionary algorithms for rcpsp. Eur J Oper Res 251(1):22\u201335","journal-title":"Eur J Oper Res"},{"key":"1087_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106482","volume":"94","author":"AS Chaleshtarti","year":"2020","unstructured":"Chaleshtarti AS, Shadrokh S, Khakifirooz M, Fathi M, Pardalos PM (2020) A hybrid genetic and lagrangian relaxation algorithm for resource-constrained project scheduling under nonrenewable resources. Appl Soft Comput 94:106482","journal-title":"Appl Soft Comput"},{"issue":"4","key":"1087_CR12","doi-asserted-by":"publisher","first-page":"1265","DOI":"10.1080\/00207543.2018.1504245","volume":"57","author":"M Davari","year":"2019","unstructured":"Davari M, Demeulemeester E (2019) A novel branch-and-bound algorithm for the chance-constrained resource-constrained project scheduling problem. Int J Prod Res 57(4):1265\u20131282","journal-title":"Int J Prod Res"},{"issue":"2","key":"1087_CR13","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1051\/ro\/2018031","volume":"52","author":"P Fouilhoux","year":"2018","unstructured":"Fouilhoux P, Mahjoub AR, Quilliot A, Toussaint H (2018) Branch-and-cut-and-price algorithms for the preemptive rcpsp. RAIRO-Oper Res 52(2):513\u2013528","journal-title":"RAIRO-Oper Res"},{"key":"1087_CR14","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/j.cie.2019.03.044","volume":"131","author":"Z Chu","year":"2019","unstructured":"Chu Z, Xu Z, Li H (2019) New heuristics for the rcpsp with multiple overlapping modes. Comput Ind Eng 131:146\u2013156","journal-title":"Comput Ind Eng"},{"key":"1087_CR15","doi-asserted-by":"crossref","unstructured":"Kadrou Y, Najid NM (2006) A new heuristic to solve rcpsp with multiple execution modes and multi-skilled labor. In: Proceedings of the multiconference on \u201ccomputational engineering in systems applications\u201d, vol 2, pp 1302\u20131309 . IEEE","DOI":"10.1109\/CESA.2006.313517"},{"issue":"1","key":"1087_CR16","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.ejor.2010.07.021","volume":"208","author":"T Bhaskar","year":"2011","unstructured":"Bhaskar T, Pal MN, Pal AK (2011) A heuristic method for rcpsp with fuzzy activity times. Eur J Oper Res 208(1):57\u201366","journal-title":"Eur J Oper Res"},{"issue":"2","key":"1087_CR17","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s10951-007-0021-0","volume":"11","author":"O Lambrechts","year":"2008","unstructured":"Lambrechts O, Demeulemeester E, Herroelen W (2008) Proactive and reactive strategies for resource-constrained project scheduling with uncertain resource availabilities. J Sched 11(2):121\u2013136","journal-title":"J Sched"},{"key":"1087_CR18","doi-asserted-by":"crossref","unstructured":"Chen L, Zhang Z (2014) A two-stage resource-constrained project scheduling model with proactive and reactive strategies under uncertainty. In: Proceedings of the eighth international conference on management science and engineering management. Springer, pp 1397\u20131407","DOI":"10.1007\/978-3-642-55122-2_120"},{"key":"1087_CR19","doi-asserted-by":"crossref","unstructured":"Davari M, Demeulemeester E (2017) The proactive and reactive resource-constrained project scheduling problem: the crucial role of buffer-based reactions. KU Leuven, Faculty of Economics and Business, KBI_1707","DOI":"10.2139\/ssrn.2976350"},{"key":"1087_CR20","doi-asserted-by":"crossref","unstructured":"Chakrabortty RK, Abbasi A, Ryan MJ (2018) Robust project scheduling with unreliable resources: a variable neighbourhood search based heuristic approach. In: 2018 IEEE international conference on industrial engineering and engineering management (IEEM), pp 656\u2013660. IEEE","DOI":"10.1109\/IEEM.2018.8607628"},{"issue":"1","key":"1087_CR21","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.cor.2010.01.001","volume":"38","author":"F Deblaere","year":"2011","unstructured":"Deblaere F, Demeulemeester E, Herroelen W (2011) Reactive scheduling in the multi-mode rcpsp. Comput Oper Res 38(1):63\u201374","journal-title":"Comput Oper Res"},{"key":"1087_CR22","doi-asserted-by":"publisher","first-page":"30547","DOI":"10.1109\/ACCESS.2018.2828037","volume":"6","author":"M Ning","year":"2018","unstructured":"Ning M, He Z, Wang N, Liu R (2018) Metaheuristic algorithms for proactive and reactive project scheduling to minimize contractor\u2019s cash flow gap under random activity duration. IEEE Access 6:30547\u201330558","journal-title":"IEEE Access"},{"issue":"8","key":"1087_CR23","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1007\/s42107-019-00177-3","volume":"20","author":"PI Adamu","year":"2019","unstructured":"Adamu PI, Akinwumi II, Okagbue HI (2019) Reactive project scheduling: minimizing delays in the completion times of projects. Asian J Civ Eng 20(8):1189\u20131202","journal-title":"Asian J Civ Eng"},{"issue":"1\u20132","key":"1087_CR24","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s10479-018-2899-7","volume":"274","author":"M Davari","year":"2019","unstructured":"Davari M, Demeulemeester E (2019) Important classes of reactions for the proactive and reactive resource-constrained project scheduling problem. Ann Oper Res 274(1\u20132):187\u2013210","journal-title":"Ann Oper Res"},{"issue":"2","key":"1087_CR25","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s10951-017-0553-x","volume":"22","author":"M Davari","year":"2019","unstructured":"Davari M, Demeulemeester E (2019) The proactive and reactive resource-constrained project scheduling problem. J Sched 22(2):211\u2013237","journal-title":"J Sched"},{"key":"1087_CR26","first-page":"20","volume":"20","author":"W Wang","year":"2020","unstructured":"Wang W, Su J, Xu J, Ge X (2020) Reactive strategies in the multiproject scheduling with multifactor disruptions. Math Probl Eng 20:20","journal-title":"Math Probl Eng"},{"key":"1087_CR27","doi-asserted-by":"publisher","first-page":"1115126","DOI":"10.1057\/s41274-017-0198-3","volume":"69","author":"W Zheng","year":"2018","unstructured":"Zheng W, He Z, Wang N, Jia T (2018) Proactive and reactive resource-constrained max-npv project scheduling with random activity duration. J Oper Res Soc 69:1115126","journal-title":"J Oper Res Soc"},{"key":"1087_CR28","first-page":"25","volume":"11","author":"J Bagherinejad","year":"2020","unstructured":"Bagherinejad J, Jolai F, Abdollahnejad R, Shoeib M (2020) A hybrid algorithm based on non-dominated sorting ant colony and genetic algorithms for solving multi-objective multi-mode project scheduling problems under resource constraints. Manage Prod Eng Rev 11:25","journal-title":"Manage Prod Eng Rev"},{"issue":"1","key":"1087_CR29","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s10479-019-03375-z","volume":"285","author":"FT Yeganeh","year":"2020","unstructured":"Yeganeh FT, Zegordi SH (2020) A multi-objective optimization approach to project scheduling with resiliency criteria under uncertain activity duration. Ann Oper Res 285(1):161\u2013196","journal-title":"Ann Oper Res"},{"key":"1087_CR30","first-page":"557185738","volume":"52","author":"Y-Y Li","year":"2022","unstructured":"Li Y-Y, Lin J, Wang Z-J (2022) Multi-skill resource constrained project scheduling using a multi-objective discrete jaya algorithm. Appl Intell 52:557185738","journal-title":"Appl Intell"},{"key":"1087_CR31","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.107099","volume":"225","author":"L Zhu","year":"2021","unstructured":"Zhu L, Lin J, Li Y-Y, Wang Z-J (2021) A decomposition-based multi-objective genetic programming hyper-heuristic approach for the multi-skill resource constrained project scheduling problem. Knowl-Based Syst 225:107099","journal-title":"Knowl-Based Syst"},{"issue":"4","key":"1087_CR32","doi-asserted-by":"publisher","first-page":"2093","DOI":"10.1051\/ro\/2021087","volume":"55","author":"AH Hosseinian","year":"2021","unstructured":"Hosseinian AH, Baradaran V (2021) A multi-objective multi-agent optimization algorithm for the multi-skill resource-constrained project scheduling problem with transfer times. RAIRO-Oper Res 55(4):2093\u20132128","journal-title":"RAIRO-Oper Res"},{"key":"1087_CR33","doi-asserted-by":"publisher","first-page":"897","DOI":"10.1016\/j.swevo.2018.09.007","volume":"44","author":"S Chand","year":"2019","unstructured":"Chand S, Singh H, Ray T (2019) Evolving heuristics for the resource constrained project scheduling problem with dynamic resource disruptions. Swarm Evol Comput 44:897\u2013912","journal-title":"Swarm Evol Comput"},{"key":"1087_CR34","volume":"20","author":"RK Chakrabortty","year":"2020","unstructured":"Chakrabortty RK, Rahman HF, Haque KM, Paul SK, Ryan MJ (2020) An event-based reactive scheduling approach for the resource constrained project scheduling problem with unreliable resources. Comput Ind Eng 20:106981","journal-title":"Comput Ind Eng"},{"issue":"6","key":"1087_CR35","doi-asserted-by":"publisher","first-page":"169201","DOI":"10.1007\/s11432-020-2990-y","volume":"65","author":"J Cai","year":"2022","unstructured":"Cai J, Peng Z, Liao S, Ding S (2022) A multi-mode multi-skill project scheduling reformulation for reconnaissance mission planning. Sci China Inf Sci 65(6):169201","journal-title":"Sci China Inf Sci"},{"key":"1087_CR36","unstructured":"Mejia OP, Anselmet M-C, Artigues C, Lopez P (2017) A new rcpsp variant for scheduling research activities in a nuclear laboratory. In: 47th international conference on computers and industrial engineering (CIE47), p 8"},{"issue":"212","key":"1087_CR37","doi-asserted-by":"publisher","first-page":"179","DOI":"10.15446\/dyna.v87n212.81269","volume":"87","author":"NR Ortiz-Pimiento","year":"2020","unstructured":"Ortiz-Pimiento NR, Diaz-Serna FJ (2020) An optimization model to solve the resource constrained project scheduling problem rcpsp in new product development projects. Dyna 87(212):179\u2013188","journal-title":"Dyna"},{"issue":"3","key":"1087_CR38","doi-asserted-by":"publisher","first-page":"946","DOI":"10.1111\/itor.12568","volume":"26","author":"BF Almeida","year":"2019","unstructured":"Almeida BF, Correia I, Saldanha-da-Gama F (2019) Modeling frameworks for the multi-skill resource-constrained project scheduling problem: a theoretical and empirical comparison. Int Trans Oper Res 26(3):946\u2013967","journal-title":"Int Trans Oper Res"},{"key":"1087_CR39","first-page":"50","volume":"20","author":"J Shi","year":"2020","unstructured":"Shi J, Zhang Q, Sun J (2020) PPLS\/D: parallel pareto local search based on decomposition. IEEE Trans Cybern 20:50\u20133","journal-title":"IEEE Trans Cybern"},{"issue":"1","key":"1087_CR40","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1023\/A:1015059928466","volume":"1","author":"H-G Beyer","year":"2002","unstructured":"Beyer H-G, Schwefel H-P (2002) Evolution strategies\u2014a comprehensive introduction. Nat Comput 1(1):3\u201352","journal-title":"Nat Comput"},{"key":"1087_CR41","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1016\/j.ins.2019.01.002","volume":"481","author":"M Laszczyk","year":"2019","unstructured":"Laszczyk M, Myszkowski PB (2019) Improved selection in evolutionary multi-objective optimization of multi-skill resource-constrained project scheduling problem. Inf Sci 481:412\u2013431","journal-title":"Inf Sci"},{"key":"1087_CR42","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.compchemeng.2016.02.018","volume":"88","author":"H Maghsoudlou","year":"2016","unstructured":"Maghsoudlou H, Afshar-Nadjafi B, Niaki STA (2016) A multi-objective invasive weeds optimization algorithm for solving multi-skill multi-mode resource constrained project scheduling problem. Comput Chem Eng 88:157\u2013169","journal-title":"Comput Chem Eng"},{"key":"1087_CR43","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.cie.2019.07.032","volume":"136","author":"S Zabihi","year":"2019","unstructured":"Zabihi S, Kahag MR, Maghsoudlou H, Afshar-Nadjafi B (2019) Multi-objective teaching-learning-based meta-heuristic algorithms to solve multi-skilled project scheduling problem. Comput Ind Eng 136:195\u2013211","journal-title":"Comput Ind Eng"},{"key":"1087_CR44","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/j.asoc.2017.09.012","volume":"63","author":"S Ding","year":"2018","unstructured":"Ding S, Chen C, Xin B, Pardalos PM (2018) A bi-objective load balancing model in a distributed simulation system using NSGA-II and MOPSO approaches. Appl Soft Comput 63:249\u2013267","journal-title":"Appl Soft Comput"},{"key":"1087_CR45","unstructured":"Almeida B, Correia I, Saldanha-da-Gama F (2015) An instance generator for the multi-skill resource-constrained project scheduling problem. Faculdade de Ci\u00eancias da Universidade de Lisboa-Centro de Matem\u00e1tica, Aplica\u00e7\u00f5es Fundamentais e Investiga\u00e7\u00e3o Operacional"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-023-01087-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-023-01087-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-023-01087-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,27]],"date-time":"2023-10-27T19:25:17Z","timestamp":1698434717000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-023-01087-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,14]]},"references-count":45,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["1087"],"URL":"https:\/\/doi.org\/10.1007\/s40747-023-01087-3","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"type":"print","value":"2199-4536"},{"type":"electronic","value":"2198-6053"}],"subject":[],"published":{"date-parts":[[2023,6,14]]},"assertion":[{"value":"25 April 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 April 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 June 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}