{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:17:20Z","timestamp":1740107840262,"version":"3.37.3"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"17","license":[{"start":{"date-parts":[[2018,7,30]],"date-time":"2018-07-30T00:00:00Z","timestamp":1532908800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"National Key Technology Research and Development Program of China","award":["2016YFB1101700"],"award-info":[{"award-number":["2016YFB1101700"]}]},{"name":"Nature Science Foundation of Hubei Province, China","award":["2015CFA115"],"award-info":[{"award-number":["2015CFA115"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s00500-018-3410-8","type":"journal-article","created":{"date-parts":[[2018,7,30]],"date-time":"2018-07-30T01:48:30Z","timestamp":1532915310000},"page":"7805-7819","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A novel heuristic algorithm with activity back-shift response model for resource-constrained project scheduling problem"],"prefix":"10.1007","volume":"23","author":[{"given":"Buyun","family":"Sheng","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7170-9311","authenticated-orcid":false,"given":"Hui","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Zheng","family":"Xiao","sequence":"additional","affiliation":[]},{"given":"Chenglei","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Feiyu","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Xiyan","family":"Yin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,30]]},"reference":[{"key":"3410_CR1","doi-asserted-by":"publisher","DOI":"10.1155\/2014\/401696","author":"Z Abo-Hammour","year":"2014","unstructured":"Abo-Hammour Z, Abu Arqub O, Momani S, Shawagfeh N (2014) Optimization solution of Troesch\u2019s and Bratu\u2019s problems of ordinary type using novel continuous genetic algorithm. Discrete Dyn Nat Soc. \n                              https:\/\/doi.org\/10.1155\/2014\/401696","journal-title":"Discrete Dyn Nat Soc"},{"key":"3410_CR2","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1016\/j.ins.2014.03.128","volume":"279","author":"O Abu Arqub","year":"2014","unstructured":"Abu Arqub O, Abo-Hammour Z (2014) Numerical solution of systems of second-order boundary value problems using continuous genetic algorithm. Inf Sci 279:396\u2013415","journal-title":"Inf Sci"},{"issue":"2","key":"3410_CR3","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1080\/01446190903369907","volume":"28","author":"K Anagnostopoulos","year":"2010","unstructured":"Anagnostopoulos K, Koulinas G (2010a) A simulated annealing hyperheuristic for construction resource levelling. Constr Manag Econ 28(2):163\u2013175","journal-title":"Constr Manag Econ"},{"key":"3410_CR4","doi-asserted-by":"crossref","unstructured":"Anagnostopoulos K, Koulinas GA (2010) A genetic hyperheuristic algorithm for the resource constrained project scheduling problem. In: Proceedings of the 2010 IEEE congress on evolutionary computation (CEC), IEEE, pp 1\u20136","DOI":"10.1109\/CEC.2010.5586488"},{"issue":"2","key":"3410_CR5","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1061\/(ASCE)CP.1943-5487.0000116","volume":"26","author":"K Anagnostopoulos","year":"2012","unstructured":"Anagnostopoulos K, Koulinas G (2012) Resource-constrained critical path scheduling by a GRASP based hyperheuristic. J Comput Civ Eng 26(2):204\u2013213","journal-title":"J Comput Civ Eng"},{"key":"3410_CR6","doi-asserted-by":"crossref","unstructured":"Balaji PG, Srinivasan D (2010) An introduction to multi-agent systems. In: Innovations in multi-agent systems and applications, Springer, New York","DOI":"10.1007\/978-3-642-14435-6_1"},{"key":"3410_CR7","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/j.ejor.2015.05.003","volume":"246","author":"K Carolin","year":"2015","unstructured":"Carolin K, Stefan H (2015) Scheduling resource-constrained projects with a flexible project structure. Eur J Oper Res 246:379\u2013391","journal-title":"Eur J Oper Res"},{"key":"3410_CR8","doi-asserted-by":"publisher","DOI":"10.1061\/(ASCE)CP.1943-5487.0000632","author":"SE Christodoulou","year":"2017","unstructured":"Christodoulou SE (2017) Entropy-based heuristic for resource-constrained project scheduling. J Comput Civ Eng. \n                              https:\/\/doi.org\/10.1061\/(ASCE)CP.1943-5487.0000632","journal-title":"J Comput Civ Eng"},{"issue":"6","key":"3410_CR9","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1002\/(SICI)1520-6750(199810)45:7<733::AID-NAV5>3.0.CO;2-C","volume":"45","author":"S Hartmann","year":"1998","unstructured":"Hartmann S (1998) A competitive genetic algorithm for resource-constrained project scheduling. Nav Res Logist 45(6):733\u2013750","journal-title":"Nav Res Logist"},{"key":"3410_CR10","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1002\/nav.10029","volume":"49","author":"S Hartmann","year":"2002","unstructured":"Hartmann S (2002) A self-adapting genetic algorithm for project scheduling under resource constraints. Nav Res Logist 49:433\u2013448","journal-title":"Nav Res Logist"},{"key":"3410_CR11","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 (2000) Experimental evaluation of state-of-the-art heuristics for the re-source-constrained project scheduling problem. Eur J Oper Res 127:394\u2013407","journal-title":"Eur J Oper Res"},{"issue":"6","key":"3410_CR12","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1061\/(ASCE)CO.1943-7862.0000483","volume":"138","author":"T Hegazy","year":"2012","unstructured":"Hegazy T, Menesi W (2012) Heuristic method for satisfying both deadlines and resource constraints. J Constr Eng Manag 138(6):688\u2013696","journal-title":"J Constr Eng Manag"},{"issue":"6","key":"3410_CR13","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1080\/02533839.2016.1176866","volume":"39","author":"Q Jia","year":"2016","unstructured":"Jia Q, Guo Y (2016) Hybridization of ABC and PSO algorithms for improved solutions of RCPSP. J Chin Inst Eng 39(6):727\u2013734","journal-title":"J Chin Inst Eng"},{"key":"3410_CR14","doi-asserted-by":"publisher","first-page":"2627","DOI":"10.1007\/s00170-012-4679-x","volume":"67","author":"Q Jia","year":"2013","unstructured":"Jia Q, Seo Y (2013) An improved particle swarm optimization for the resource-constrained project scheduling problem. Int J Adv Manuf Technol 67:2627\u20132638","journal-title":"Int J Adv Manuf Technol"},{"issue":"7","key":"3410_CR16","doi-asserted-by":"publisher","first-page":"854","DOI":"10.1061\/(ASCE)CO.1943-7862.0000492","volume":"138","author":"G Koulinas","year":"2012","unstructured":"Koulinas G, Anagnostopoulos K (2012) Construction resource allocation and leveling using a threshold accepting based hyperheuristic algorithm. J Constr Eng Manag 138(7):854\u2013863","journal-title":"J Constr Eng Manag"},{"key":"3410_CR17","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.autcon.2012.11.002","volume":"31","author":"G Koulinas","year":"2013","unstructured":"Koulinas G, Anagnostopoulos K (2013) A new tabu search-based hyper-heuristic algorithm for solving construction leveling problems with limited resource availabilities. Autom Constr 31:169\u2013175","journal-title":"Autom Constr"},{"issue":"4","key":"3410_CR18","doi-asserted-by":"publisher","first-page":"1565","DOI":"10.1007\/s00500-015-1606-8","volume":"20","author":"N Kumar","year":"2016","unstructured":"Kumar N, Vidyarthi DP (2016) A model for resource-constrained project scheduling using adaptive PSO. Soft Comput 20(4):1565\u20131580","journal-title":"Soft Comput"},{"key":"3410_CR19","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s00170-011-3885-2","volume":"63","author":"S Li","year":"2012","unstructured":"Li S, Jia Y, Wang J (2012) Stochastic resource-constrained project scheduling based on discrete-event simulation and multiple-comparison procedure. Int J Adv Manuf Technol 63:65\u201376","journal-title":"Int J Adv Manuf Technol"},{"key":"3410_CR20","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1016\/j.ejor.2016.07.024","volume":"256","author":"JG Martin","year":"2017","unstructured":"Martin JG (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:729\u2013741","journal-title":"Eur J Oper Res"},{"key":"3410_CR21","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1109\/TEVC.2002.802450","volume":"6","author":"D Merkle","year":"2002","unstructured":"Merkle D, Middendorf M, Schmeck H (2002) Ant colony optimization for resource-constrained project scheduling. IEEE Trans Evol Comput 6:333\u2013346","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"3410_CR22","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1287\/mnsc.49.3.330.12737","volume":"49","author":"RH Mohring","year":"2003","unstructured":"Mohring RH, Schulz AS, Stork F, Uetz M (2003) Solving project scheduling problems by minimum cut computations. Manage Sci 49(3):330\u2013350","journal-title":"Manage Sci"},{"key":"3410_CR23","doi-asserted-by":"publisher","DOI":"10.1061\/(ASCE)CP.1943-5487.0000576","author":"IJ Potgieter","year":"2016","unstructured":"Potgieter IJ, van Rooyen GC (2016) Maximizing slack in resource-constrained schedules: a heuristic approach. J Comput Civ Eng. \n                              https:\/\/doi.org\/10.1061\/(ASCE)CP.1943-5487.0000576","journal-title":"J Comput Civ Eng"},{"key":"3410_CR24","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. Ann Oper Res 102:65\u201381","journal-title":"Ann Oper Res"},{"issue":"5","key":"3410_CR25","doi-asserted-by":"publisher","first-page":"1071","DOI":"10.1080\/0020754021000033904","volume":"41","author":"P Tormos","year":"2003","unstructured":"Tormos P, Lova A (2003) An efficient multi-pass heuristic for project scheduling with constrained resources. Int J Prod Res 41(5):1071\u20131086","journal-title":"Int J Prod Res"},{"key":"3410_CR26","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1016\/S0377-2217(02)00768-3","volume":"149","author":"V Valls","year":"2003","unstructured":"Valls V, Quintanilla MS, Ballestin F (2003) Resource-constrained project scheduling: a critical reordering heuristic. Eur J Oper Res 149:282\u2013301","journal-title":"Eur J Oper Res"},{"key":"3410_CR27","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1023\/B:ANOR.0000039524.09792.c9","volume":"131","author":"V Valls","year":"2004","unstructured":"Valls V, Ballestin F, Quintanilla MS (2004) A population-based approach to the resource-constrained project scheduling problem. Ann Oper Res 131:305\u2013324","journal-title":"Ann Oper Res"},{"key":"3410_CR28","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, Ballestin F, Quintanilla MS (2005) Justification and RCPSP: a technique that pays. Eur J Oper Res 165:375\u2013386","journal-title":"Eur J Oper Res"},{"key":"3410_CR29","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.ejor.2013.10.012","volume":"235","author":"VP Vincent","year":"2014","unstructured":"Vincent VP, Mario V (2014) An experimental investigation of metaheuristics for the multi-mode re-source-constrained project scheduling problem on new dataset instances. Eur J Oper Res 235:62\u201372","journal-title":"Eur J Oper Res"},{"issue":"2","key":"3410_CR30","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1017\/S0269888900008122","volume":"10","author":"M Wooldridge","year":"1995","unstructured":"Wooldridge M, Jennings NR (1995) Intelligent agents: theory and practice. Knowl Eng Rev 10(2):115\u2013152","journal-title":"Knowl Eng Rev"},{"issue":"1","key":"3410_CR31","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.ejor.2015.10.059","volume":"251","author":"J Xiao","year":"2016","unstructured":"Xiao J, Wu Z, Hong X, Tang J, Tang Y (2016) Integration of electromagnetism with multi-objective evolutionary algorithms for RCPSP. Eur J Oper Res 251(1):22\u201335","journal-title":"Eur J Oper Res"},{"key":"3410_CR32","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.1007\/s00170-012-4398-3","volume":"66","author":"HR Yoosefzadeh","year":"2013","unstructured":"Yoosefzadeh HR, Tareghian HR (2013) Hybrid solution method for resource-constrained project scheduling problem using a new schedule generator. Int J Adv Manuf Technol 66:1171\u20131180","journal-title":"Int J Adv Manuf Technol"},{"issue":"15\u201316","key":"3410_CR33","doi-asserted-by":"publisher","first-page":"6039","DOI":"10.1016\/j.eswa.2015.04.009","volume":"42","author":"X Zheng","year":"2015","unstructured":"Zheng X, Wang L (2015) A multi-agent optimization algorithm for resource constrained project scheduling problem. Expert Syst Appl 42(15\u201316):6039\u20136049","journal-title":"Expert Syst Appl"},{"issue":"3","key":"3410_CR34","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","journal-title":"Eur J Oper Res"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-018-3410-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-018-3410-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-018-3410-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,29]],"date-time":"2019-07-29T19:24:05Z","timestamp":1564428245000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-018-3410-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,30]]},"references-count":33,"journal-issue":{"issue":"17","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["3410"],"URL":"https:\/\/doi.org\/10.1007\/s00500-018-3410-8","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2018,7,30]]},"assertion":[{"value":"30 July 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"We declare that we have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Human and animal rights"}}]}}