{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T14:31:23Z","timestamp":1774449083209,"version":"3.50.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"4-5","license":[{"start":{"date-parts":[[2018,3,15]],"date-time":"2018-03-15T00:00:00Z","timestamp":1521072000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1007\/s10732-018-9368-y","type":"journal-article","created":{"date-parts":[[2018,3,15]],"date-time":"2018-03-15T11:46:13Z","timestamp":1521114373000},"page":"793-807","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Intensification, diversification, and learning via relaxation adaptive memory programming: a case study on resource constrained project scheduling"],"prefix":"10.1007","volume":"25","author":[{"given":"R. Christopher L.","family":"Riley","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cesar","family":"Rego","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,15]]},"reference":[{"key":"9368_CR1","volume-title":"Resource-Constrained Project Scheduling: Models, Algorithms, Extensions and Applications","year":"2013","unstructured":"Artigues, C., Demassey, S., Neron, E. (eds.): Resource-Constrained Project Scheduling: Models, Algorithms, Extensions and Applications. Wiley, Hoboken (2013)"},{"issue":"2","key":"9368_CR2","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.: On the strength of time-indexed formulations for the resource-constrained project scheduling problem. Oper. Res. Lett. 45(2), 154\u2013159 (2017). \n                    https:\/\/doi.org\/10.1016\/j.orl.2017.02.001","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"9368_CR3","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/S0377-2217(02)00758-0","volume":"149","author":"C Artigues","year":"2003","unstructured":"Artigues, C., Michelon, P., Reusser, S.: Insertion techniques for static and dynamic resource-constrained project scheduling. Eur. J. Oper. Res. 149(2), 249\u2013267 (2003). \n                    https:\/\/doi.org\/10.1016\/s0377-2217(02)00758-0","journal-title":"Eur. J. Oper. Res."},{"key":"9368_CR4","first-page":"1","volume-title":"Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization","author":"T Baar","year":"1998","unstructured":"Baar, T., Brucker, P., Knust, S.: Tabu search algorithms and lower bounds for the resource-constrained project scheduling problem. In: Voss, S., Martello, S., Osman, I.H., Roucairol, C. (eds.) Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, pp. 1\u201318. Kluwer Academic Publishers, Boston (1998)"},{"issue":"3","key":"9368_CR5","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1051\/ro\/2016036","volume":"51","author":"L Bianco","year":"2017","unstructured":"Bianco, L., Caramia, M.: The resource constrained project scheduling problem: a theoretical comparison between a recent formulation and the main time indexed linear programming based approaches. RAIRO-Oper. Res. 51(3), 519\u2013532 (2017)","journal-title":"RAIRO-Oper. Res."},{"issue":"1","key":"9368_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, J.K., Kan, A.H.G.R.: Scheduling subject to resource constraints: classification and complexity. Discrete Appl. Math. 5(1), 11\u201324 (1983). \n                    https:\/\/doi.org\/10.1016\/0166-218X(83)90012-4","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"9368_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0377-2217(98)00204-5","volume":"112","author":"P Brucker","year":"1999","unstructured":"Brucker, P., Drexl, A., M\u00f6hring, R., Neumann, K., Pesch, E.: Resource-constrained project scheduling: notation, classification, models, and methods. Eur. J. Oper. Res. 112(1), 3\u201341 (1999). \n                    https:\/\/doi.org\/10.1016\/s0377-2217(98)00204-5","journal-title":"Eur. J. Oper. Res."},{"key":"9368_CR8","first-page":"26","volume-title":"Mathematical Programming Studies","author":"PM Camerini","year":"1975","unstructured":"Camerini, P.M., Fratta, L., Maffioli, F.: On improving relaxation methods by modified gradient techniques. In: Balinski, M.L., Wolfe, P. (eds.) Mathematical Programming Studies, vol. 3, pp. 26\u201334. Springer, Berlin (1975)"},{"issue":"1","key":"9368_CR9","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0377-2217(95)00249-9","volume":"95","author":"WB Carlton","year":"1996","unstructured":"Carlton, W.B., Barnes, J.W.: A note on hashing functions and tabu search algorithms. Eur. J. Oper. Res. 95(1), 237\u2013239 (1996). \n                    https:\/\/doi.org\/10.1016\/0377-2217(95)00249-9","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"9368_CR10","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1016\/0377-2217(87)90240-2","volume":"29","author":"N Christofides","year":"1987","unstructured":"Christofides, N., Alvarez-Valdes, R., Tamarit, J.M.: Project scheduling with resource constraints: a branch and bound approach. Eur. J. Oper. Res. 29(3), 262\u2013273 (1987). \n                    https:\/\/doi.org\/10.1016\/0377-2217(87)90240-2","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9368_CR11","first-page":"219","volume":"12","author":"B Gavish","year":"1991","unstructured":"Gavish, B., Glover, F., Pirkul, H.: Surrogate constraints in integer programming. J. Inf. Optim. Sci. 12(2), 219\u2013228 (1991)","journal-title":"J. Inf. Optim. Sci."},{"issue":"1","key":"9368_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/1013001","volume":"13","author":"AM Geoffrion","year":"1971","unstructured":"Geoffrion, A.M.: Duality in nonlinear programming: a simplified applications-oriented development. SIAM Rev. 13(1), 1\u201337 (1971). \n                    https:\/\/doi.org\/10.2307\/2028848","journal-title":"SIAM Rev."},{"issue":"1","key":"9368_CR13","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1111\/j.1540-5915.1977.tb01074.x","volume":"8","author":"F Glover","year":"1977","unstructured":"Glover, F.: Heuristics for integer programming using surrogate constraints. Decis. Sci. 8(1), 156\u2013166 (1977). \n                    https:\/\/doi.org\/10.1111\/j.1540-5915.1977.tb01074.x","journal-title":"Decis. Sci."},{"issue":"5","key":"9368_CR14","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"F Glover","year":"1986","unstructured":"Glover, F.: Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. 13(5), 533\u2013549 (1986). \n                    https:\/\/doi.org\/10.1016\/0305-0548(86)90048-1","journal-title":"Comput. Oper. Res."},{"key":"9368_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Boston (1997)"},{"issue":"4","key":"9368_CR16","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"AV Goldberg","year":"1988","unstructured":"Goldberg, A.V., Tarjan, R.E.: A new approach to the maximum-flow problem. J. ACM 35(4), 921\u2013940 (1988). \n                    https:\/\/doi.org\/10.1145\/48014.61051","journal-title":"J. ACM"},{"issue":"5","key":"9368_CR17","doi-asserted-by":"publisher","first-page":"924","DOI":"10.1287\/opre.18.5.924","volume":"18","author":"HJ Greenberg","year":"1970","unstructured":"Greenberg, H.J., Pierskalla, W.P.: Surrogate mathematical programming. Oper. Res. 18(5), 924\u2013939 (1970)","journal-title":"Oper. Res."},{"issue":"1","key":"9368_CR18","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.: A survey of variants and extensions of the resource-constrained project scheduling problem. Eur. J. Oper. Res. 207(1), 1\u201314 (2010). \n                    https:\/\/doi.org\/10.1016\/j.ejor.2009.11.005","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9368_CR19","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1016\/S0377-2217(99)00485-3","volume":"127","author":"S Hartmann","year":"2000","unstructured":"Hartmann, S., Kolisch, R.: Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem. Eur. J. Oper. Res. 127(2), 394\u2013407 (2000). \n                    https:\/\/doi.org\/10.1016\/s0377-2217(99)00485-3","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"9368_CR20","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. 25(4), 279\u2013302 (1998). \n                    https:\/\/doi.org\/10.1016\/s0305-0548(97)00055-5","journal-title":"Comput. Oper. Res."},{"issue":"11","key":"9368_CR21","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1108\/01443579310046454","volume":"13","author":"O Icmeli","year":"1993","unstructured":"Icmeli, O., Erenguc, S.S., Zappe, C.J.: Project scheduling problems: a survey. Int. J. Oper. Prod. Manag. 13(11), 80\u201391 (1993). \n                    https:\/\/doi.org\/10.1108\/01443579310046454","journal-title":"Int. J. Oper. Prod. Manag."},{"issue":"1","key":"9368_CR22","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/BF01588253","volume":"17","author":"MH Karwan","year":"1979","unstructured":"Karwan, M.H., Rardin, R.L.: Some relationships between lagrangian and surrogate duality in integer programming. Math. Program. 17(1), 320\u2013334 (1979). \n                    https:\/\/doi.org\/10.1007\/bf01588253","journal-title":"Math. Program."},{"issue":"16","key":"9368_CR23","doi-asserted-by":"publisher","first-page":"3937","DOI":"10.1080\/00207540050176094","volume":"38","author":"R Klein","year":"2000","unstructured":"Klein, R.: Project scheduling with time-varying resource constraints. Int. J. Prod. Res. 38(16), 3937\u20133952 (2000). \n                    https:\/\/doi.org\/10.1080\/00207540050176094","journal-title":"Int. J. Prod. Res."},{"key":"9368_CR24","first-page":"147","volume-title":"Project Scheduling: Recent Models, Algorithms, and Applications. International Series in Operations Research & Management Science","author":"R Kolisch","year":"1998","unstructured":"Kolisch, R., Hartmann, S.: Heuristic algorithms for the resource-constrained project scheduling problem: classification and computational analysis. In: Weglarz, J. (ed.) Project Scheduling: Recent Models, Algorithms, and Applications. International Series in Operations Research & Management Science, pp. 147\u2013178. Kluwer Academic Publishers, Boston (1998)"},{"issue":"1","key":"9368_CR25","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. Eur. J. Oper. Res. 174(1), 23\u201337 (2006). \n                    https:\/\/doi.org\/10.1016\/j.ejor.2005.01.065","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"9368_CR26","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/S0305-0483(00)00046-3","volume":"29","author":"R Kolisch","year":"2001","unstructured":"Kolisch, R., Padman, R.: An integrated survey of deterministic project scheduling. Omega 29(3), 249\u2013272 (2001). \n                    https:\/\/doi.org\/10.1016\/S0305-0483(00)00046-3","journal-title":"Omega"},{"key":"9368_CR27","volume-title":"Project Scheduling. International Series in Operations Research & Management Science","author":"R Kolisch","year":"1999","unstructured":"Kolisch, R., Schwindt, C., Sprecher, A.: Benchmark instances for project scheduling problems. In: W\u0119glarz, J. (ed.) Project Scheduling. International Series in Operations Research & Management Science, vol 14. Springer, Boston, MA (1999)"},{"issue":"1","key":"9368_CR28","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.cor.2009.12.011","volume":"38","author":"O Kon\u00e9","year":"2011","unstructured":"Kon\u00e9, O., Artigues, C., Lopez, P., Mongeau, M.: Event-based MILP models for resource-constrained project scheduling problems. Comput. Oper. Res. 38(1), 3\u201313 (2011). \n                    https:\/\/doi.org\/10.1016\/j.cor.2009.12.011","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"9368_CR29","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1287\/mnsc.49.3.330.12737","volume":"49","author":"R M\u00f6hring","year":"2003","unstructured":"M\u00f6hring, R., Schulz, A., Stork, F., Uetz, M.: Solving project scheduling problems by minimum cut computations. Manage. Sci. 49(3), 330\u2013350 (2003)","journal-title":"Manage. Sci."},{"key":"9368_CR30","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/978-1-4615-1507-4_25","volume-title":"Essays and Surveys in Metaheuristics","author":"K Nonobe","year":"2002","unstructured":"Nonobe, K., Ibaraki, T.: Formulation and Tabu search algorithm for the resource constrained project scheduling problem. In: Ribeiro, C.C., Hansen, P. (eds.) Essays and Surveys in Metaheuristics, pp. 557\u2013588. Kluwer Academic Publishers, Boston (2002)"},{"issue":"5","key":"9368_CR31","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1080\/07408179508936773","volume":"27","author":"L \u00d6zdamar","year":"1995","unstructured":"\u00d6zdamar, L., Ulusoy, G.: A survey on the resource-constrained project scheduling problem. IIE Trans. 27(5), 574\u2013586 (1995). \n                    https:\/\/doi.org\/10.1080\/07408179508936773","journal-title":"IIE Trans."},{"issue":"3","key":"9368_CR32","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/0041-5553(69)90061-5","volume":"9","author":"BT Polyak","year":"1969","unstructured":"Polyak, B.T.: Minimization of unsmooth functionals. USSR Comput. Math. Math. Phys. 9(3), 14\u201329 (1969). \n                    https:\/\/doi.org\/10.1016\/0041-5553(69)90061-5","journal-title":"USSR Comput. Math. Math. Phys."},{"issue":"1","key":"9368_CR33","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1287\/mnsc.16.1.93","volume":"16","author":"AAB Pritsker","year":"1969","unstructured":"Pritsker, A.A.B., Watters, L.J., Wolfe, P.M.: Multiproject scheduling with limited resources: a zero-one programming approach. Manage. Sci. 16(1), 93\u2013108 (1969)","journal-title":"Manage. Sci."},{"key":"9368_CR34","series-title":"Operations Research\/Computer Science Interfaces Series","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/0-387-23667-8_20","volume-title":"Metaheuristic Optimization via Memory and Evolution","author":"C Rego","year":"2005","unstructured":"Rego, C.: RAMP: a new metaheuristic framework for combinatorial optimization. In: Sharda, R., Vo\u00df, S., Rego, C., Alidaee, B. (eds.) Metaheuristic Optimization via Memory and Evolution. Operations Research\/Computer Science Interfaces Series, vol. 30, pp. 441\u2013460. Springer, Berlin (2005)"},{"issue":"1\u20132","key":"9368_CR100","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/s12063-010-0028-0","volume":"3","author":"E Rolland","year":"2010","unstructured":"Rolland, E., Patterson, R. A., Ward, K., & Dodin, B.: Decision support for disaster management. Oper. Manag. Res. 3(1\u20132), 68\u201379 (2010)","journal-title":"Oper. Manag. Res."},{"issue":"1","key":"9368_CR35","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1007\/s10479-010-0800-4","volume":"181","author":"C Rego","year":"2010","unstructured":"Rego, C., Mathew, F., Glover, F.: RAMP for the capacitated minimum spanning tree problem. Ann. Oper. Res. 181(1), 661\u2013681 (2010). \n                    https:\/\/doi.org\/10.1007\/s10479-010-0800-4","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"9368_CR36","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s002910000042","volume":"22","author":"C Schwindt","year":"2000","unstructured":"Schwindt, C., Trautmann, N.: Batch scheduling in process industries: an application of resource\u2013constrained project scheduling. OR Spectr. 22(4), 501\u2013524 (2000). \n                    https:\/\/doi.org\/10.1007\/s002910000042","journal-title":"OR Spectr."},{"issue":"3","key":"9368_CR37","doi-asserted-by":"publisher","first-page":"1336","DOI":"10.1016\/j.ejor.2006.03.070","volume":"185","author":"\u00c9D Taillard","year":"2008","unstructured":"Taillard, \u00c9.D., Waelti, P., Zuber, J.: Few statistical tests for proportions comparison. Eur. J. Oper. Res. 185(3), 1336\u20131350 (2008). \n                    https:\/\/doi.org\/10.1016\/j.ejor.2006.03.070","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9368_CR38","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/j.ejor.2004.04.008","volume":"165","author":"V Valls","year":"2005","unstructured":"Valls, V., Ballest\u0131\u0301n, F., Quintanilla, S.: Justification and RCPSP: a technique that pays. Eur. J. Oper. Res. 165(2), 375\u2013386 (2005). \n                    https:\/\/doi.org\/10.1016\/j.ejor.2004.04.008","journal-title":"Eur. J. Oper. Res."},{"issue":"1\u20134","key":"9368_CR39","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BF02022565","volume":"41","author":"DL Woodruff","year":"1993","unstructured":"Woodruff, D.L., Zemel, E.: Hashing vectors for tabu search. Ann. Oper. Res. 41(1\u20134), 123\u2013137 (1993)","journal-title":"Ann. Oper. Res."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-018-9368-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-018-9368-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-018-9368-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,14]],"date-time":"2019-08-14T01:05:19Z","timestamp":1565744719000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-018-9368-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,15]]},"references-count":40,"journal-issue":{"issue":"4-5","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["9368"],"URL":"https:\/\/doi.org\/10.1007\/s10732-018-9368-y","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,3,15]]},"assertion":[{"value":"17 September 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 December 2017","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 February 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 March 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}