{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T02:03:18Z","timestamp":1776132198009,"version":"3.50.1"},"reference-count":66,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,12,17]],"date-time":"2022-12-17T00:00:00Z","timestamp":1671235200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,17]],"date-time":"2022-12-17T00:00:00Z","timestamp":1671235200000},"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":["SN COMPUT. SCI."],"DOI":"10.1007\/s42979-022-01487-1","type":"journal-article","created":{"date-parts":[[2022,12,17]],"date-time":"2022-12-17T12:43:28Z","timestamp":1671281008000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A Forward\u2013Backward Relax-and-Solve Algorithm for the Resource-Constrained Project Scheduling Problem"],"prefix":"10.1007","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9780-8262","authenticated-orcid":false,"given":"Alireza","family":"Etminaniesfahani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanyu","family":"Gu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leila Moslemi","family":"Naeni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amir","family":"Salehipour","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,17]]},"reference":[{"issue":"1","key":"1487_CR1","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1057\/palgrave.jors.2601813","volume":"56","author":"W Herroelen","year":"2005","unstructured":"Herroelen W, Leus R. Identification and illumination of popular misconceptions about project scheduling and time buffering in a resource-constrained environment. J Oper Res Soc. 2005;56(1):102\u20139.","journal-title":"J Oper Res Soc."},{"key":"1487_CR2","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1287\/mnsc.16.1.93","volume":"16","author":"A Pritsker","year":"1969","unstructured":"Pritsker A, Waiters LJ, Wolfe P. Multiproject scheduling with limited resources: a zero-one programming approach. Manag Sci. 1969;16:93\u2013108.","journal-title":"Manag Sci."},{"key":"1487_CR3","doi-asserted-by":"publisher","unstructured":"Liu J, Lu M. Optimization on Supply-constrained Module Assembly Process. In: IGLC 2017 - Proceedings of the 25th Annual Conference of the International Group for Lean Construction, 2017; 813\u2013820. https:\/\/doi.org\/10.24928\/2017\/0104. cited By 2","DOI":"10.24928\/2017\/0104"},{"key":"1487_CR4","doi-asserted-by":"publisher","unstructured":"Alford C, Brazil M, Lee DH. Optimisation in Underground Mining, pp. 561\u2013577. Springer, Boston, MA (2007). https:\/\/doi.org\/10.1007\/978-0-387-71815-6_30.","DOI":"10.1007\/978-0-387-71815-6_30"},{"issue":"12","key":"1487_CR5","doi-asserted-by":"publisher","first-page":"1803","DOI":"10.1287\/mnsc.38.12.1803","volume":"38","author":"E Demeulemeester","year":"1992","unstructured":"Demeulemeester E, Herroelen W. A branch-and-bound procedure for the multiple resource-constrained project scheduling problem. Manag Sci. 1992;38(12):1803\u201318.","journal-title":"Manag Sci"},{"issue":"1","key":"1487_CR6","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 AHGR. Scheduling subject to resource constraints: classification and complexity. Discrete Appl Math. 1983;5(1):11\u201324. https:\/\/doi.org\/10.1016\/0166-218X(83)90012-4.","journal-title":"Discrete Appl Math."},{"key":"1487_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.autcon.2019.103052","volume":"111","author":"HF Rahman","year":"2020","unstructured":"Rahman HF, Chakrabortty RK, Ryan MJ. Memetic algorithm for solving resource constrained project scheduling problems. Auto Construction. 2020;111: 103052. https:\/\/doi.org\/10.1016\/j.autcon.2019.103052.","journal-title":"Auto Construction."},{"issue":"4","key":"1487_CR8","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/S0305-0548(97)00055-5","volume":"25","author":"W Herroelen","year":"1998","unstructured":"Herroelen W, De Reyck B, Demeulemeester E. Resource-constrained project scheduling: a survey of recent developments. Comput Oper Res. 1998;25(4):279\u2013302. https:\/\/doi.org\/10.1016\/S0305-0548(97)00055-5.","journal-title":"Comput Oper Res."},{"key":"1487_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.114174","volume":"167","author":"H Chen","year":"2021","unstructured":"Chen H, Ding G, Qin S, Zhang J. A hyper-heuristic based ensemble genetic programming approach for stochastic resource constrained project scheduling problem. Expert Syst Appl. 2021;167: 114174. https:\/\/doi.org\/10.1016\/j.eswa.2020.114174.","journal-title":"Expert Syst Appl."},{"issue":"1","key":"1487_CR10","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.ejor.2005.01.065","volume":"174","author":"R Kolisch","year":"2006","unstructured":"Kolisch R, Hartmann S. Experimental investigation of heuristics for resource-constrained project scheduling: an update. Euro J Oper Res. 2006;174(1):23\u201337. https:\/\/doi.org\/10.1016\/j.ejor.2005.01.065.","journal-title":"Euro J Oper Res."},{"issue":"3","key":"1487_CR11","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1016\/0377-2217(92)90320-9","volume":"56","author":"KY Li","year":"1992","unstructured":"Li KY, Willis RJ. An iterative scheduling technique for resource-constrained project scheduling. European Journal of Operational Research. 1992;56(3):370\u20139. https:\/\/doi.org\/10.1016\/0377-2217(92)90320-9.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"1487_CR12","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.ejor.2019.01.063","volume":"280","author":"R Pellerin","year":"2020","unstructured":"Pellerin R, Perrier N, Berthaut F. A survey of hybrid metaheuristics for the resource-constrained project scheduling problem. Euro J Oper Res. 2020;280(2):395\u2013416. https:\/\/doi.org\/10.1016\/j.ejor.2019.01.063.","journal-title":"Euro J Oper Res."},{"key":"1487_CR13","doi-asserted-by":"crossref","unstructured":"Holland JH. Genetic algorithms. Scientific American (1992)","DOI":"10.1038\/scientificamerican0792-66"},{"key":"1487_CR14","doi-asserted-by":"publisher","unstructured":"Agarwal A, Colak S, Erenguc S. A neurogenetic approach for the resource-constrained project scheduling problem. Computers & Operations Research 2011;38(1), 44\u201350. https:\/\/doi.org\/10.1016\/j.cor.2010.01.007. Project Management and Scheduling","DOI":"10.1016\/j.cor.2010.01.007"},{"key":"1487_CR15","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1287\/opre.1060.0358","volume":"55","author":"D Debels","year":"2007","unstructured":"Debels D, Vanhoucke M. A decomposition-based genetic algorithm for the resource-constrained project-scheduling problem. Oper Res. 2007;55:457\u201369. https:\/\/doi.org\/10.1287\/opre.1060.0358.","journal-title":"Oper Res."},{"key":"1487_CR16","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/s10696-011-9133-0","volume":"25","author":"A Lim","year":"2011","unstructured":"Lim A, Ma H, Rodrigues B, Tan S, Xiao F. New meta-heuristics for the resource-constrained project scheduling problem. Flexible Services Manuf J. 2011;25:48\u201373. https:\/\/doi.org\/10.1007\/s10696-011-9133-0.","journal-title":"Flexible Services Manuf J."},{"key":"1487_CR17","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1007\/978-3-540-69052-8_64","volume-title":"New frontiers in applied artificial intelligence","author":"M Cervantes","year":"2008","unstructured":"Cervantes M, Lova A, Tormos P, Barber F. A dynamic population steady-state genetic algorithm for the resource-constrained project scheduling problem. In: Nguyen NT, Borzemski L, Grzech A, Ali M, editors. New frontiers in applied artificial intelligence. Berlin, Heidelberg: Springer; 2008. p. 611\u201320."},{"key":"1487_CR18","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1504\/IJPS.2012.050125","volume":"1","author":"I Ismail","year":"2012","unstructured":"Ismail I, Barghash M. Diversity guided genetic algorithm to solve the resource constrained project scheduling problem. Int J Plann Scheduling. 2012;1:147\u201370. https:\/\/doi.org\/10.1504\/IJPS.2012.050125.","journal-title":"Int J Plann Scheduling"},{"key":"1487_CR19","unstructured":"Alcaraz J, Maroto C, Ruiz R. Improving the performance of genetic algorithms for the rcps problem. Proceedings of the Ninth International Workshop on Project Management and Scheduling, 2004;40\u201343. Cited By :39"},{"issue":"5","key":"1487_CR20","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/s12209-010-1495-y","volume":"16","author":"H Wang","year":"2010","unstructured":"Wang H, Li T, Lin D. Efficient genetic algorithm for resource-constrained project scheduling problem. Trans Tianjin Univ. 2010;16(5):376\u201382. https:\/\/doi.org\/10.1007\/s12209-010-1495-y.","journal-title":"Trans Tianjin Univ."},{"issue":"2","key":"1487_CR21","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1016\/j.ejor.2013.03.005","volume":"229","author":"R Zamani","year":"2013","unstructured":"Zamani R. A competitive magnet-based genetic algorithm for solving the resource-constrained project scheduling problem. Euro J Oper Res. 2013;229(2):552\u20139. https:\/\/doi.org\/10.1016\/j.ejor.2013.03.005.","journal-title":"Euro J Oper Res."},{"key":"1487_CR22","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1016\/j.ejor.2006.12.033","volume":"185","author":"V Valls","year":"2008","unstructured":"Valls V, Ballest\u00edn F, Quintanilla S. A hybrid genetic algorithm for the resource-constrained project scheduling problem. Euro J Oper Res. 2008;185:495\u2013508. https:\/\/doi.org\/10.1016\/j.ejor.2006.12.033.","journal-title":"Euro J Oper Res."},{"key":"1487_CR23","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/11424925_41","volume-title":"Computational science and its applications\u2014ICCSA 2005","author":"D Debels","year":"2005","unstructured":"Debels D, Vanhoucke M. A bi-population based genetic algorithm for the resource-constrained project scheduling problem. In: Gervasi O, Gavrilova ML, Kumar V, Lagan\u00e1 A, Lee HP, Mun Y, Taniar D, Tan CJK, editors. Computational science and its applications\u2014ICCSA 2005. Berlin, Heidelberg: Springer; 2005. p. 378\u201387."},{"key":"1487_CR24","doi-asserted-by":"publisher","unstructured":"Fernando GJ, C RMG, M MJJ. A biased random-key genetic algorithm with forward-backward improvement for the resource constrained project scheduling problem. J Heuristics 2011;17(5), 467\u2013486. https:\/\/doi.org\/10.1007\/s10732-010-9142-2","DOI":"10.1007\/s10732-010-9142-2"},{"key":"1487_CR25","doi-asserted-by":"publisher","unstructured":"Chand S, Singh HK, Ray T. A heuristic algorithm for solving resource constrained project scheduling problems. In: 2017 IEEE Congress on Evolutionary Computation (CEC), 2017; 225\u2013232. https:\/\/doi.org\/10.1109\/CEC.2017.7969317","DOI":"10.1109\/CEC.2017.7969317"},{"issue":"1","key":"1487_CR26","doi-asserted-by":"publisher","first-page":"67","DOI":"10.3969\/j.issn.1004-4132.2010.01.012","volume":"21","author":"L Deng","year":"2010","unstructured":"Deng L, Lin V, Chen M. Hybrid ant colony optimization for the resource-constrained project scheduling problem. J Syst Eng Electron. 2010;21(1):67\u201371. https:\/\/doi.org\/10.3969\/j.issn.1004-4132.2010.01.012.","journal-title":"J Syst Eng Electron"},{"key":"1487_CR27","doi-asserted-by":"publisher","unstructured":"Dorigo M, Di\u00a0Caro G, Gambardella LM. Ant algorithms for discrete optimization.\u201d artificial life 5, 137-172. Artificial Life 5, 1999;137\u2013172. https:\/\/doi.org\/10.1162\/106454699568728","DOI":"10.1162\/106454699568728"},{"issue":"4","key":"1487_CR28","doi-asserted-by":"publisher","first-page":"3720","DOI":"10.1016\/j.asoc.2011.02.002","volume":"11","author":"K Ziarati","year":"2011","unstructured":"Ziarati K, Akbari R, Zeighami V. On the performance of bee algorithms for resource-constrained project scheduling problem. Appl Soft Comput. 2011;11(4):3720\u201333. https:\/\/doi.org\/10.1016\/j.asoc.2011.02.002.","journal-title":"Appl Soft Comput."},{"key":"1487_CR29","unstructured":"Pham D, Ghanbarzadeh A, Ko\u00e7 E, Otri S, Rahim S, Zaidi M. The bees algorithm technical note. Manufacturing Engineering Centre, Cardiff University, UK, 2005;1\u201357"},{"key":"1487_CR30","unstructured":"Karaboga D. An idea based on honey bee swarm for numerical optimization, technical report - tr06. Technical Report, Erciyes University (2005)"},{"key":"1487_CR31","doi-asserted-by":"publisher","unstructured":"A novel bee swarm optimization algorithm for numerical function optimization. Communications in Nonlinear Science and Numerical Simulation 15(10), 2010; 3142\u20133155. https:\/\/doi.org\/10.1016\/j.cnsns.2009.11.003","DOI":"10.1016\/j.cnsns.2009.11.003"},{"issue":"1","key":"1487_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1504\/IJPOM.2018.090372","volume":"10","author":"F Berthaut","year":"2018","unstructured":"Berthaut F, Pellerin R, Hajji A, Perrier N. A path relinking-based scatter search for the resource-constrained project scheduling problem. Int J Project Organisation Manag. 2018;10(1):1\u201336. https:\/\/doi.org\/10.1504\/IJPOM.2018.090372.","journal-title":"Int J Project Organisation Manag"},{"key":"1487_CR33","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/978-3-642-38171-3_24","volume-title":"Integration of AI and OR techniques in constraint programming for combinatorial optimization problems","author":"H Gu","year":"2013","unstructured":"Gu H, Schutt A, Stuckey PJ. A lagrangian relaxation based forward-backward improvement heuristic for maximising the net present value of resource-constrained projects. In: Gomes C, Sellmann M, editors. Integration of AI and OR techniques in constraint programming for combinatorial optimization problems. Berlin, Heidelberg: Springer; 2013. p. 340\u20136."},{"key":"1487_CR34","doi-asserted-by":"crossref","unstructured":"Laborie P. An Update on the Comparison of MIP, CP and Hybrid Approaches for Mixed Resource Allocation and Scheduling, pp. 403\u2013411. Springer, Cham (2018)","DOI":"10.1007\/978-3-319-93031-2_29"},{"key":"1487_CR35","doi-asserted-by":"publisher","unstructured":"Maleck C, Nieke G, Bock K, Pabst D, Stehli M. A comparison of an cp and mip approach for scheduling jobs in production areas with time constraints and uncertainties. In: 2018 Winter Simulation Conference (WSC), 2018;3526\u20133537. https:\/\/doi.org\/10.1109\/WSC.2018.8632404","DOI":"10.1109\/WSC.2018.8632404"},{"key":"1487_CR36","doi-asserted-by":"crossref","unstructured":"Kelareva E, Brand S, Kilby P, Thiebaux S, Wallace M. Cp and mip methods for ship scheduling with time-varying draft. ICAPS 2012 - Proceedings of the 22nd International Conference on Automated Planning and Scheduling 2012","DOI":"10.1609\/icaps.v22i1.13494"},{"issue":"1","key":"1487_CR37","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10479-007-0188-y","volume":"157","author":"O Liess","year":"2008","unstructured":"Liess O, Michelon P. A constraint programming approach for the resource-constrained project scheduling problem. Ann Oper Res. 2008;157(1):25\u201336.","journal-title":"Ann Oper Res."},{"key":"1487_CR38","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/s10601-010-9103-2","volume":"16","author":"A Schutt","year":"2011","unstructured":"Schutt A, Feydy T, Stuckey P, Wallace M. Explaining the cumulative propagator. Constraints. 2011;16:250\u201382. https:\/\/doi.org\/10.1007\/s10601-010-9103-2.","journal-title":"Constraints"},{"key":"1487_CR39","doi-asserted-by":"publisher","unstructured":"Schutt A, Feydy T, Stuckey PJ, Wallace MG. A Satisfiability Solving Approach, 2015;135\u2013160. Springer, Cham . https:\/\/doi.org\/10.1007\/978-3-319-05443-8_7.","DOI":"10.1007\/978-3-319-05443-8_7"},{"key":"1487_CR40","doi-asserted-by":"publisher","unstructured":"Kreter S, Schutt A, Stuckey P. Using constraint programming for solving rcpsp\/max-cal. Constraints 22 2017. https:\/\/doi.org\/10.1007\/s10601-016-9266-6","DOI":"10.1007\/s10601-016-9266-6"},{"issue":"2","key":"1487_CR41","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/j.ejor.2019.06.010","volume":"279","author":"N Absi","year":"2019","unstructured":"Absi N, van den Heuvel W. Worst case analysis of relax and fix heuristics for lot-sizing problems. Euro J Oper Res. 2019;279(2):449\u201358. https:\/\/doi.org\/10.1016\/j.ejor.2019.06.010.","journal-title":"Euro J Oper Res."},{"issue":"2","key":"1487_CR42","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/j.ijpe.2009.08.022","volume":"123","author":"S Helber","year":"2010","unstructured":"Helber S, Sahling F. A fix-and-optimize approach for the multi-level capacitated lot sizing problem. Int J Prod Econ. 2010;123(2):247\u201356.","journal-title":"Int J Prod Econ."},{"key":"1487_CR43","doi-asserted-by":"publisher","unstructured":"Escudero LF, Romero CP. On solving a large-scale problem on facility location and customer assignment with interaction costs along a time horizon. TOP: An Official Journal of the Spanish Society of Statistics and Operations Research 25(3), 2017;01\u2013622. https:\/\/doi.org\/10.1007\/s11750-017-0461-4","DOI":"10.1007\/s11750-017-0461-4"},{"key":"1487_CR44","unstructured":"Salehipour A. A heuristic algorithm for the aircraft landing problem. In: 22nd International Congress on Modelling and Simulation (2017). Modelling and Simulation Society of Australia and New Zealand Inc.(MSSANZ)"},{"key":"1487_CR45","unstructured":"Salehipour A, Ahmadian M, Oron D. Efficient and simple heuristics for the aircraft landing problem. In: Matheuristic 2018 International Conference (2018)"},{"key":"1487_CR46","doi-asserted-by":"crossref","unstructured":"Ahmadian MM, Salehipour A, Kovalyov M. An efficient relax-and-solve heuristic for open-shop scheduling problem to minimize total weighted earliness-tardiness. Available at SSRN 3601396 (2020)","DOI":"10.2139\/ssrn.3601396"},{"issue":"1","key":"1487_CR47","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.ejor.2020.04.017","volume":"288","author":"MM Ahmadian","year":"2021","unstructured":"Ahmadian MM, Salehipour A, Cheng TCE. A meta-heuristic to solve the just-in-time job-shop scheduling problem. Euro J Oper Res. 2021;288(1):14\u201329.","journal-title":"Euro J Oper Res."},{"key":"1487_CR48","doi-asserted-by":"publisher","unstructured":"Etminaniesfahani, A, Gu, H, Salehipour, A. An Efficient Relax-and-Solve Algorithm for the Resource-Constrained Project Scheduling Problem. In: Proceedings of the 11th International Conference on Operations Research and Enterprise Systems - ICORES,, pp. 271\u2013277. SciTePress. https:\/\/doi.org\/10.5220\/0010772400003117. INSTICC","DOI":"10.5220\/0010772400003117"},{"key":"1487_CR49","doi-asserted-by":"publisher","unstructured":"Gu H, Schutt A, Stuckey PJ, Wallace MG, Chu G. In: Schwindt, C., Zimmermann, J. (eds.) Exact and Heuristic Methods for the Resource-Constrained Net Present Value Problem, 2015;299\u2013318. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-319-05443-8_14.","DOI":"10.1007\/978-3-319-05443-8_14"},{"key":"1487_CR50","unstructured":"Laurent Perron and Vincent Furnon: OR-Tools version 7.2 (2019-7-19). https:\/\/developers.google.com\/optimization\/"},{"key":"1487_CR51","unstructured":"CPLEX II. version 12.8.0. IBM Corp., Armonk, New York, U.S. (2017)"},{"key":"1487_CR52","doi-asserted-by":"publisher","unstructured":"M. Pour S, Drake JH, Ejlertsen LS, Rasmussen KM, Burke EK. A hybrid constraint programming\/mixed integer programming framework for the preventive signaling maintenance crew scheduling problem. European Journal of Operational Research 269(1), 2018;41\u2013352. https:\/\/doi.org\/10.1016\/j.ejor.2017.08.033","DOI":"10.1016\/j.ejor.2017.08.033"},{"key":"1487_CR53","doi-asserted-by":"publisher","unstructured":"Bockmayr A, Hooker JN. Constraint programming. In: Aardal, K., Nemhauser, G.L., Weismantel, R. (eds.) Discrete Optimization. Handbooks in Operations Research and Management Science, vol. 12, pp. 559\u2013600. Elsevier. https:\/\/doi.org\/10.1016\/S0927-0507(05)12010-6. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0927050705120106","DOI":"10.1016\/S0927-0507(05)12010-6"},{"key":"1487_CR54","doi-asserted-by":"publisher","unstructured":"Kolisch R, Hartmann S. Heuristic Algorithms for the Resource-Constrained Project Scheduling Problem: Classification and Computational Analysis, 1999;147\u2013178. Springer, Boston, MA. https:\/\/doi.org\/10.1007\/978-1-4615-5533-9_7.","DOI":"10.1007\/978-1-4615-5533-9_7"},{"issue":"1","key":"1487_CR55","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. Psplib - a project scheduling problem library: Or software - orsep operations research software exchange program. Euro J Oper Res. 1997;96(1):205\u201316. https:\/\/doi.org\/10.1016\/S0377-2217(96)00170-1.","journal-title":"Euro J Oper Res."},{"key":"1487_CR56","first-page":"437","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"P Vil\u00edm","year":"2015","unstructured":"Vil\u00edm P, Laborie P, Shaw P. Failure-directed search for constraint-based scheduling. In: Michel L, editor. Integration of AI and OR Techniques in Constraint Programming. Cham: Springer; 2015. p. 437\u201353."},{"key":"1487_CR57","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/978-3-642-04244-7_29","volume-title":"Principles and practice of constraint programming\u2014CP 2009","author":"T Feydy","year":"2009","unstructured":"Feydy T, Stuckey PJ. Lazy clause generation reengineered. In: Gent IP, editor. Principles and practice of constraint programming\u2014CP 2009. Berlin, Heidelberg: Springer; 2009. p. 352\u201366."},{"key":"1487_CR58","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106777","volume":"149","author":"M Bofill","year":"2020","unstructured":"Bofill M, Coll J, Suy J, Villaret M. Smt encodings for resource-constrained project scheduling problems. Comput Ind Eng. 2020;149: 106777. https:\/\/doi.org\/10.1016\/j.cie.2020.106777.","journal-title":"Comput Ind Eng."},{"key":"1487_CR59","doi-asserted-by":"publisher","unstructured":"Czogalla J, Fink A. Particle Swarm Topologies for Resource Constrained Project Scheduling, 2009;61\u201373. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-642-03211-0_6.","DOI":"10.1007\/978-3-642-03211-0_6"},{"key":"1487_CR60","unstructured":"Muller LF. An adaptive large neighborhood search algorithm for the resource-constrained project scheduling problem. In: Proceedings of the VIII Metaheuristics International Conference (MIC) 2009"},{"key":"1487_CR61","doi-asserted-by":"publisher","unstructured":"Debels D, De Reyck B, Leus R, Vanhoucke M. A hybrid scatter search\/electromagnetism meta-heuristic for project scheduling. European Journal of Operational Research. 2006;169(2):638\u201353. https:\/\/doi.org\/10.1016\/j.ejor.2004.08.020. Feature Cluster on Scatter Search Methods for Optimization.","DOI":"10.1016\/j.ejor.2004.08.020"},{"issue":"13","key":"1487_CR62","doi-asserted-by":"publisher","first-page":"5870","DOI":"10.1016\/j.eswa.2014.03.027","volume":"41","author":"A Fahmy","year":"2014","unstructured":"Fahmy A, Hassan TM, Bassioni H. Improving rcpsp solutions quality with stacking justification\u2014application with particle swarm optimization. Expert Syst Appl. 2014;41(13):5870\u201381. https:\/\/doi.org\/10.1016\/j.eswa.2014.03.027.","journal-title":"Expert Syst Appl."},{"issue":"5","key":"1487_CR63","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1007\/s00170-012-4227-8","volume":"65","author":"MM Nasiri","year":"2013","unstructured":"Nasiri MM. A pseudo particle swarm optimization for the rcpsp. Int J Adv Manuf Technol. 2013;65(5):909\u201318. https:\/\/doi.org\/10.1007\/s00170-012-4227-8.","journal-title":"Int J Adv Manuf Technol."},{"issue":"2","key":"1487_CR64","doi-asserted-by":"publisher","first-page":"04019055","DOI":"10.1061\/(ASCE)CP.1943-5487.0000874","volume":"34","author":"J Liu","year":"2020","unstructured":"Liu J, Liu Y, Shi Y, Li J. Solving resource-constrained project scheduling problem via genetic algorithm. J Comput Civ Eng. 2020;34(2):04019055. https:\/\/doi.org\/10.1061\/(ASCE)CP.1943-5487.0000874.","journal-title":"J Comput Civ Eng."},{"key":"1487_CR65","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1016\/j.ins.2017.08.023","volume":"418\u2013419","author":"S Elsayed","year":"2017","unstructured":"Elsayed S, Sarker R, Ray T, Coello CC. Consolidated optimization algorithm for resource-constrained project scheduling problems. Inform Sci. 2017;418\u2013419:346\u201362. https:\/\/doi.org\/10.1016\/j.ins.2017.08.023.","journal-title":"Inform Sci."},{"key":"1487_CR66","doi-asserted-by":"publisher","first-page":"680","DOI":"10.1016\/j.ins.2014.02.155","volume":"277","author":"G Koulinas","year":"2014","unstructured":"Koulinas G, Kotsikas L, Anagnostopoulos K. A particle swarm optimization based hyper-heuristic algorithm for the classic resource constrained project scheduling problem. Inform Sci. 2014;277:680\u201393. https:\/\/doi.org\/10.1016\/j.ins.2014.02.155.","journal-title":"Inform Sci."}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-022-01487-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-022-01487-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-022-01487-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,10]],"date-time":"2023-03-10T11:41:12Z","timestamp":1678448472000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-022-01487-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,17]]},"references-count":66,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2023,3]]}},"alternative-id":["1487"],"URL":"https:\/\/doi.org\/10.1007\/s42979-022-01487-1","relation":{},"ISSN":["2661-8907"],"issn-type":[{"value":"2661-8907","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,17]]},"assertion":[{"value":"3 June 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 October 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 December 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":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"104"}}