{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,8]],"date-time":"2026-08-08T15:23:17Z","timestamp":1786202597108,"version":"3.56.0"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,11,3]],"date-time":"2021-11-03T00:00:00Z","timestamp":1635897600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,11,3]],"date-time":"2021-11-03T00:00:00Z","timestamp":1635897600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Evol. Intel."],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s12065-021-00675-x","type":"journal-article","created":{"date-parts":[[2021,11,3]],"date-time":"2021-11-03T09:03:12Z","timestamp":1635930192000},"page":"519-537","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["A hybrid metaheuristic method for solving resource constrained project scheduling problem"],"prefix":"10.1007","volume":"16","author":[{"given":"Ohiduzzaman","family":"Shuvo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Swajan","family":"Golder","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Md. Rafiqul","family":"Islam","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,11,3]]},"reference":[{"issue":"1","key":"675_CR1","first-page":"45","volume":"2","author":"R Akbari","year":"2011","unstructured":"Akbari R, Zeighami V, Ziarati K (2011) Artificial bee colony for resource constrained project scheduling problem. Int J Ind Eng Comput 2(1):45\u201360","journal-title":"Int J Ind Eng Comput"},{"key":"675_CR2","doi-asserted-by":"crossref","unstructured":"Baar T, Brucker P, Knust S (1999) Tabu search algorithms and lower bounds for the resource-constrained project scheduling problem. Meta-Heuristics. Springer, pp 1\u201318","DOI":"10.1007\/978-1-4615-5775-3_1"},{"key":"675_CR3","doi-asserted-by":"crossref","unstructured":"Barham R, Sharieh A, Sliet A (2016) Chemical reaction optimization for max flow problem. IJACSA). Int J Adv Comput Sci Appl 7(8)","DOI":"10.14569\/IJACSA.2016.070826"},{"issue":"1","key":"675_CR4","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0166-218X(83)90012-4","volume":"5","author":"J Blazewicz","year":"1983","unstructured":"Blazewicz J, Lenstra JK, Kan AR (1983) Scheduling subject to resource constraints: classification and complexity.Discrete Appl Math 5(1):11\u201324","journal-title":"Discrete Appl Math"},{"issue":"1","key":"675_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0377-2217(90)90116-S","volume":"49","author":"FF Boctor","year":"1990","unstructured":"Boctor FF (1990) Some efficient multi-heuristic procedures for resource-constrained project scheduling. Eur J Operational Res 49(1):3\u201313","journal-title":"Eur J Operational Res"},{"issue":"8","key":"675_CR6","doi-asserted-by":"publisher","first-page":"2335","DOI":"10.1080\/00207549608905028","volume":"34","author":"FF Boctor","year":"1996","unstructured":"Boctor FF (1996) Resource-constrained project scheduling by simulated annealing.Int J Prod Res 34(8):2335\u20132351","journal-title":"Int J Prod Res"},{"issue":"2","key":"675_CR7","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1016\/S0377-2217(02)00761-0","volume":"149","author":"K Bouleimen","year":"2003","unstructured":"Bouleimen K, Lecocq H (2003) A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version. Eur J Operational Res 149(2):268\u2013281","journal-title":"Eur J Operational Res"},{"issue":"1","key":"675_CR8","first-page":"34","volume":"16","author":"GH Brooks","year":"1969","unstructured":"Brooks GH (1969) An algorithm for finding optimal or near optimal solutions to the production scheduling problem. J Indl Eng 16(1):34\u201340","journal-title":"J Indl Eng"},{"issue":"2","key":"675_CR9","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1016\/0377-2217(95)00358-4","volume":"90","author":"EL Demeulemeester","year":"1996","unstructured":"Demeulemeester EL, Herroelen WS (1996) An efficient optimal solution procedure for the preemptive resource-constrained project scheduling problem. Eur J Operational Res 90(2):334\u2013348","journal-title":"Eur J Operational Res"},{"issue":"5","key":"675_CR10","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1080\/07408179308964317","volume":"25","author":"A Drexl","year":"1993","unstructured":"Drexl A, Gruenewald J (1993) Nonpreemptive multi-mode resource-constrained project scheduling. IIE Trans 25(5):74\u201381","journal-title":"IIE Trans"},{"key":"675_CR11","first-page":"292","volume":"274","author":"H Garg","year":"2016","unstructured":"Garg H (2016) A hybrid pso-ga algorithm for constrained optimization problems. Appl Math Comput 274:292\u2013305","journal-title":"Appl Math Comput"},{"key":"675_CR12","unstructured":"Herbots J, Herroelen W, Leus R (2004) Experimental investigation of the applicability of ant colony optimization algorithms for project scheduling"},{"key":"675_CR13","doi-asserted-by":"crossref","unstructured":"Islam MR, Arif IH, Shuvo RH (2019) Generalized vertex cover using chemical reaction optimization. Appl Intell 1\u201321","DOI":"10.1007\/s10489-018-1391-z"},{"key":"675_CR14","doi-asserted-by":"crossref","unstructured":"Islam MR, Saifullah CK, Asha ZT, Ahamed R (2018) Chemical reaction optimization for solving longest common subsequence problem for multiple string. Soft Comput 1\u201325","DOI":"10.1007\/s00500-018-3200-3"},{"issue":"1","key":"675_CR15","first-page":"299","volume":"195","author":"B Jarboui","year":"2008","unstructured":"Jarboui B, Damak N, Siarry P, Rebai A (2008) A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems. Appl Math Comput 195(1):299\u2013308","journal-title":"Appl Math Comput"},{"issue":"8","key":"675_CR16","doi-asserted-by":"publisher","first-page":"2037","DOI":"10.1016\/j.cor.2013.02.012","volume":"40","author":"Q Jia","year":"2013","unstructured":"Jia Q, Seo Y (2013) Solving resource-constrained project scheduling problems: conceptual validation of flp formulation and efficient permutation-based abc computation. Comput Operations Res 40(8):2037\u20132050","journal-title":"Comput Operations Res"},{"key":"675_CR17","unstructured":"Kabir R, Islam R (2018) Chemical reaction optimization for rna structure prediction. Appl Intell 1\u201324"},{"key":"675_CR18","unstructured":"Kelley JE (1963) The critical-path method: resource planning and scheduling. Ind Scheduling"},{"issue":"1","key":"675_CR19","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0377-2217(96)00170-1","volume":"96","author":"R Kolisch","year":"1997","unstructured":"Kolisch R, Sprecher A (1997) Psplib-a project scheduling problem library: Or software-orsep operations research software exchange program. Eur J Operational Res 96(1):205\u2013216","journal-title":"Eur J Operational Res"},{"issue":"4","key":"675_CR20","doi-asserted-by":"publisher","first-page":"1565","DOI":"10.1007\/s00500-015-1606-8","volume":"20","author":"N Kumar","year":"2016","unstructured":"Kumar N, Vidyarthi DP (2016) A model for resource-constrained project scheduling using adaptive pso. Soft Comput 20(4):1565\u20131580","journal-title":"Soft Comput"},{"issue":"3","key":"675_CR21","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1109\/TEVC.2009.2033580","volume":"14","author":"AY Lam","year":"2010","unstructured":"Lam AY, Li VO (2010) Chemical-reaction-inspired metaheuristic for optimization. IEEE Trans Evolutionary Comput 14(3):381\u2013399","journal-title":"IEEE Trans Evolutionary Comput"},{"key":"675_CR22","doi-asserted-by":"crossref","unstructured":"Mahmud MR, Pritom RM, Islam MR (2017) Optimization of collaborative transportation scheduling in supply chain management with tpl using chemical reaction optimization. In Computer and Information Technology (ICCIT), 2017 20th International Conference of, pages 1\u20136. IEEE","DOI":"10.1109\/ICCITECHN.2017.8281767"},{"issue":"4","key":"675_CR23","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1109\/TEVC.2002.802450","volume":"6","author":"D Merkle","year":"2002","unstructured":"Merkle D, Middendorf M, Schmeck H (2002) Ant colony optimization for resource-constrained project scheduling. IEEE Trans Evolutionary Comput 6(4):333\u2013346","journal-title":"IEEE Trans Evolutionary Comput"},{"issue":"6","key":"675_CR24","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1016\/j.ijproman.2009.10.003","volume":"28","author":"JR Montoya-Torres","year":"2010","unstructured":"Montoya-Torres JR, Gutierrez-Franco E, Pirachic\u00e1n-Mayorga C (2010) Project scheduling with limited resources using a genetic algorithm. Int J Project Managt 28(6):619\u2013628","journal-title":"Int J Project Manag"},{"key":"675_CR25","doi-asserted-by":"crossref","unstructured":"Nonobe K, Ibaraki T (2002) Formulation and tabu search algorithm for the resource constrained project scheduling problem. Essays and surveys in metaheuristics. Springer, pp 557\u2013588","DOI":"10.1007\/978-1-4615-1507-4_25"},{"key":"675_CR26","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.compbiolchem.2016.05.004","volume":"64","author":"CK Saifullah","year":"2016","unstructured":"Saifullah CK, Islam MR (2016) Chemical reaction optimization for solving shortest common supersequence problem. Comput Biolo Chem 64:82\u201393","journal-title":"Comput Biolo Chem"},{"issue":"4","key":"675_CR27","doi-asserted-by":"publisher","first-page":"1774","DOI":"10.1016\/j.asoc.2012.11.048","volume":"13","author":"TK Truong","year":"2013","unstructured":"Truong TK, Li K, Xu Y (2013) Chemical reaction optimization with greedy strategy for the 0\u20131 knapsack problem. Appl Soft Comput 13(4):1774\u20131780","journal-title":"Appl Soft Comput"},{"key":"675_CR28","doi-asserted-by":"crossref","unstructured":"Xu J, Lam AY, Li VO (2010) Parallel chemical reaction optimization for the quadratic assignment problem. In World Congress in Computer Science, Comput Eng Appl Comput, Worldcomp 2010","DOI":"10.1109\/ICC.2010.5502406"},{"issue":"10","key":"675_CR29","doi-asserted-by":"publisher","first-page":"1624","DOI":"10.1109\/TPDS.2011.35","volume":"22","author":"J Xu","year":"2011","unstructured":"Xu J, Lam AY, Li VO (2011) Chemical reaction optimization for task scheduling in grid computing. IEEE Trans Parallel Distributed Syst 22(10):1624\u20131631","journal-title":"IEEE Trans Parallel Distributed Syst"},{"issue":"1","key":"675_CR30","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.ijproman.2005.06.006","volume":"24","author":"H Zhang","year":"2006","unstructured":"Zhang H, Li H, Tam C (2006) Particle swarm optimization for resource-constrained project scheduling. Int J Project Managt 24(1):83\u201392","journal-title":"Int J Project Manag"},{"issue":"3","key":"675_CR31","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/j.autcon.2004.08.006","volume":"14","author":"H Zhang","year":"2005","unstructured":"Zhang H, Li X, Li H, Huang F (2005) Particle swarm optimization-based schemes for resource-constrained project scheduling. Automation in Construc 14(3):393\u2013404","journal-title":"Automation in Construc"},{"issue":"15","key":"675_CR32","doi-asserted-by":"publisher","first-page":"6039","DOI":"10.1016\/j.eswa.2015.04.009","volume":"42","author":"X-L Zheng","year":"2015","unstructured":"Zheng X-L, Wang L (2015) A multi-agent optimization algorithm for resource constrained project scheduling problem. Exp Syst Appl 42(15):6039\u20136049","journal-title":"Exp Syst Appl"}],"container-title":["Evolutionary Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-021-00675-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12065-021-00675-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12065-021-00675-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,23]],"date-time":"2023-03-23T03:39:42Z","timestamp":1679542782000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12065-021-00675-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,3]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["675"],"URL":"https:\/\/doi.org\/10.1007\/s12065-021-00675-x","relation":{},"ISSN":["1864-5909","1864-5917"],"issn-type":[{"value":"1864-5909","type":"print"},{"value":"1864-5917","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,11,3]]},"assertion":[{"value":"14 July 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 August 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 October 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 November 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}