{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T07:15:19Z","timestamp":1772781319260,"version":"3.50.1"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,7,21]],"date-time":"2020-07-21T00:00:00Z","timestamp":1595289600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,7,21]],"date-time":"2020-07-21T00:00:00Z","timestamp":1595289600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2020,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The multi-mode resource investment problem (MRIP) is the multi-mode extension of the resource investment problem, which is also known under the name resource availability cost problem. It is a project scheduling problem with a given due date as well as precedence and resource constraints. The goal is to find a precedence feasible schedule that minimises the resource costs of the allocated resources. To compute these costs, the maximum resource peak is considered regarding renewable resource types, whereas the sum of allocated nonrenewable resource units is used in the case of nonrenewable resources. Many practical and complex project scheduling settings can be modelled with this type of problem. Especially with the usage of different processing modes, time and cost compromises can be utilised by the project manager. In the literature, some procedures for the MRIP have been investigated; however, the computational experiments in these studies have not been carried out on common benchmark instances. This makes a fair comparison of methods difficult. Therefore, we generated novel instances specifically designed for this problem and published them on the website <jats:ext-link xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" ext-link-type=\"uri\" xlink:href=\"https:\/\/riplib.hsu-hh.de\">https:\/\/riplib.hsu-hh.de<\/jats:ext-link>. On this website, the instances as well as best-known solution values are available and researchers can also contribute their findings. We investigate these novel instances by proposing and evaluating lower bounds for the MRIP. Additionally, we analyse the proposed instances by applying heuristic as well as exact methods. These experiments suggest that most of the instances are challenging and further research is needed. Finally, we show some computational complexity properties of the NP-hard MRIP.<\/jats:p>","DOI":"10.1007\/s00291-020-00595-9","type":"journal-article","created":{"date-parts":[[2020,7,21]],"date-time":"2020-07-21T01:03:17Z","timestamp":1595293397000},"page":"901-933","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["The multi-mode resource investment problem: a benchmark library and a computational study of lower and upper bounds"],"prefix":"10.1007","volume":"42","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3769-5438","authenticated-orcid":false,"given":"Patrick","family":"Gerhards","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,7,21]]},"reference":[{"issue":"2","key":"595_CR1","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.orl.2017.02.001","volume":"45","author":"C Artigues","year":"2017","unstructured":"Artigues C (2017) On the strength of time-indexed formulations for the resource-constrained project scheduling problem. Oper Res Lett 45(2):154\u2013159. https:\/\/doi.org\/10.1016\/j.orl.2017.02.001","journal-title":"Oper Res Lett"},{"key":"595_CR2","doi-asserted-by":"crossref","unstructured":"Bartels JH (2009) Anwendung von Methoden der ressourcenbeschr\u00e4nkten Projektplanung mit multiplen Ausf\u00fchrungsmodi in der betriebswirtschaftlichen Praxis: R\u00fcckbauplanung f\u00fcr Kernkraftwerke und Versuchstr\u00e4gerplanung in Automobilentwicklungsprojekten. Springer, Berlin","DOI":"10.1007\/978-3-8349-8228-5"},{"issue":"3","key":"595_CR3","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1016\/j.ejor.2007.11.010","volume":"193","author":"JH Bartels","year":"2009","unstructured":"Bartels JH, Zimmermann J (2009) Scheduling tests in automotive R&D projects. Eur J Oper Res 193(3):805\u2013819. https:\/\/doi.org\/10.1016\/j.ejor.2007.11.010","journal-title":"Eur J Oper Res"},{"key":"595_CR4","doi-asserted-by":"publisher","first-page":"1157","DOI":"10.1007\/978-3-319-05915-0_22","volume-title":"Handbook on project management and scheduling","author":"JH Bartels","year":"2015","unstructured":"Bartels JH, Zimmermann J (2015) Scheduling tests in automotive R&D projects using a genetic algorithm. In: Schwindt C, Zimmermann J (eds) Handbook on project management and scheduling, vol 2. Springer, Cham, pp 1157\u20131185. https:\/\/doi.org\/10.1007\/978-3-319-05915-0_22"},{"issue":"2","key":"595_CR5","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/s00291-016-0435-1","volume":"38","author":"L Bianco","year":"2016","unstructured":"Bianco L, Caramia M, Giordani S (2016) Resource levelling in project scheduling with generalized precedence relationships and variable execution intensities. OR Spectrum 38(2):405\u2013425. https:\/\/doi.org\/10.1007\/s00291-016-0435-1","journal-title":"OR Spectrum"},{"issue":"11","key":"595_CR6","doi-asserted-by":"publisher","first-page":"2547","DOI":"10.1080\/00207549308956882","volume":"31","author":"FF Boctor","year":"1993","unstructured":"Boctor FF (1993) Heuristics for scheduling projects with resource restrictions and several resource-duration modes. Int J Prod Res 31(11):2547\u20132558. https:\/\/doi.org\/10.1080\/00207549308956882","journal-title":"Int J Prod Res"},{"key":"595_CR7","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1214\/aoms\/1177729380","volume":"1","author":"WG Cochran","year":"1952","unstructured":"Cochran WG (1952) The $$\\chi$$2 test of goodness of fit. Ann Math Stat 1:315\u2013345","journal-title":"Ann Math Stat"},{"issue":"5","key":"595_CR8","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1057\/jors.2013.46","volume":"65","author":"E Colak","year":"2014","unstructured":"Colak E, Azizoglu M (2014) A resource investment problem with time\/resource trade-offs. J Oper Res Soc 65(5):777\u2013790. https:\/\/doi.org\/10.1057\/jors.2013.46","journal-title":"J Oper Res Soc"},{"issue":"1","key":"595_CR9","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.ejor.2015.02.043","volume":"245","author":"ET Coughlan","year":"2015","unstructured":"Coughlan ET, L\u00fcbbecke ME, Schulz J (2015) A branch-price-and-cut algorithm for multi-mode resource leveling. Eur J Oper Res 245(1):70\u201380. https:\/\/doi.org\/10.1016\/j.ejor.2015.02.043","journal-title":"Eur J Oper Res"},{"issue":"1","key":"595_CR10","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0305-0483(89)90022-4","volume":"17","author":"RF Deckro","year":"1989","unstructured":"Deckro RF, Hebert JE (1989) Resource constrained project crashing. Omega 17(1):69\u201379. https:\/\/doi.org\/10.1016\/0305-0483(89)90022-4","journal-title":"Omega"},{"issue":"10","key":"595_CR11","doi-asserted-by":"publisher","first-page":"1590","DOI":"10.1287\/mnsc.41.10.1590","volume":"41","author":"E Demeulemeester","year":"1995","unstructured":"Demeulemeester E (1995) Minimizing resource availability costs in time-limited project networks. Manag Sci 41(10):1590\u20131598. https:\/\/doi.org\/10.1287\/mnsc.41.10.1590","journal-title":"Manag Sci"},{"issue":"1","key":"595_CR12","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1023\/A:1022283403119","volume":"6","author":"E Demeulemeester","year":"2003","unstructured":"Demeulemeester E, Vanhoucke M, Herroelen W (2003) RanGen: a random network generator for activity-on-the-node networks. J Schedul 6(1):17\u201338. https:\/\/doi.org\/10.1023\/A:1022283403119","journal-title":"J Schedul"},{"issue":"3","key":"595_CR13","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1057\/palgrave.jors.2601099","volume":"52","author":"A Drexl","year":"2001","unstructured":"Drexl A, Kimms A (2001) Optimization guided lower and upper bounds for the resource investment problem. J Oper Res Soc 52(3):340\u2013351. https:\/\/doi.org\/10.1057\/palgrave.jors.2601099","journal-title":"J Oper Res Soc"},{"issue":"3","key":"595_CR14","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1016\/j.ejor.2016.07.024","volume":"256","author":"MJ Geiger","year":"2017","unstructured":"Geiger MJ (2017) A multi-threaded local search algorithm and computer implementation for the multi-mode, resource-constrained multi-project scheduling problem. Eur J Oper Res 256(3):729\u2013741. https:\/\/doi.org\/10.1016\/j.ejor.2016.07.024","journal-title":"Eur J Oper Res"},{"key":"595_CR15","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/978-3-319-55702-1_68","volume-title":"Operations Research Proceedings 2016","author":"P Gerhards","year":"2018","unstructured":"Gerhards P, St\u00fcrck C (2018) A hybrid metaheuristic for the multi-mode resource investment problem with tardiness penalty. In: Fink A, F\u00fcgenschuh A, Geiger MJ (eds) Operations Research Proceedings 2016. Springer, Cham, pp 515\u2013520. https:\/\/doi.org\/10.1007\/978-3-319-55702-1_68"},{"issue":"4","key":"595_CR16","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1057\/palgrave.jors.2601827","volume":"56","author":"CC Hsu","year":"2005","unstructured":"Hsu CC, Kim DS (2005) A new heuristic for the multi-mode resource investment problem. J Oper Res Soc 56(4):406\u2013413. https:\/\/doi.org\/10.1057\/palgrave.jors.2601827","journal-title":"J Oper Res Soc"},{"issue":"1\u20134","key":"595_CR17","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1023\/A:1010954031930","volume":"102","author":"J J\u00f3zefowska","year":"2001","unstructured":"J\u00f3zefowska J, Mika M, R\u00f3zycki R, Walig\u00f3ra G, Weglarz J (2001) Simulated annealing for multi-mode resource-constrained project scheduling. Ann Oper Res 102(1\u20134):137\u2013155","journal-title":"Ann Oper Res"},{"issue":"1","key":"595_CR18","first-page":"347","volume":"13","author":"JE Kelley","year":"1963","unstructured":"Kelley JE (1963) The critical-path method: resources planning and scheduling. Ind Schedul 13(1):347\u2013365","journal-title":"Ind Schedul"},{"issue":"2","key":"595_CR19","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1016\/S0377-2217(97)00442-6","volume":"112","author":"R Klein","year":"1999","unstructured":"Klein R, Scholl A (1999) Computing lower bounds by destructive improvement: an application to resource-constrained project scheduling. Eur J Oper Res 112(2):322\u2013346. https:\/\/doi.org\/10.1016\/S0377-2217(97)00442-6","journal-title":"Eur J Oper Res"},{"issue":"3","key":"595_CR20","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0272-6963(95)00032-1","volume":"14","author":"R Kolisch","year":"1996","unstructured":"Kolisch R (1996) Efficient priority rules for the resource-constrained project scheduling problem. J Oper Manag 14(3):179\u2013192. https:\/\/doi.org\/10.1016\/0272-6963(95)00032-1","journal-title":"J Oper Manag"},{"issue":"1","key":"595_CR21","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\u2014a project scheduling problem library: OR software\u2014ORSEP operations research software exchange program. Eur J Oper Res 96(1):205\u2013216. https:\/\/doi.org\/10.1016\/S0377-2217(96)00170-1","journal-title":"Eur J Oper Res"},{"issue":"10","key":"595_CR22","doi-asserted-by":"publisher","first-page":"1693","DOI":"10.1287\/mnsc.41.10.1693","volume":"41","author":"R Kolisch","year":"1995","unstructured":"Kolisch R, Sprecher A, Drexl A (1995) Characterization and generation of a general class of resource-constrained project scheduling problems. Manag Sci 41(10):1693\u20131703. https:\/\/doi.org\/10.1287\/mnsc.41.10.1693","journal-title":"Manag Sci"},{"issue":"2","key":"595_CR23","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1016\/j.ejor.2017.10.014","volume":"266","author":"S Kreter","year":"2018","unstructured":"Kreter S, Schutt A, Stuckey PJ, Zimmermann J (2018) Mixed-integer linear programming and constraint programming formulations for solving resource availability cost problems. Eur J Oper Res 266(2):472\u2013486. https:\/\/doi.org\/10.1016\/j.ejor.2017.10.014","journal-title":"Eur J Oper Res"},{"issue":"2","key":"595_CR24","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/s10601-018-9281-x","volume":"23","author":"P Laborie","year":"2018","unstructured":"Laborie P, Rogerie J, Shaw P, Vil\u00edm P (2018) IBM ILOG CP optimizer for scheduling. Constraints 23(2):210\u2013250. https:\/\/doi.org\/10.1007\/s10601-018-9281-x","journal-title":"Constraints"},{"key":"595_CR25","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.orp.2016.09.002","volume":"3","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez M, Dubois-Lacoste J, C\u00e1ceres LP, Birattari M, St\u00fctzle T (2016) The irace package: iterated racing for automatic algorithm configuration. Oper Res Perspect 3:43\u201358. https:\/\/doi.org\/10.1016\/j.orp.2016.09.002","journal-title":"Oper Res Perspect"},{"issue":"11","key":"595_CR26","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1287\/mnsc.16.11.728","volume":"16","author":"AA Mastor","year":"1970","unstructured":"Mastor AA (1970) An experimental investigation and comparative evaluation of production line balancing techniques. Manag Sci 16(11):728\u2013746. https:\/\/doi.org\/10.1287\/mnsc.16.11.728","journal-title":"Manag Sci"},{"key":"595_CR27","doi-asserted-by":"publisher","unstructured":"Meng H, Wang B, Nie Y, Xia X, Zhang X (2016) A scatter search hybrid algorithm for resource availability cost problem. In: Harmony search algorithm. Springer, Berlin, pp 39\u201351. https:\/\/doi.org\/10.1007\/978-3-662-47926-1_5","DOI":"10.1007\/978-3-662-47926-1_5"},{"issue":"1","key":"595_CR28","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1287\/opre.32.1.89","volume":"32","author":"RH M\u00f6hring","year":"1984","unstructured":"M\u00f6hring RH (1984) Minimizing costs of resource requirements in project networks subject to a fixed completion time. Oper Res 32(1):89\u2013120. https:\/\/doi.org\/10.1287\/opre.32.1.89","journal-title":"Oper Res"},{"key":"595_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2009\/106425","volume":"2009","author":"AA Najafi","year":"2009","unstructured":"Najafi AA, Azimi F (2009) A priority rule-based heuristic for resource investment project scheduling problem with discounted cash flows and tardiness penalties. Math Problems Eng 2009:1. https:\/\/doi.org\/10.1155\/2009\/106425","journal-title":"Math Problems Eng"},{"issue":"2","key":"595_CR30","doi-asserted-by":"publisher","first-page":"1057","DOI":"10.1016\/j.amc.2006.05.118","volume":"183","author":"AA Najafi","year":"2006","unstructured":"Najafi AA, Niaki STA (2006) A genetic algorithm for resource investment problem with discounted cash flows. Appl Math Comput 183(2):1057\u20131070. https:\/\/doi.org\/10.1016\/j.amc.2006.05.118","journal-title":"Appl Math Comput"},{"issue":"11","key":"595_CR31","doi-asserted-by":"publisher","first-page":"2994","DOI":"10.1155\/2009\/106425","volume":"36","author":"AA Najafi","year":"2009","unstructured":"Najafi AA, Niaki STA, Shahsavar M (2009) A parameter-tuned genetic algorithm for the resource investment problem with discounted cash flows and generalized precedence relations. Comput Oper Res 36(11):2994\u20133001. https:\/\/doi.org\/10.1155\/2009\/106425","journal-title":"Comput Oper Res"},{"key":"595_CR32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24800-2","volume-title":"Project scheduling with time windows and scarce resources: temporal and resource-constrained project scheduling with regular and nonregular objective functions","author":"K Neumann","year":"2003","unstructured":"Neumann K, Schwindt C, Zimmermann J (2003) Project scheduling with time windows and scarce resources: temporal and resource-constrained project scheduling with regular and nonregular objective functions. Springer, Berlin"},{"issue":"3","key":"595_CR33","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s10951-014-0374-0","volume":"18","author":"JJ Qi","year":"2015","unstructured":"Qi JJ, Liu YJ, Jiang P, Guo B (2015) Schedule generation scheme for solving multi-mode resource availability cost problem by modified particle swarm optimization. J Schedul 18(3):285\u2013298. https:\/\/doi.org\/10.1007\/s10951-014-0374-0","journal-title":"J Schedul"},{"issue":"2","key":"595_CR34","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1016\/j.amc.2007.07.022","volume":"196","author":"M Ranjbar","year":"2008","unstructured":"Ranjbar M, Kianfar F, Shadrokh S (2008) Solving the resource availability cost problem in project scheduling by path relinking and genetic algorithm. Appl Math Comput 196(2):879\u2013888. https:\/\/doi.org\/10.1016\/j.amc.2007.07.022","journal-title":"Appl Math Comput"},{"key":"595_CR35","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/978-3-319-05443-8_17","volume-title":"Handbook on project management and scheduling","author":"J Rieck","year":"2015","unstructured":"Rieck J, Zimmermann J (2015) Exact methods for resource leveling problems. In: Schwindt C, Zimmermann J (eds) Handbook on project management and scheduling, vol 1. Springer, Cham, pp 361\u2013387. https:\/\/doi.org\/10.1007\/978-3-319-05443-8_17"},{"issue":"3","key":"595_CR36","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1016\/j.advengsoft.2010.03.002","volume":"206","author":"SB Rodrigues","year":"2010","unstructured":"Rodrigues SB, Yamashita DS (2010) An exact algorithm for minimizing resource availability costs in project scheduling. Eu J Oper Res 206(3):562\u2013568. https:\/\/doi.org\/10.1016\/j.advengsoft.2010.03.002","journal-title":"Eu J Oper Res"},{"key":"595_CR37","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-319-05443-8_15","volume-title":"Handbook on project management and scheduling","author":"SB Rodrigues","year":"2015","unstructured":"Rodrigues SB, Yamashita DS (2015) Exact methods for the resource availability cost problem. In: Schwindt C, Zimmermann J (eds) Handbook on project management and scheduling, vol 1. Springer, Cham, pp 319\u2013338. https:\/\/doi.org\/10.1007\/978-3-319-05443-8_15"},{"issue":"2","key":"595_CR38","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s00291-015-0419-6","volume":"38","author":"A Schnell","year":"2016","unstructured":"Schnell A, Hartl RF (2016) On the efficient modeling and solution of the multi-mode resource-constrained project scheduling problem with generalized precedence relations. OR Spectrum 38(2):283\u2013303. https:\/\/doi.org\/10.1007\/s00291-015-0419-6","journal-title":"OR Spectrum"},{"key":"595_CR39","unstructured":"Schwindt C (1998) Generation of resource constrained project scheduling problems subject to temporal constraints. Inst. f\u00fcr Wirtschaftstheorie und Operations-Research"},{"issue":"1","key":"595_CR40","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.ejor.2006.03.056","volume":"181","author":"S Shadrokh","year":"2007","unstructured":"Shadrokh S, Kianfar F (2007) A genetic algorithm for resource investment project scheduling problem, tardiness permitted with penalty. Eur J Oper Res 181(1):86\u2013101. https:\/\/doi.org\/10.1016\/j.ejor.2006.03.056","journal-title":"Eur J Oper Res"},{"issue":"2","key":"595_CR41","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. Eur J Oper Res 107(2):431\u2013450. https:\/\/doi.org\/10.1016\/S0377-2217(97)00348-2","journal-title":"Eur J Oper Res"},{"issue":"10","key":"595_CR42","doi-asserted-by":"publisher","first-page":"1197","DOI":"10.1287\/mnsc.28.10.1197","volume":"28","author":"FB Talbot","year":"1982","unstructured":"Talbot FB (1982) Resource-constrained project scheduling with time-resource tradeoffs: the nonpreemptive case. Manag Sci 28(10):1197\u20131210. https:\/\/doi.org\/10.1287\/mnsc.28.10.1197","journal-title":"Manag Sci"},{"issue":"1\u20132","key":"595_CR43","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/s10696-011-9117-0","volume":"25","author":"V Van Peteghem","year":"2013","unstructured":"Van Peteghem V, Vanhoucke M (2013) An artificial immune system algorithm for the resource availability cost problem. Flex Serv Manuf J 25(1\u20132):122\u2013144. https:\/\/doi.org\/10.1007\/s10696-011-9117-0","journal-title":"Flex Serv Manuf J"},{"issue":"1","key":"595_CR44","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. Eur J Oper Res 235(1):62\u201372. https:\/\/doi.org\/10.1016\/j.ejor.2013.10.012","journal-title":"Eur J Oper Res"},{"key":"595_CR45","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-319-05443-8_16","volume-title":"Handbook on project management and scheduling","author":"V Van Peteghem","year":"2015","unstructured":"Van Peteghem V, Vanhoucke M (2015) Heuristic methods for the resource availability cost problem. In: Schwindt C, Zimmermann J (eds) Handbook on project management and scheduling, vol 1. Springer, Cham, pp 339\u2013359. https:\/\/doi.org\/10.1007\/978-3-319-05443-8_16"},{"issue":"2","key":"595_CR46","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s00291-016-0458-7","volume":"39","author":"C Verbeeck","year":"2017","unstructured":"Verbeeck C, Van Peteghem V, Vanhoucke M, Vansteenwegen P, Aghezzaf EH (2017) A metaheuristic solution approach for the time-constrained project scheduling problem. OR Spectrum 39(2):353\u2013371. https:\/\/doi.org\/10.1007\/s00291-016-0458-7","journal-title":"OR Spectrum"},{"issue":"4","key":"595_CR47","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1504\/IJOR.2009.025702","volume":"5","author":"DS Yamashita","year":"2009","unstructured":"Yamashita DS, Morabito R (2009) A note on time\/cost tradeoff curve generation for project scheduling with multi-mode resource availability costs. Int J Oper Res 5(4):429\u2013444. https:\/\/doi.org\/10.1504\/IJOR.2009.025702","journal-title":"Int J Oper Res"},{"issue":"2","key":"595_CR48","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1016\/j.amc.2006.05.118","volume":"169","author":"DS Yamashita","year":"2006","unstructured":"Yamashita DS, Armentano VA, Laguna M (2006) Scatter search for project scheduling with resource availability cost. Eur J Oper Res 169(2):623\u2013637. https:\/\/doi.org\/10.1016\/j.amc.2006.05.118","journal-title":"Eur J Oper Res"},{"issue":"1","key":"595_CR49","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s10951-006-0326-4","volume":"10","author":"DS Yamashita","year":"2007","unstructured":"Yamashita DS, Armentano VA, Laguna M (2007) Robust optimization models for project scheduling with resource availability cost. J Sched 10(1):67\u201376. https:\/\/doi.org\/10.1007\/s10951-006-0326-4","journal-title":"J Sched"},{"issue":"1","key":"595_CR50","doi-asserted-by":"publisher","first-page":"39","DOI":"10.3934\/bdia.2017007","volume":"2","author":"X Yuan","year":"2017","unstructured":"Yuan X, Liu J, Hao X (2017) A moving block sequence-based evolutionary algorithm for resource investment project scheduling problems. Big Data Inf Anal 2(1):39\u201358. https:\/\/doi.org\/10.3934\/bdia.2017007","journal-title":"Big Data Inf Anal"},{"issue":"3","key":"595_CR51","doi-asserted-by":"publisher","first-page":"746","DOI":"10.1016\/j.ejor.2016.08.049","volume":"257","author":"X Zhu","year":"2017","unstructured":"Zhu X, Ruiz R, Li S, Li X (2017) An effective heuristic for project scheduling with resource availability cost. Eur J Oper Res 257(3):746\u2013762. https:\/\/doi.org\/10.1016\/j.ejor.2016.08.049","journal-title":"Eur J Oper Res"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-020-00595-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00291-020-00595-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-020-00595-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,20]],"date-time":"2021-07-20T23:29:36Z","timestamp":1626823776000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00291-020-00595-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,21]]},"references-count":51,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["595"],"URL":"https:\/\/doi.org\/10.1007\/s00291-020-00595-9","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,7,21]]},"assertion":[{"value":"10 April 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 June 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 July 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}