{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T14:52:33Z","timestamp":1779893553671,"version":"3.53.1"},"reference-count":19,"publisher":"European Society of Computational Methods in Sciences and Engineering","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JCM"],"published-print":{"date-parts":[[2022,5,13]]},"abstract":"<jats:p>In this paper, we studied the resource constrained project scheduling problem, and the research object is extended to the multi-project environment. On the basis of multi-project priority evaluation, with the goal of minimizing the weighted duration of multi-project, a multi-project schedule planning model is constructed. Through reasonable scheduling of multiple parallel projects sharing resources under resource constraints, it provides a decision-making basis for project managers to allocate resources reasonably under resource constraints to meet the duration requirements of each project and to shorten the weighted total duration of multiple projects as much as possible. A two-stage hybrid differential evolution particle swarm optimization algorithm is used to solve the model. In the first stage, differential evolution algorithm is used to produce new individuals, and in the second stage, particle swarm optimization algorithm uses a new speed update formula. In the first stage, in order to ensure that the optimal individual will not be destroyed by crossover and mutation, and to maintain the convergence of differential evolution algorithm, we try to introduce Elitist Retention (ER) strategy into differential evolution algorithm. In the second stage, we use a kind of particle swarm optimization algorithm with dynamically changing inertia weight. Through the dynamic changing inertia weight, the global search and local search ability of the algorithm can be adjusted flexibly. The case verification shows that the hybrid differential evolution particle swarm optimization algorithm can be used to solve the RCMPSP model more effectively.<\/jats:p>","DOI":"10.3233\/jcm-225981","type":"journal-article","created":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T13:27:36Z","timestamp":1646141256000},"page":"957-969","source":"Crossref","is-referenced-by-count":1,"title":["Hybrid differential evolution particle swarm optimization (DEA-DCWPSO) for resource-constrained multi-project scheduling problem"],"prefix":"10.66113","volume":"22","author":[{"given":"Haixin","family":"Wang","sequence":"first","affiliation":[{"name":"College of Civil Engineering and Architecture, Shandong University of Science and Technology, Qingdao, Shandong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xin","family":"Chen","sequence":"additional","affiliation":[{"name":"College of Civil Engineering and Architecture, Shandong University of Science and Technology, Qingdao, Shandong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shengsong","family":"Wei","sequence":"additional","affiliation":[{"name":"College of Civil Engineering and Architecture, Shandong University of Science and Technology, Qingdao, Shandong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yanjie","family":"Wang","sequence":"additional","affiliation":[{"name":"State Grid Shandong Electric Power Company Qingzhou Power Supply Company, Weifang, Shandong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"55691","reference":[{"issue":"1","key":"10.3233\/JCM-225981_ref1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0377-2217(98)00204-5","article-title":"Resource-constrained project scheduling: Notation, classification, models, and methods","volume":"112","author":"Brucker","year":"1999","journal-title":"Eur J Oper Res."},{"issue":"2","key":"10.3233\/JCM-225981_ref2","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1080\/00207548908942546","article-title":"Multiple projects multiple resources-constrained scheduling: Some studies","volume":"27","author":"Mohanthy","year":"1989","journal-title":"Int J Prod Res."},{"issue":"1","key":"10.3233\/JCM-225981_ref3","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/0377-2217(91)90150-T","article-title":"A decomposition approach to multi-project scheduling","volume":"51","author":"Deckro","year":"1991","journal-title":"Eur J Oper Res."},{"issue":"2","key":"10.3233\/JCM-225981_ref4","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0377-2217(94)90389-1","article-title":"Constrained multi-project planning problems: A Lagrangean decomposition approach","volume":"78","author":"Vercellis","year":"1994","journal-title":"Eur J Oper Res."},{"issue":"2","key":"10.3233\/JCM-225981_ref5","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1287\/mnsc.28.2.161","article-title":"Multi-project scheduling: Categorization of heuristic rules performance","volume":"28","author":"Kurtulus","year":"1982","journal-title":"Manage Sci."},{"issue":"3","key":"10.3233\/JCM-225981_ref7","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1016\/j.ejor.2006.06.074","article-title":"A genetic algorithm for the resource constrained multi-project scheduling problem","volume":"189","author":"Goncalves","year":"2008","journal-title":"Eur J Oper Res."},{"issue":"2","key":"10.3233\/JCM-225981_ref8","first-page":"4178","article-title":"Resource constrained multi-project scheduling problem based on back scheduling and genetic algorithm","volume":"32","author":"Liang","year":"2011","journal-title":"Comput Eng Des."},{"issue":"4","key":"10.3233\/JCM-225981_ref9","first-page":"220","article-title":"Adaptive particle swarm optimization algorithm for resource constrained multi-project scheduling problem","volume":"31","author":"Wang","year":"2017","journal-title":"J Ind Eng Eng Manage."},{"issue":"1","key":"10.3233\/JCM-225981_ref10","doi-asserted-by":"crossref","first-page":"321","DOI":"10.21042\/AMNS.2018.1.00025","article-title":"Walk polynomial: A new graph invariant","volume":"3","author":"Nizami","year":"2018","journal-title":"Appl Math Nonlinear Sci."},{"issue":"4","key":"10.3233\/JCM-225981_ref11","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1023\/A:1008202821328","article-title":"Differential evolution-a simple and efficient heuristic for global optimization over continuous spaces","volume":"11","author":"Stom","year":"1997","journal-title":"J Global Optim."},{"issue":"7","key":"10.3233\/JCM-225981_ref12","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1007\/s00500-006-0124-0","article-title":"Performance comparison of self-adaptive and adaptive differential evolution algorithms","volume":"11","author":"Brest","year":"2007","journal-title":"Soft Comput."},{"issue":"3","key":"10.3233\/JCM-225981_ref13","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1109\/TEVC.2008.2009457","article-title":"Differential evolution using a neighborhood-based mutation operator","volume":"13","author":"Das","year":"2009","journal-title":"IEEE Trans Evol Comput."},{"issue":"2","key":"10.3233\/JCM-225981_ref14","doi-asserted-by":"crossref","first-page":"543","DOI":"10.2478\/AMNS.2019.2.00051","article-title":"Note on Jakimovski-Leviatan operators preserving E-X","volume":"4","author":"Acar","year":"2019","journal-title":"Appl Math Nonlinear Sci."},{"key":"10.3233\/JCM-225981_ref19","doi-asserted-by":"crossref","unstructured":"Clerc M. The swarm and the queen: Towards a deterministic and adaptive particle swarm optimization. Proc Congr Evol Comput. 1999; 3: 1951-1957.","DOI":"10.1109\/CEC.1999.785513"},{"issue":"17","key":"10.3233\/JCM-225981_ref21","first-page":"14","article-title":"Particle swarm optimization algorithm based on inertia weight logarithmic decreasing","volume":"51","author":"Dai","year":"2015","journal-title":"Comput Eng Appl."},{"issue":"2","key":"10.3233\/JCM-225981_ref22","first-page":"227","article-title":"New adaptive particle swarm optimization algorithm with dynamically changing inertia weight","volume":"51","author":"Ren","year":"2009","journal-title":"Comput Sci."},{"issue":"3","key":"10.3233\/JCM-225981_ref23","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1287\/opre.9.3.296","article-title":"Critical-path planning and scheduling: Mathematical basis","volume":"9","author":"Kelly","year":"1961","journal-title":"Oper Res."},{"issue":"2","key":"10.3233\/JCM-225981_ref24","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1016\/0377-2217(95)00357-6","article-title":"Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation","volume":"90","author":"Kolisch","year":"1996","journal-title":"Eur J Oper Res."},{"issue":"2","key":"10.3233\/JCM-225981_ref25","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/S0377-2217(99)00163-0","article-title":"Using metaheuristics in multi-objective resource constrained project scheduling","volume":"120","author":"Viana","year":"2000","journal-title":"Eur J Oper Res."}],"container-title":["Journal of Computational Methods in Sciences and Engineering"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/JCM-225981","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T22:06:49Z","timestamp":1776809209000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/JCM-225981"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,13]]},"references-count":19,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.3233\/jcm-225981","relation":{},"ISSN":["1472-7978","1875-8983"],"issn-type":[{"value":"1472-7978","type":"print"},{"value":"1875-8983","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,13]]}}}