{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,5]],"date-time":"2026-04-05T10:21:57Z","timestamp":1775384517631,"version":"3.50.1"},"reference-count":57,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T00:00:00Z","timestamp":1533081600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T00:00:00Z","timestamp":1533081600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T00:00:00Z","timestamp":1533081600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T00:00:00Z","timestamp":1533081600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T00:00:00Z","timestamp":1533081600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T00:00:00Z","timestamp":1533081600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T00:00:00Z","timestamp":1533081600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"name":"Innovate UK project HARNET","award":["100004607"],"award-info":[{"award-number":["100004607"]}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Soft Computing"],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1016\/j.asoc.2018.04.047","type":"journal-article","created":{"date-parts":[[2018,5,3]],"date-time":"2018-05-03T21:40:02Z","timestamp":1525383602000},"page":"493-503","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":36,"special_numbering":"C","title":["Improved discrete cuckoo search for the resource-constrained project scheduling problem"],"prefix":"10.1016","volume":"69","author":[{"given":"Kirils","family":"Bibiks","sequence":"first","affiliation":[]},{"given":"Yim-Fun","family":"Hu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0974-8149","authenticated-orcid":false,"given":"Jian-Ping","family":"Li","sequence":"additional","affiliation":[]},{"given":"Prashant","family":"Pillai","sequence":"additional","affiliation":[]},{"given":"Aleister","family":"Smith","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.asoc.2018.04.047_bib0005","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1016\/j.ejor.2017.03.006","article-title":"A hybrid metaheuristic for resource-constrained project scheduling with flexible resource profiles","volume":"262","author":"Tritschler","year":"2017","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"10.1016\/j.asoc.2018.04.047_bib0010","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2009.11.005","article-title":"A survey of variants and extensions of the resource-constrained project scheduling problem","volume":"207","author":"Hartmann","year":"2010","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"10.1016\/j.asoc.2018.04.047_bib0015","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1016\/j.trb.2006.05.003","article-title":"Single-track train timetabling with guaranteed optimality: branch-and-bound algorithms with enhanced lower bounds","volume":"41","author":"Zhou","year":"2007","journal-title":"Transp. Res. Part B Methodol."},{"issue":"5","key":"10.1016\/j.asoc.2018.04.047_bib0020","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1287\/inte.1040.0067","article-title":"General motors optimizes its scheduling of cold-weather tests","volume":"34","author":"Hsu","year":"2004","journal-title":"Interfaces"},{"issue":"1","key":"10.1016\/j.asoc.2018.04.047_bib0025","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0166-218X(83)90012-4","article-title":"Scheduling subject to resource constraints: classification and complexity","volume":"5","author":"Blazewicz","year":"1983","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.asoc.2018.04.047_bib0030","series-title":"Fifth International Conference on Fuzzy Systems and Knowledge Discovery","article-title":"NP-Hard problems of learning from examples","author":"Chen","year":"2008"},{"issue":"3","key":"10.1016\/j.asoc.2018.04.047_bib0035","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/S0305-0483(00)00046-3","article-title":"An integrated survey of deterministic project scheduling","volume":"29","author":"Kolisch","year":"2001","journal-title":"Omega"},{"issue":"4","key":"10.1016\/j.asoc.2018.04.047_bib0040","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/S0305-0548(97)00055-5","article-title":"Resource-constrained project scheduling: a survey of recent developments","volume":"25","author":"Herroelen","year":"1998","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.asoc.2018.04.047_bib0045","series-title":"Project Scheduling: Recent Models, Algorithms and Applications","first-page":"147","article-title":"Heuristic algorithms for the resource-Constrained project scheduling problem: classification and computational analysis","author":"Kolisch","year":"1999"},{"issue":"1","key":"10.1016\/j.asoc.2018.04.047_bib0050","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1023\/A:1010997814183","article-title":"A competitive heuristic solution technique for resource-constrained project scheduling","volume":"102","author":"Tormos","year":"2001","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"10.1016\/j.asoc.2018.04.047_bib0055","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0377-2217(96)00170-1","article-title":"PSPLIB \u2013 a project scheduling problem library","volume":"96","author":"Kolisch","year":"1997","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"10.1016\/j.asoc.2018.04.047_bib0060","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/S0377-2217(97)00335-4","article-title":"A branch and bound algorithm for the resource-constrained project scheduling problem","volume":"107","author":"Brucker","year":"1998","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"10.1016\/j.asoc.2018.04.047_bib0065","doi-asserted-by":"crossref","first-page":"714","DOI":"10.1287\/mnsc.44.5.714","article-title":"An exact algorithm for the resource constrained project scheduling problem based on a new mathematical formulation","volume":"44","author":"Mingozzi","year":"1998","journal-title":"Manage. Sci."},{"issue":"5","key":"10.1016\/j.asoc.2018.04.047_bib0070","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1287\/mnsc.46.5.710.12044","article-title":"Scheduling resource-constrained projects competitively at modest memory requirements","volume":"46","author":"Sprecher","year":"2000","journal-title":"Manage. Sci."},{"issue":"12","key":"10.1016\/j.asoc.2018.04.047_bib0075","doi-asserted-by":"crossref","first-page":"1803","DOI":"10.1287\/mnsc.38.12.1803","article-title":"A branch-and-Bound procedure for the multiple resource-constrained project scheduling problem","volume":"38","author":"Demeulemeester","year":"1992","journal-title":"Manage. Sci."},{"issue":"1","key":"10.1016\/j.asoc.2018.04.047_bib0080","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1023\/A:1010949931021","article-title":"A robust genetic algorithm for resource allocation in project scheduling","volume":"102","author":"Alcaraz","year":"2001","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"10.1016\/j.asoc.2018.04.047_bib0085","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1109\/TEVC.2002.802450","article-title":"Ant colony optimization for resource-constrained project scheduling","volume":"6","author":"Merkle","year":"2002","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"10.1016\/j.asoc.2018.04.047_bib0090","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1016\/S0377-2217(02)00761-0","article-title":"A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version","volume":"149","author":"Bouleimen","year":"2003","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"10.1016\/j.asoc.2018.04.047_bib0095","doi-asserted-by":"crossref","first-page":"3720","DOI":"10.1016\/j.asoc.2011.02.002","article-title":"On the performance of bee algorithms for resource-constrained project scheduling problem","volume":"11","author":"Ziarati","year":"2011","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2018.04.047_bib0100","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.asoc.2017.10.014","article-title":"Hybrid differential evolution and greedy algorithm (DEGR) for solving multi-Skill resource-constrained project scheduling problem","volume":"62","author":"Myszkowski","year":"2018","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2018.04.047_bib0105","series-title":"AISB Workshop on Evolutionary Computing","first-page":"50","article-title":"Two applications of genetic algorithms to component design","author":"Husbands","year":"1996"},{"issue":"7","key":"10.1016\/j.asoc.2018.04.047_bib0110","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1002\/(SICI)1520-6750(199810)45:7<733::AID-NAV5>3.0.CO;2-C","article-title":"A competitive genetic algorithm for resource-constrained project scheduling","volume":"45","author":"Hartmann","year":"1998","journal-title":"Nav. Res. Logist."},{"issue":"5","key":"10.1016\/j.asoc.2018.04.047_bib0115","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1002\/nav.10029","article-title":"A self-adapting genetic algorithm for project scheduling under resource constraints","volume":"49","author":"Hartmann","year":"2002","journal-title":"Nav. Res. Logist."},{"issue":"8","key":"10.1016\/j.asoc.2018.04.047_bib0120","doi-asserted-by":"crossref","first-page":"2335","DOI":"10.1080\/00207549608905028","article-title":"Resource-constrained project scheduling by simulated annealing","volume":"34","author":"Boctor","year":"1996","journal-title":"Int. J. Prod. Res."},{"issue":"1","key":"10.1016\/j.asoc.2018.04.047_bib0125","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1023\/B:ANOR.0000039521.26237.62","article-title":"LSSPER: solving the resource-constrained project scheduling problem with large neighbourhood search","volume":"131","author":"Palpant","year":"2004","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/j.asoc.2018.04.047_bib0130","series-title":"Proceedings of the 3rd International Workshop of Computer Science and Information Technologies","article-title":"Evolutionary local search with variable neighborhood for the resource constrained project scheduling problem","author":"Kochetov","year":"2003"},{"issue":"2","key":"10.1016\/j.asoc.2018.04.047_bib0135","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/j.ejor.2004.04.008","article-title":"Justification and RCPSP: A technique that pays","volume":"165","author":"Valls","year":"2005","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.asoc.2018.04.047_bib0140","series-title":"The Eighth International Workshop on Project Management and Scheduling","article-title":"A hybrid genetic algorithm for the RCPSP with the peak crossover operator","author":"Valls","year":"2002"},{"issue":"1","key":"10.1016\/j.asoc.2018.04.047_bib0145","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.ejor.2005.01.065","article-title":"Experimental investigation of heuristics for resource-constrained project scheduling: an update","volume":"174","author":"Kolisch","year":"2006","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"10.1016\/j.asoc.2018.04.047_bib0150","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1016\/S0377-2217(99)00485-3","article-title":"Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling","volume":"127","author":"Hartmann","year":"2000","journal-title":"Eur. J. Oper. Res."},{"issue":"10","key":"10.1016\/j.asoc.2018.04.047_bib0155","doi-asserted-by":"crossref","first-page":"1693","DOI":"10.1287\/mnsc.41.10.1693","article-title":"Characterization and generation of a general class of resource-constrained project scheduling problems","volume":"41","author":"Kolisch","year":"1995","journal-title":"Manage. Sci."},{"key":"10.1016\/j.asoc.2018.04.047_bib0160","series-title":"World Congress on Nature & Biologically Inspired Computing","article-title":"Cuckoo search via L\u00e9vy flights","author":"Yang","year":"2009"},{"issue":"4","key":"10.1016\/j.asoc.2018.04.047_bib0165","first-page":"330","article-title":"Engineering optimisation by cuckoo search","volume":"1","author":"Yang","year":"2010","journal-title":"International J. Math. Modell. Numer. Optim."},{"issue":"6","key":"10.1016\/j.asoc.2018.04.047_bib0170","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1016\/j.ijepes.2015.12.030","article-title":"A novel method based on adaptive cuckoo search for optimal network reconfiguration and distributed generation allocation in distribution network","volume":"78","author":"Nguyen","year":"2016","journal-title":"Int. J. Electr. Power Energy Syst."},{"issue":"6","key":"10.1016\/j.asoc.2018.04.047_bib0175","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1016\/j.ins.2015.11.036","article-title":"Enhanced intelligent water drops and cuckoo search algorithms for solving the capacitated vehicle routing problem","volume":"334","author":"Teymourian","year":"2016","journal-title":"Inf. Sci."},{"issue":"2","key":"10.1016\/j.asoc.2018.04.047_bib0180","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/j.ijepes.2015.09.018","article-title":"An enhanced cuckoo search algorithm based contingency constrained economic load dispatch for security enhancement","volume":"75","author":"Sekhar","year":"2016","journal-title":"Int. J. Electr. Power Energy Syst."},{"issue":"2","key":"10.1016\/j.asoc.2018.04.047_bib0185","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.ijepes.2015.08.018","article-title":"Optimal power system stabilizers design via cuckoo search algorithm","volume":"75","author":"Elazim","year":"2016","journal-title":"Int. J. Electr. Power Energy Syst."},{"issue":"7","key":"10.1016\/j.asoc.2018.04.047_bib0190","first-page":"1659","article-title":"Discrete cuckoo search algorithm for the travelling salesman problem","volume":"24","author":"Ouaarab","year":"2013","journal-title":"Neural Comput. Appl."},{"key":"10.1016\/j.asoc.2018.04.047_bib0195","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/j.asoc.2017.01.024","article-title":"Multi-skilled project scheduling with level-dependent rework risk: three multi-objective mechanisms based on cuckoo search","volume":"54","author":"Maghsoudlou","year":"2017","journal-title":"Appl. Soft Comput."},{"issue":"2","key":"10.1016\/j.asoc.2018.04.047_bib0200","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1109\/TEVC.2013.2256427","article-title":"Comparison study of swarm intelligence techniques for the annual crop planning problem","volume":"18","author":"Chetty","year":"2013","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.asoc.2018.04.047_bib0205","series-title":"IEEE Computational Science and Engineering Conference","article-title":"Discrete cuckoo search for resource-constrained project scheduling problem","author":"Bibiks","year":"2015"},{"key":"10.1016\/j.asoc.2018.04.047_bib0210","series-title":"IEEE International Conference on Systems, Man and Cybernetics","article-title":"Business process assignment optimization","author":"Zhou","year":"2002"},{"key":"10.1016\/j.asoc.2018.04.047_bib0215","series-title":"Handbook on Recent Advances in Project Scheduling","author":"Kolisch","year":"1999"},{"issue":"2","key":"10.1016\/j.asoc.2018.04.047_bib0220","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1051\/ro:2008010","article-title":"New representation to reduce the search space for the resource-constrained project scheduling problem","volume":"42","author":"Moumene","year":"2008","journal-title":"RAIRO Oper. Res."},{"issue":"4","key":"10.1016\/j.asoc.2018.04.047_bib0225","doi-asserted-by":"crossref","first-page":"3983","DOI":"10.1016\/j.eswa.2011.09.062","article-title":"Solving project scheduling problems with resource constraints via an event list-based evolutionary algorithm","volume":"39","author":"Paraskevopoulos","year":"2012","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.asoc.2018.04.047_bib0230","series-title":"Prroceedings of Fifth EUROMECH Nonlinear Dynamics Conference","author":"Leccardi","year":"2005"},{"key":"10.1016\/j.asoc.2018.04.047_bib0235","doi-asserted-by":"crossref","first-page":"4677","DOI":"10.1103\/PhysRevE.49.4677","article-title":"Fast: accurate algorithm for numerical simulation of L\u00e9vy stable stochastic processes","volume":"49","author":"Mantegna","year":"1994","journal-title":"Phys. Rev. E"},{"key":"10.1016\/j.asoc.2018.04.047_bib0240","series-title":"Cuckoo Search and Firefly Algorithm: Theory and Applications","author":"Yang","year":"2013"},{"issue":"1","key":"10.1016\/j.asoc.2018.04.047_bib0245","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/0377-2217(93)E0294-8","article-title":"Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem","volume":"80","author":"Sprecher","year":"1995","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"10.1016\/j.asoc.2018.04.047_bib0250","doi-asserted-by":"crossref","first-page":"1031","DOI":"10.1016\/j.ins.2009.11.044","article-title":"An efficient hybrid algorithm for resource-constrained project scheduling","volume":"180","author":"Chen","year":"2010","journal-title":"Inf. Sci. Int. J."},{"issue":"3","key":"10.1016\/j.asoc.2018.04.047_bib0255","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1287\/opre.1060.0358","article-title":"A decomposition-based genetic algorithm for the resource-constrained project-scheduling problem","volume":"55","author":"Debels","year":"2005","journal-title":"Oper. Res."},{"issue":"2","key":"10.1016\/j.asoc.2018.04.047_bib0260","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1016\/j.ejor.2004.08.020","article-title":"A hybrid scatter search\/electromagnetism meta-heuristic for project scheduling","volume":"169","author":"Debels","year":"2006","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.asoc.2018.04.047_bib0265","doi-asserted-by":"crossref","first-page":"1071","DOI":"10.1080\/0020754021000033904","article-title":"An efficient multi-pass heuristic for project scheduling with constrained resources","volume":"41","author":"Tormos","year":"2003","journal-title":"J. Prod. Res."},{"issue":"2","key":"10.1016\/j.asoc.2018.04.047_bib0270","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1016\/j.ejor.2005.06.014","article-title":"A hybrid metaheuristic for the resource-constrained project scheduling problem","volume":"175","author":"Tseng","year":"2006","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.asoc.2018.04.047_bib0275","series-title":"Essays and Surveys in Metaheuristics","first-page":"557","article-title":"Formulation and tabu search algorithm for the resource constrained project scheduling problem","author":"Nonobe","year":"2002"},{"issue":"2","key":"10.1016\/j.asoc.2018.04.047_bib0280","doi-asserted-by":"crossref","first-page":"1830","DOI":"10.1016\/j.jcp.2007.06.008","article-title":"L\u00e9vy flights, non-local search and simulated annealing","volume":"226","author":"Pavlyukevich","year":"2007","journal-title":"J. Comput. Phys."},{"issue":"3","key":"10.1016\/j.asoc.2018.04.047_bib0285","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/j.plrev.2008.03.002","article-title":"L\u00e9vy flights and superdiffusion in the context of biological encounters and random searches","volume":"5","author":"Viswanathan","year":"2008","journal-title":"Phys. Life Rev."}],"container-title":["Applied Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494618302382?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494618302382?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T03:46:05Z","timestamp":1751600765000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1568494618302382"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8]]},"references-count":57,"alternative-id":["S1568494618302382"],"URL":"https:\/\/doi.org\/10.1016\/j.asoc.2018.04.047","relation":{},"ISSN":["1568-4946"],"issn-type":[{"value":"1568-4946","type":"print"}],"subject":[],"published":{"date-parts":[[2018,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Improved discrete cuckoo search for the resource-constrained project scheduling problem","name":"articletitle","label":"Article Title"},{"value":"Applied Soft Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.asoc.2018.04.047","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Crown Copyright \u00a9 2018 Published by Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}