{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T10:12:04Z","timestamp":1764324724919,"version":"3.46.0"},"reference-count":19,"publisher":"MDPI AG","issue":"12","license":[{"start":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T00:00:00Z","timestamp":1764201600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Science & Technology Project of China Southern Power Grid","award":["030100KC23110071"],"award-info":[{"award-number":["030100KC23110071"]}]},{"name":"Hainan Provincial Natural Science Foundation of China","award":["625QN361"],"award-info":[{"award-number":["625QN361"]}]},{"name":"Scientific Research Fund of Hunan Provincial Education Department","award":["24B0449"],"award-info":[{"award-number":["24B0449"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>To address the time\u2013cost trade-off challenge in real-world practices, a bi-objective optimization model of the Multi-mode Resource-Constrained Project Scheduling Problem is proposed with simultaneously minimizing both the project makespan and the resource cost. A mode-oriented Non-dominated Sorting Genetic Algorithm II is developed to solve the formulated problem. Two key improvements are introduced: a mode-repair mechanism is incorporated during the initialization phase to generate feasible execution modes, thereby improving the quality of initial solutions and accelerating search efficiency, and four neighborhood structures based on mode and task execution lists are designed for local search, enabling fine-grained solution refinement in each iteration. Extensive experimental studies are conducted to verify the effectiveness of the proposed strategies, and comparative evaluations with state-of-the-art algorithms demonstrate that MNSGA-II achieves superior performance across multiple metrics, including lower mean ideal distance, better solution quality, improved diversity, and more uniform distribution of Pareto-optimal solutions.<\/jats:p>","DOI":"10.3390\/a18120746","type":"journal-article","created":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T09:56:02Z","timestamp":1764323762000},"page":"746","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Bi-Objective Optimization with Mode-Oriented Genetic Algorithm for Multi-Mode Resource-Constrained Project Scheduling"],"prefix":"10.3390","volume":"18","author":[{"given":"Mingcong","family":"Xia","sequence":"first","affiliation":[{"name":"Guangzhou Power Supply Bureau, Guangdong Power Grid Co., Ltd., Guangzhou 510510, China"},{"name":"School of Electric Power Engineering, South China University of Technology, Guangzhou 510006, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guokai","family":"Liang","sequence":"additional","affiliation":[{"name":"Guangzhou Power Supply Bureau, Guangdong Power Grid Co., Ltd., Guangzhou 510510, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rui","family":"Tong","sequence":"additional","affiliation":[{"name":"Guangzhou Power Supply Bureau, Guangdong Power Grid Co., Ltd., Guangzhou 510510, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianxin","family":"Zhu","sequence":"additional","affiliation":[{"name":"Guangzhou Power Supply Bureau, Guangdong Power Grid Co., Ltd., Guangzhou 510510, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Xie","sequence":"additional","affiliation":[{"name":"Guangzhou Power Supply Bureau, Guangdong Power Grid Co., Ltd., Guangzhou 510510, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jintao","family":"Chen","sequence":"additional","affiliation":[{"name":"Guangzhou Power Supply Bureau, Guangdong Power Grid Co., Ltd., Guangzhou 510510, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0920-1522","authenticated-orcid":false,"given":"Weihua","family":"Tan","sequence":"additional","affiliation":[{"name":"School of Information and Electrical Engineering, Hunan University of Science and Technology, Xiangtan 411201, China"},{"name":"Sanya Institute of Hunan University of Science and Technology, Sanya 572024, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuting","family":"Liu","sequence":"additional","affiliation":[{"name":"College of Electrical and Information Engineering, Hunan University, Changsha 410082, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2025,11,27]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2021.05.004","article-title":"An updated survey of variants and extensions of the resource-constrained project scheduling problem","volume":"297","author":"Hartmann","year":"2022","journal-title":"Eur. J. Oper. Res."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"987","DOI":"10.1080\/07408179708966417","article-title":"Local search for nonpreemptive multi-mode resource-constrained project scheduling","volume":"29","author":"Kolisch","year":"1997","journal-title":"IIE Trans."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1016\/S0377-2217(97)00348-2","article-title":"Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm","volume":"107","author":"Sprecher","year":"1998","journal-title":"Eur. J. Oper. Res."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1016\/S0377-2217(02)00136-4","article-title":"A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags","volume":"144","author":"Heilmann","year":"2003","journal-title":"Eur. J. Oper. Res."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"107592","DOI":"10.1016\/j.cie.2021.107592","article-title":"A matheuristic approach to the multi-mode resource constrained project scheduling problem","volume":"162","author":"Fernandes","year":"2021","journal-title":"Comput. Ind. Eng."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","article-title":"Local branching","volume":"98","author":"Fischetti","year":"2003","journal-title":"Math. Program."},{"key":"ref_7","first-page":"1","article-title":"On the generalization of constraint programming and boolean satisfiability solving techniques to schedule a resource-constrained project consisting of multi-mode jobs","volume":"4","author":"Schnell","year":"2017","journal-title":"Oper. Res. Perspect."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1287\/ijoc.1040.0121","article-title":"A branch-and-cut procedure for the multimode resource-constrained project-scheduling problem","volume":"18","author":"Zhu","year":"2006","journal-title":"INFORMS J. Comput."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"614","DOI":"10.1057\/palgrave.jors.2601563","article-title":"Solving the multi-mode resource-constrained project scheduling problem with genetic algorithms","volume":"54","author":"Alcaraz","year":"2003","journal-title":"J. Oper. Res. Soc."},{"key":"ref_10","first-page":"299","article-title":"A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems","volume":"195","author":"Jarboui","year":"2008","journal-title":"Appl. Math. Comput."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.ejor.2011.03.019","article-title":"Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers","volume":"213","author":"Coelho","year":"2011","journal-title":"Eur. J. Oper. Res."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/j.compchemeng.2016.02.018","article-title":"A multi-objective invasive weeds optimization algorithm for solving multi-skill multi-mode resource constrained project scheduling problem","volume":"88","author":"Maghsoudlou","year":"2016","journal-title":"Comput. Chem. Eng."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1111\/itor.12644","article-title":"Multi-mode resource-constrained project scheduling using modified variable neighborhood search heuristic","volume":"27","author":"Chakrabortty","year":"2020","journal-title":"Int. Trans. Oper. Res."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"116134","DOI":"10.1016\/j.eswa.2021.116134","article-title":"Multi-mode project portfolio selection and scheduling in a build-operate-transfer environment","volume":"189","author":"Ranjbar","year":"2022","journal-title":"Expert Syst. Appl."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"100356","DOI":"10.1016\/j.dajour.2023.100356","article-title":"A crossover-based multi-objective discrete particle swarm optimization model for solving multi-modal routing problems","volume":"9","author":"Afrasyabi","year":"2023","journal-title":"Decis. Anal. J."},{"key":"ref_16","first-page":"32","article-title":"An Improved Parallel Biobjective Hybrid Real-Coded Genetic Algorithm with Clustering-Based Selection","volume":"24","author":"Akopov","year":"2024","journal-title":"Cybern. Inf. Technol."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"1197","DOI":"10.1287\/mnsc.28.10.1197","article-title":"Resource-constrained project scheduling with time-resource tradeoffs: The nonpreemptive case","volume":"28","author":"Talbot","year":"1982","journal-title":"Manag. Sci."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"2483","DOI":"10.1080\/00207543.2024.2403774","article-title":"Multi-mode resource-constrained project scheduling problem with multiple shifts and dynamic energy prices","volume":"63","author":"Peng","year":"2025","journal-title":"Int. J. Prod. Res."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/j.neucom.2019.12.095","article-title":"Multi-objective evolutionary framework for non-linear system identification: A comprehensive investigation","volume":"386","author":"Hafiz","year":"2020","journal-title":"Neurocomputing"}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/18\/12\/746\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T10:09:44Z","timestamp":1764324584000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/18\/12\/746"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,27]]},"references-count":19,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["a18120746"],"URL":"https:\/\/doi.org\/10.3390\/a18120746","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,27]]}}}