{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,5]],"date-time":"2026-07-05T04:53:54Z","timestamp":1783227234001,"version":"3.54.6"},"reference-count":73,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,12,23]],"date-time":"2023-12-23T00:00:00Z","timestamp":1703289600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,23]],"date-time":"2023-12-23T00:00:00Z","timestamp":1703289600000},"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":["Ann Oper Res"],"published-print":{"date-parts":[[2024,7]]},"DOI":"10.1007\/s10479-023-05775-8","type":"journal-article","created":{"date-parts":[[2023,12,23]],"date-time":"2023-12-23T17:01:56Z","timestamp":1703350916000},"page":"41-68","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["An efficient relax-and-solve method for the multi-mode resource constrained project scheduling problem"],"prefix":"10.1007","volume":"338","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9780-8262","authenticated-orcid":false,"given":"Alireza","family":"Etminaniesfahani","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hanyu","family":"Gu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Leila Moslemi","family":"Naeni","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Amir","family":"Salehipour","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,12,23]]},"reference":[{"issue":"2","key":"5775_CR1","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. (2019). Worst case analysis of relax and fix heuristics for lot-sizing problems. European Journal of Operational Research, 279(2), 449\u2013458. https:\/\/doi.org\/10.1016\/j.ejor.2019.06.010","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"5775_CR2","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1080\/15623599.2019.1623992","volume":"22","author":"MR Afshar","year":"2022","unstructured":"Afshar, M. R., Shahhosseini, V., & Sebt, M. H. (2022). A genetic algorithm with a new local search method for solving the multimode resource-constrained project scheduling problem. International Journal of Construction Management, 22(3), 357\u2013365. https:\/\/doi.org\/10.1080\/15623599.2019.1623992","journal-title":"International Journal of Construction Management"},{"issue":"4","key":"5775_CR3","doi-asserted-by":"publisher","first-page":"2316","DOI":"10.1111\/itor.12901","volume":"29","author":"MM Ahmadian","year":"2022","unstructured":"Ahmadian, M. M., & Salehipour, A. (2022). Heuristics for flights arrival scheduling at airports. International Transactions in Operational Research, 29(4), 2316\u20132345. https:\/\/doi.org\/10.1111\/itor.12901","journal-title":"International Transactions in Operational Research"},{"issue":"1","key":"5775_CR4","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.ejor.2020.04.017","volume":"288","author":"MM Ahmadian","year":"2021","unstructured":"Ahmadian, M. M., Salehipour, A., & Cheng, T. C. E. (2021). A meta-heuristic to solve the just-in-time job-shop scheduling problem. European Journal of Operational Research, 288(1), 14\u201329.","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"5775_CR5","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1057\/palgrave.jors.2601563","volume":"54","author":"J Alcaraz","year":"2003","unstructured":"Alcaraz, J., Maroto, C., & Ruiz, R. (2003). Solving the multi-mode resource-constrained project scheduling problem with genetic algorithms. Journal of the Operational Research Society, 54(6), 614\u2013626. https:\/\/doi.org\/10.1057\/palgrave.jors.2601563","journal-title":"Journal of the Operational Research Society"},{"key":"5775_CR6","doi-asserted-by":"crossref","unstructured":"Ahmadian, M. M., Salehipour, A., & Kovalyov, M. (2020). An efficient relax-and-solve heuristic for open-shop scheduling problem to minimize total weighted earliness-tardiness.","DOI":"10.2139\/ssrn.3601396"},{"key":"5775_CR7","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1016\/j.ins.2016.09.010","volume":"373","author":"S Asta","year":"2016","unstructured":"Asta, S., Karapetyan, D., Kheiri, A., \u00d6zcan, E., & Parkes, A. J. (2016). Combining Monte-Carlo and hyper-heuristic methods for the multi-mode resource-constrained multi-project scheduling problem. Information Sciences, 373, 476\u2013498. https:\/\/doi.org\/10.1016\/j.ins.2016.09.010","journal-title":"Information Sciences"},{"key":"5775_CR8","doi-asserted-by":"publisher","unstructured":"Ayodele, M., McCall, J., & Regnier-Coudert, O. (2016). BPGA-EDA for the multi-mode resource constrained project scheduling problem. In 2016 IEEE congress on evolutionary computation (CEC) (pp. 3417\u20133424). https:\/\/doi.org\/10.1109\/CEC.2016.7744222","DOI":"10.1109\/CEC.2016.7744222"},{"issue":"1","key":"5775_CR9","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, J. K., & Kan, A. H. G. R. (1983). Scheduling subject to resource constraints: Classification and complexity. Discrete Applied Mathematics, 5(1), 11\u201324. https:\/\/doi.org\/10.1016\/0166-218X(83)90012-4","journal-title":"Discrete Applied Mathematics"},{"issue":"11","key":"5775_CR10","doi-asserted-by":"publisher","first-page":"2547","DOI":"10.1080\/00207549308956882","volume":"31","author":"FF Boctor","year":"1993","unstructured":"Boctor, F. F. (1993). Heuristics for scheduling projects with resource restrictions and several resource-duration modes. International Journal of Production Research, 31(11), 2547\u20132558. https:\/\/doi.org\/10.1080\/00207549308956882","journal-title":"International Journal of Production Research"},{"key":"5775_CR11","doi-asserted-by":"publisher","unstructured":"Boctor, F. F. (1996a). A new and efficient heuristic for scheduling projects with resource restrictions and multiple execution modes. European Journal of Operational Research, 90(2), 349\u2013361. https:\/\/doi.org\/10.1016\/0377-2217(95)00359-2","DOI":"10.1016\/0377-2217(95)00359-2"},{"key":"5775_CR12","doi-asserted-by":"publisher","unstructured":"Boctor, F. F. (1996b). Resource-constrained project scheduling by simulated annealing. International Journal of Production Research, 34(8), 2335\u20132351. https:\/\/doi.org\/10.1080\/00207549608905028","DOI":"10.1080\/00207549608905028"},{"issue":"2","key":"5775_CR13","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. European Journal of Operational Research, 149(2), 268\u2013281. https:\/\/doi.org\/10.1016\/S0377-2217(02)00761-0","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"5775_CR14","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1111\/itor.12644","volume":"27","author":"RK Chakrabortty","year":"2020","unstructured":"Chakrabortty, R. K., Abbasi, A., & Ryan, M. J. (2020). Multi-mode resource-constrained project scheduling using modified variable neighborhood search heuristic. International Transactions in Operational Research, 27(1), 138\u2013167. https:\/\/doi.org\/10.1111\/itor.12644","journal-title":"International Transactions in Operational Research"},{"key":"5775_CR15","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/j.cor.2014.04.018","volume":"53","author":"J Cheng","year":"2015","unstructured":"Cheng, J., Fowler, J., Kempf, K., & Mason, S. (2015). Multi-mode resource-constrained project scheduling problems with non-preemptive activity splitting. Computers & Operations Research, 53, 275\u2013287. https:\/\/doi.org\/10.1016\/j.cor.2014.04.018","journal-title":"Computers & Operations Research"},{"issue":"1","key":"5775_CR16","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.ejor.2011.03.019","volume":"213","author":"J Coelho","year":"2011","unstructured":"Coelho, J., & Vanhoucke, M. (2011). Multi-mode resource-constrained project scheduling using RCPSP and sat solvers. European Journal of Operational Research, 213(1), 73\u201382. https:\/\/doi.org\/10.1016\/j.ejor.2011.03.019","journal-title":"European Journal of Operational Research"},{"key":"5775_CR17","unstructured":"CPLEX, I.I. (2017). version 12.8.0. IBM Corp."},{"issue":"2","key":"5775_CR18","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/j.tcs.2005.05.020","volume":"344","author":"M Dorigo","year":"2005","unstructured":"Dorigo, M., & Blum, C. (2005). Ant colony optimization theory: A survey. Theoretical Computer Science, 344(2), 243\u2013278. https:\/\/doi.org\/10.1016\/j.tcs.2005.05.020","journal-title":"Theoretical Computer Science"},{"key":"5775_CR19","doi-asserted-by":"crossref","unstructured":"Eberhart, R., & Kennedy, J. (1995). A new optimizer using particle swarm theory. In MHS\u201995. Proceedings of the sixth international symposium on micro machine and human science (pp. 39\u201343).","DOI":"10.1109\/MHS.1995.494215"},{"issue":"3","key":"5775_CR20","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1007\/s11750-017-0461-4","volume":"25","author":"LF Escudero","year":"2017","unstructured":"Escudero, L. F., & Romero, C. P. (2017). 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), 601\u2013622. https:\/\/doi.org\/10.1007\/s11750-017-0461-4","journal-title":"TOP: An Official Journal of the Spanish Society of Statistics and Operations Research"},{"key":"5775_CR21","doi-asserted-by":"publisher","unstructured":"Etminaniesfahani, A., Gu, H., & Salehipour, A. (2022a). An efficient relax-and-solve algorithm for the resource-constrained project scheduling problem, 271\u2013277. https:\/\/doi.org\/10.5220\/0010772400003117","DOI":"10.5220\/0010772400003117"},{"key":"5775_CR22","doi-asserted-by":"publisher","unstructured":"Etminaniesfahani, A., Gu, H., Naeni, L., & Salehipour, A. (2022b). A forward\u2013backward relax-and-solve algorithm for the resource-constrained project scheduling problem. SN Computer Science, 4, 104\u2013114. https:\/\/doi.org\/10.1007\/s42979-022-01487-1","DOI":"10.1007\/s42979-022-01487-1"},{"key":"5775_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2021.107592","volume":"162","author":"GA Fernandes","year":"2021","unstructured":"Fernandes, G. A., & de Souza, S. R. (2021). A matheuristic approach to the multi-mode resource constrained project scheduling problem. Computers & Industrial Engineering, 162, 107592. https:\/\/doi.org\/10.1016\/j.cie.2021.107592","journal-title":"Computers & Industrial Engineering"},{"issue":"2","key":"5775_CR24","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1016\/S0377-2217(02)00884-6","volume":"155","author":"K Fleszar","year":"2004","unstructured":"Fleszar, K., & Hindi, K. S. (2004). Solving the resource-constrained project scheduling problem by a variable neighbourhood search. European Journal of Operational Research, 155(2), 402\u2013413. https:\/\/doi.org\/10.1016\/S0377-2217(02)00884-6","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"5775_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(03)00274-1","volume":"155","author":"A Fr\u00e9ville","year":"2004","unstructured":"Fr\u00e9ville, A. (2004). The multidimensional 0\u20131 knapsack problem: An overview. European Journal of Operational Research, 155(1), 1\u201321. https:\/\/doi.org\/10.1016\/S0377-2217(03)00274-1","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"5775_CR26","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1023\/A:1010902015091","volume":"102","author":"S Hartmann","year":"2001","unstructured":"Hartmann, S. (2001). Project scheduling with multiple modes: A genetic algorithm. Annals of Operations Research, 102(1), 111\u2013135. https:\/\/doi.org\/10.1023\/A:1010902015091","journal-title":"Annals of Operations Research"},{"key":"5775_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2009.11.005","volume":"207","author":"S Hartmann","year":"2010","unstructured":"Hartmann, S., & Briskorn, D. (2010). A survey of variants and extensions of the resource-constrained project scheduling problem. European Journal of Operational Research, 207, 1\u201314. https:\/\/doi.org\/10.1016\/j.ejor.2009.11.005","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"5775_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2021.05.004","volume":"297","author":"S Hartmann","year":"2022","unstructured":"Hartmann, S., & Briskorn, D. (2022). An updated survey of variants and extensions of the resource-constrained project scheduling problem. European Journal of Operational Research, 297(1), 1\u201314.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"5775_CR29","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. (2010). A fix-and-optimize approach for the multi-level capacitated lot sizing problem. International Journal of Production Economics, 123(2), 247\u2013256.","journal-title":"International Journal of Production Economics"},{"key":"5775_CR30","unstructured":"Herroelen, W., Demeulemeester, E., & Reyck, B. (1997). A classification scheme for project scheduling problems. Katholieke Universiteit Leuven, Open Access publications from Katholieke Universiteit Leuven (pp. 1\u201326)."},{"key":"5775_CR31","doi-asserted-by":"crossref","unstructured":"Holland, J. H. (1992). Genetic algorithms. Scientific American","DOI":"10.1038\/scientificamerican0792-66"},{"issue":"1","key":"5775_CR32","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/j.amc.2007.04.096","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. Applied Mathematics and Computation, 195(1), 299\u2013308. https:\/\/doi.org\/10.1016\/j.amc.2007.04.096","journal-title":"Applied Mathematics and Computation"},{"key":"5775_CR33","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1023\/A:1010954031930","volume":"102","author":"J Jozefowska","year":"2001","unstructured":"Jozefowska, J., Mika, M., Rozycki, R., Waligora, G., & Weglarz, J. (2001). Simulated annealing for multimode resource-constrained project scheduling. Annals of Operations Research - Annals OR, 102, 137\u2013155. https:\/\/doi.org\/10.1023\/A:1010954031930","journal-title":"Annals of Operations Research - Annals OR"},{"key":"5775_CR34","doi-asserted-by":"crossref","unstructured":"Kelareva, E., Brand, S., Kilby, P., Thiebaux, S., & Wallace, M. (2012). CP and MIP methods for ship scheduling with time-varying draft. In ICAPS 2012\u2014Proceedings of the 22nd international conference on automated planning and scheduling.","DOI":"10.1609\/icaps.v22i1.13494"},{"key":"5775_CR35","unstructured":"Kheiri, A., \u00d6zcan, E., & Parkes, A. J. (2012). HYSST: Hyper-heuristic search strategies and timetabling"},{"issue":"11","key":"5775_CR36","doi-asserted-by":"publisher","first-page":"987","DOI":"10.1080\/07408179708966417","volume":"29","author":"R Kolisch","year":"1997","unstructured":"Kolisch, R., & Drexl, A. (1997). Local search for nonpreemptive multi-mode resource-constrained project scheduling. IIE Transactions, 29(11), 987\u2013999. https:\/\/doi.org\/10.1080\/07408179708966417","journal-title":"IIE Transactions"},{"issue":"1","key":"5775_CR37","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. (2006). Experimental investigation of heuristics for resource-constrained project scheduling: An update. European Journal of Operational Research, 174(1), 23\u201337. https:\/\/doi.org\/10.1016\/j.ejor.2005.01.065","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"5775_CR38","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. European Journal of Operational Research, 96(1), 205\u2013216. https:\/\/doi.org\/10.1016\/S0377-2217(96)00170-1","journal-title":"European Journal of Operational Research"},{"key":"5775_CR39","doi-asserted-by":"publisher","DOI":"10.1007\/s10601-016-9266-6","author":"S Kreter","year":"2017","unstructured":"Kreter, S., Schutt, A., & Stuckey, P. (2017). Using constraint programming for solving RCPSP\/max-cal. Constraints. https:\/\/doi.org\/10.1007\/s10601-016-9266-6","journal-title":"Constraints"},{"key":"5775_CR40","doi-asserted-by":"publisher","unstructured":"Larranaga, P., & Lozano, J. (2002). Estimation of distribution algorithms: A new tool for evolutionary computation. Springer. https:\/\/doi.org\/10.1007\/978-1-4615-1539-5","DOI":"10.1007\/978-1-4615-1539-5"},{"key":"5775_CR41","doi-asserted-by":"publisher","unstructured":"Li, Y., Li, H., & Yang, T. (2011). Solving MRCPSP by constraint programming. In 2011 International conference of information technology. Computer Engineering and Management Sciences (Vol. 1, pp. 312\u2013315). https:\/\/doi.org\/10.1109\/ICM.2011.251","DOI":"10.1109\/ICM.2011.251"},{"key":"5775_CR42","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1016\/j.autcon.2013.05.030","volume":"35","author":"H Li","year":"2013","unstructured":"Li, H., & Zhang, H. (2013). Ant colony optimization-based multi-mode scheduling under renewable and nonrenewable resource constraints. Automation in Construction, 35, 431\u2013438. https:\/\/doi.org\/10.1016\/j.autcon.2013.05.030","journal-title":"Automation in Construction"},{"issue":"1","key":"5775_CR43","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. (2008). A constraint programming approach for the resource-constrained project scheduling problem. Annals of Operations Research, 157(1), 25\u201336.","journal-title":"Annals of Operations Research"},{"key":"5775_CR44","doi-asserted-by":"publisher","first-page":"69","DOI":"10.4114\/ia.v10i30.947","volume":"10","author":"A Lova","year":"2006","unstructured":"Lova, A., Tormos, M., & Barber, F. (2006). Multi-mode resource constrained project scheduling: Scheduling schemes, priority rules and mode selection rules. Inteligencia Artificial, Revista Iberoamericana de Inteligencia Artificial, 10, 69\u201386. https:\/\/doi.org\/10.4114\/ia.v10i30.947","journal-title":"Inteligencia Artificial, Revista Iberoamericana de Inteligencia Artificial"},{"issue":"2","key":"5775_CR45","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/j.ijpe.2008.11.002","volume":"117","author":"A Lova","year":"2009","unstructured":"Lova, A., Tormos, P., Cervantes, M., & Barber, F. (2009). An efficient hybrid genetic algorithm for scheduling projects with resource constraints and multiple execution modes. International Journal of Production Economics, 117(2), 302\u2013316. https:\/\/doi.org\/10.1016\/j.ijpe.2008.11.002","journal-title":"International Journal of Production Economics"},{"key":"5775_CR46","doi-asserted-by":"publisher","unstructured":"Maleck, C., Nieke, G., Bock, K., Pabst, D., & Stehli, M. (2018). 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) (pp. 3526\u20133537). https:\/\/doi.org\/10.1109\/WSC.2018.8632404","DOI":"10.1109\/WSC.2018.8632404"},{"issue":"1","key":"5775_CR47","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/S0377-2217(96)00180-4","volume":"100","author":"M Mori","year":"1997","unstructured":"Mori, M., & Tseng, C. C. (1997). A genetic algorithm for multi-mode resource constrained project scheduling problem. European Journal of Operational Research, 100(1), 134\u2013141. https:\/\/doi.org\/10.1016\/S0377-2217(96)00180-4","journal-title":"European Journal of Operational Research"},{"key":"5775_CR48","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.cor.2018.01.001","volume":"92","author":"AEF Muritiba","year":"2018","unstructured":"Muritiba, A. E. F., Rodrigues, C. D., & da Costa, F. A. (2018). A path-relinking algorithm for the multi-mode resource-constrained project scheduling problem. Computers & Operations Research, 92, 145\u2013154. https:\/\/doi.org\/10.1016\/j.cor.2018.01.001","journal-title":"Computers & Operations Research"},{"key":"5775_CR49","doi-asserted-by":"crossref","unstructured":"Nonobe, K., & Ibaraki, T. (2002). Formulation and Tabu search algorithm for the resource constrained project scheduling problem. In Essays and surveys in metaheuristics.","DOI":"10.1007\/978-1-4615-1507-4_25"},{"key":"5775_CR50","doi-asserted-by":"publisher","unstructured":"Ozcan, E., & Kheiri, A. (2012). A hyper-heuristic based on random gradient, greedy and dominance (pp. 557\u2013563). https:\/\/doi.org\/10.1007\/978-1-4471-2155-8-71","DOI":"10.1007\/978-1-4471-2155-8-71"},{"key":"5775_CR51","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1109\/5326.740669","volume":"29","author":"L Ozdamar","year":"1999","unstructured":"Ozdamar, L. (1999). A genetic algorithm approach to a general category project scheduling problem. IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews, 29, 44\u201359. https:\/\/doi.org\/10.1109\/5326.740669","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews"},{"issue":"2","key":"5775_CR52","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1016\/j.ejor.2009.03.034","volume":"201","author":"VV Peteghem","year":"2010","unstructured":"Peteghem, V. V., & Vanhoucke, M. (2010). A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem. European Journal of Operational Research, 201(2), 409\u2013418. https:\/\/doi.org\/10.1016\/j.ejor.2009.03.034","journal-title":"European Journal of Operational Research"},{"key":"5775_CR53","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, L. J., & Wolfe, P. (1969). Multiproject scheduling with limited resources: A zero-one programming approach. Management Science, 16, 93\u2013108.","journal-title":"Management Science"},{"issue":"1","key":"5775_CR54","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.ejor.2007.10.042","volume":"193","author":"M Ranjbar","year":"2009","unstructured":"Ranjbar, M., De Reyck, B., & Kianfar, F. (2009). A hybrid scatter search for the discrete time\/resource trade-off problem in project scheduling. European Journal of Operational Research, 193(1), 35\u201348. https:\/\/doi.org\/10.1016\/j.ejor.2007.10.042","journal-title":"European Journal of Operational Research"},{"key":"5775_CR55","unstructured":"Salehipour, A. (2017). A heuristic algorithm for the aircraft landing problem. In 22nd International congress on modelling and simulation. Modelling and simulation society of Australia and New Zealand Inc. (MSSANZ)"},{"key":"5775_CR56","unstructured":"Salehipour, A., Ahmadian, M., & Oron, D. (2018). Efficient and simple heuristics for the aircraft landing problem. In Matheuristic 2018 international conference."},{"key":"5775_CR57","doi-asserted-by":"publisher","unstructured":"Schutt, A., Feydy, T., Stuckey, P.J., & Wallace, M.G. (2015). A satisfiability solving approach (pp. 135\u2013160). Springer. https:\/\/doi.org\/10.1007\/978-3-319-05443-8_7","DOI":"10.1007\/978-3-319-05443-8_7"},{"key":"5775_CR58","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. (2011). Explaining the cumulative propagator. Constraints, 16, 250\u2013282. https:\/\/doi.org\/10.1007\/s10601-010-9103-2","journal-title":"Constraints"},{"key":"5775_CR59","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.orp.2017.01.002","volume":"4","author":"A Schnell","year":"2017","unstructured":"Schnell, A., & Hartl, R. F. (2017). On the generalization of constraint programming and Boolean satisfiability solving techniques to schedule a resource-constrained project consisting of multi-mode jobs. Operations Research Perspectives, 4, 1\u201311. https:\/\/doi.org\/10.1016\/j.orp.2017.01.002","journal-title":"Operations Research Perspectives"},{"issue":"8","key":"5775_CR60","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1057\/jors.1980.134","volume":"31","author":"R Slowinski","year":"1980","unstructured":"Slowinski, R. (1980). Two approaches to problems of resource allocation among project activities\u2014A comparative study. Journal of the Operational Research Society, 31(8), 711\u2013723. https:\/\/doi.org\/10.1057\/jors.1980.134","journal-title":"Journal of the Operational Research Society"},{"issue":"2","key":"5775_CR61","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/0377-2217(94)90353-0","volume":"79","author":"R Slowinski","year":"1994","unstructured":"Slowinski, R., Soniewicki, B., & Weglarz, J. (1994). Dss for multiobjective project scheduling. European Journal of Operational Research, 79(2), 220\u2013229. https:\/\/doi.org\/10.1016\/0377-2217(94)90353-0","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"5775_CR62","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1016\/0377-2217(93)90185-P","volume":"64","author":"MG Speranza","year":"1993","unstructured":"Speranza, M. G., & Vercellis, C. (1993). Hierarchical models for multi-project planning and scheduling. European Journal of Operational Research, 64(2), 312\u2013325. https:\/\/doi.org\/10.1016\/0377-2217(93)90185-P","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"5775_CR63","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1016\/S0377-2217(97)00348-2","volume":"107","author":"A Sprecher","year":"1998","unstructured":"Sprecher, A., & Drexl, A. (1998). Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm. European Journal of Operational Research, 107(2), 431\u2013450. https:\/\/doi.org\/10.1016\/S0377-2217(97)00348-2","journal-title":"European Journal of Operational Research"},{"key":"5775_CR64","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/BF01545587","volume":"19","author":"A Sprecher","year":"1997","unstructured":"Sprecher, A., Hartmann, S., & Drexl, A. (1997). An exact algorithm for project scheduling with multiple modes. Operations-Research-Spektrum, 19, 195\u2013203.","journal-title":"Operations-Research-Spektrum"},{"issue":"10","key":"5775_CR65","doi-asserted-by":"publisher","first-page":"1197","DOI":"10.1287\/mnsc.28.10.1197","volume":"28","author":"FB Talbot","year":"1982","unstructured":"Talbot, F. B. (1982). Resource-constrained project scheduling with time-resource tradeoffs: The nonpreemptive case. Management Science, 28(10), 1197\u20131210.","journal-title":"Management Science"},{"issue":"1","key":"5775_CR66","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1023\/A:1010997814183","volume":"102","author":"P Tormos","year":"2001","unstructured":"Tormos, P., & Lova, A. (2001). A competitive heuristic solution technique for resource-constrained project scheduling. Annals of Operations Research, 102(1), 65\u201381.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"5775_CR67","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.ejor.2013.10.012","volume":"235","author":"V Van Peteghem","year":"2014","unstructured":"Van Peteghem, V., & Vanhoucke, M. (2014). An experimental investigation of metaheuristics for the multi-mode resource-constrained project scheduling problem on new dataset instances. European Journal of Operational Research, 235(1), 62\u201372. https:\/\/doi.org\/10.1016\/j.ejor.2013.10.012","journal-title":"European Journal of Operational Research"},{"key":"5775_CR68","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/j.cie.2018.02.001","volume":"118","author":"M Vanhoucke","year":"2018","unstructured":"Vanhoucke, M., & Coelho, J. (2018). A tool to test and validate algorithms for the resource-constrained project scheduling problem. Computers & Industrial Engineering, 118, 251\u2013265. https:\/\/doi.org\/10.1016\/j.cie.2018.02.001","journal-title":"Computers & Industrial Engineering"},{"key":"5775_CR69","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106567","volume":"146","author":"F Zaman","year":"2020","unstructured":"Zaman, F., Elsayed, S., Sarker, R., & Essam, D. (2020). Hybrid evolutionary algorithm for large-scale project scheduling problems. Computers & Industrial Engineering, 146, 106567. https:\/\/doi.org\/10.1016\/j.cie.2020.106567","journal-title":"Computers & Industrial Engineering"},{"key":"5775_CR70","doi-asserted-by":"publisher","first-page":"914","DOI":"10.1016\/j.cie.2018.11.031","volume":"127","author":"R Zamani","year":"2019","unstructured":"Zamani, R. (2019). An effective mirror-based genetic algorithm for scheduling multi-mode resource constrained projects. Computers & Industrial Engineering, 127, 914\u2013924.","journal-title":"Computers & Industrial Engineering"},{"issue":"2","key":"5775_CR71","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1111\/j.1467-8667.2005.00420.x","volume":"21","author":"H Zhang","year":"2006","unstructured":"Zhang, H., Tam, C., & Li, H. (2006). Multimode project scheduling based on particle swarm optimization. Computer-Aided Civil and Infrastructure Engineering, 21(2), 93\u2013103. https:\/\/doi.org\/10.1111\/j.1467-8667.2005.00420.x","journal-title":"Computer-Aided Civil and Infrastructure Engineering"},{"key":"5775_CR72","doi-asserted-by":"publisher","DOI":"10.1155\/2015\/923791","author":"L Zhang","year":"2015","unstructured":"Zhang, L., Luo, Y., & Zhang, Y. (2015). Hybrid particle swarm and differential evolution algorithm for solving multimode resource-constrained project scheduling problem. Journal of Control Science and Engineering. https:\/\/doi.org\/10.1155\/2015\/923791","journal-title":"Journal of Control Science and Engineering"},{"issue":"3","key":"5775_CR73","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1287\/ijoc.1040.0121","volume":"18","author":"G Zhu","year":"2006","unstructured":"Zhu, G., Bard, J. F., & Yu, G. (2006). A branch-and-cut procedure for the multimode resource-constrained project-scheduling problem. INFORMS Journal on Computing, 18(3), 377\u2013390. https:\/\/doi.org\/10.1287\/ijoc.1040.0121","journal-title":"INFORMS Journal on Computing"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-023-05775-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-023-05775-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-023-05775-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,15]],"date-time":"2024-07-15T16:25:26Z","timestamp":1721060726000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-023-05775-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,23]]},"references-count":73,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["5775"],"URL":"https:\/\/doi.org\/10.1007\/s10479-023-05775-8","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,23]]},"assertion":[{"value":"9 February 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 December 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 December 2023","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"}}]}}