{"id":"https://openalex.org/W3010391816","doi":"https://doi.org/10.1109/cec.2015.7257231","title":"Memetic algorithm for solving resource constrained project scheduling problems","display_name":"Memetic algorithm for solving resource constrained project scheduling problems","publication_year":2015,"publication_date":"2015-05-01","ids":{"openalex":"https://openalex.org/W3010391816","doi":"https://doi.org/10.1109/cec.2015.7257231","mag":"3010391816"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2015.7257231","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2015.7257231","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5091228487","display_name":"Ismail Ali","orcid":"https://orcid.org/0000-0001-5925-1988"},"institutions":[{"id":"https://openalex.org/I188329596","display_name":"University of Canberra","ror":"https://ror.org/04s1nv328","country_code":"AU","type":"education","lineage":["https://openalex.org/I188329596"]},{"id":"https://openalex.org/I31746571","display_name":"UNSW Sydney","ror":"https://ror.org/03r8z3t63","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Ismail M. Ali","raw_affiliation_strings":["School of Engineering and Information Technology, University of New South Wales, Canberra, Australia"],"affiliations":[{"raw_affiliation_string":"School of Engineering and Information Technology, University of New South Wales, Canberra, Australia","institution_ids":["https://openalex.org/I188329596","https://openalex.org/I31746571"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063874940","display_name":"Saber Elsayed","orcid":"https://orcid.org/0000-0003-0836-6122"},"institutions":[{"id":"https://openalex.org/I188329596","display_name":"University of Canberra","ror":"https://ror.org/04s1nv328","country_code":"AU","type":"education","lineage":["https://openalex.org/I188329596"]},{"id":"https://openalex.org/I31746571","display_name":"UNSW Sydney","ror":"https://ror.org/03r8z3t63","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Saber M. Elsayed","raw_affiliation_strings":["School of Engineering and Information Technology, University of New South Wales, Canberra, Australia"],"affiliations":[{"raw_affiliation_string":"School of Engineering and Information Technology, University of New South Wales, Canberra, Australia","institution_ids":["https://openalex.org/I188329596","https://openalex.org/I31746571"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061883146","display_name":"Tapabrata Ray","orcid":"https://orcid.org/0000-0003-1950-5917"},"institutions":[{"id":"https://openalex.org/I31746571","display_name":"UNSW Sydney","ror":"https://ror.org/03r8z3t63","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571"]},{"id":"https://openalex.org/I188329596","display_name":"University of Canberra","ror":"https://ror.org/04s1nv328","country_code":"AU","type":"education","lineage":["https://openalex.org/I188329596"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Tapabrata Ray","raw_affiliation_strings":["School of Engineering and Information Technology, University of New South Wales, Canberra, Australia"],"affiliations":[{"raw_affiliation_string":"School of Engineering and Information Technology, University of New South Wales, Canberra, Australia","institution_ids":["https://openalex.org/I188329596","https://openalex.org/I31746571"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027440671","display_name":"Ruhul Sarker","orcid":"https://orcid.org/0000-0002-1363-2774"},"institutions":[{"id":"https://openalex.org/I31746571","display_name":"UNSW Sydney","ror":"https://ror.org/03r8z3t63","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571"]},{"id":"https://openalex.org/I188329596","display_name":"University of Canberra","ror":"https://ror.org/04s1nv328","country_code":"AU","type":"education","lineage":["https://openalex.org/I188329596"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Ruhul A. Sarker","raw_affiliation_strings":["School of Engineering and Information Technology, University of New South Wales, Canberra, Australia"],"affiliations":[{"raw_affiliation_string":"School of Engineering and Information Technology, University of New South Wales, Canberra, Australia","institution_ids":["https://openalex.org/I188329596","https://openalex.org/I31746571"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5091228487"],"corresponding_institution_ids":["https://openalex.org/I188329596","https://openalex.org/I31746571"],"apc_list":null,"apc_paid":null,"fwci":0.8243,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.81328541,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"14","issue":null,"first_page":"2761","last_page":"2767"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9728999733924866,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.961899995803833,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/memetic-algorithm","display_name":"Memetic algorithm","score":0.8522640466690063},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.669442892074585},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6579372882843018},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6550889015197754},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5823154449462891},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.48345884680747986},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4723176658153534},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.4433360993862152},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44049936532974243},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.43522652983665466},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2037350833415985},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.1988644003868103}],"concepts":[{"id":"https://openalex.org/C35129592","wikidata":"https://www.wikidata.org/wiki/Q324793","display_name":"Memetic algorithm","level":3,"score":0.8522640466690063},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.669442892074585},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6579372882843018},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6550889015197754},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5823154449462891},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.48345884680747986},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4723176658153534},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4433360993862152},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44049936532974243},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.43522652983665466},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2037350833415985},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.1988644003868103},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2015.7257231","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2015.7257231","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1486954203","https://openalex.org/W1600578512","https://openalex.org/W1881737530","https://openalex.org/W1992710140","https://openalex.org/W2000303145","https://openalex.org/W2021818509","https://openalex.org/W2024237395","https://openalex.org/W2026722797","https://openalex.org/W2027115943","https://openalex.org/W2035573831","https://openalex.org/W2079264914","https://openalex.org/W2120810386","https://openalex.org/W2138543065","https://openalex.org/W2140742285","https://openalex.org/W2152999180","https://openalex.org/W2155654644","https://openalex.org/W2158814833","https://openalex.org/W2172293207","https://openalex.org/W2357062781","https://openalex.org/W4241218308","https://openalex.org/W4249208652","https://openalex.org/W6670370343"],"related_works":["https://openalex.org/W2123894366","https://openalex.org/W3055530241","https://openalex.org/W2951031123","https://openalex.org/W2557579410","https://openalex.org/W2768478912","https://openalex.org/W2060225873","https://openalex.org/W2771484548","https://openalex.org/W2031081351","https://openalex.org/W1546619859","https://openalex.org/W2014867304"],"abstract_inverted_index":{"Resource":[0],"constrained":[1],"project":[2],"scheduling":[3],"problem":[4],"(RCPSP)":[5],"is":[6,40,55],"considered":[7],"to":[8,27],"be":[9],"an":[10],"NP":[11],"hard":[12],"problem.":[13],"Over":[14],"the":[15,75,78,99],"last":[16],"few":[17],"decades,":[18],"many":[19],"different":[20],"approaches":[21],"have":[22,82],"been":[23],"developed":[24],"in":[25,42],"order":[26],"solve":[28],"RCPSPs":[29],"optimally":[30],"within":[31],"a":[32,52,68,122],"reasonable":[33],"time":[34,105],"limit.":[35],"However,":[36],"no":[37],"existing":[38],"approach":[39],"well-accepted":[41],"this":[43,46],"regard.":[44],"In":[45],"paper,":[47],"for":[48],"efficiently":[49],"solving":[50],"RCPSPs,":[51],"memetic":[53],"algorithm":[54,59,116],"proposed.":[56],"The":[57,110],"proposed":[58,79,115],"incorporates":[60],"local":[61],"search":[62],"techniques":[63],"and":[64,91,97,103],"adaptive":[65],"mutation":[66],"with":[67,88,94,106,121],"carefully":[69],"designed":[70],"genetic":[71],"algorithm.":[72],"To":[73],"judge":[74],"performance":[76],"of":[77,101],"algorithm,":[80],"we":[81],"solved":[83],"31":[84],"benchmark":[85],"problems":[86,93],"(16":[87],"30":[89],"activities,":[90],"15":[92],"60":[95],"activities),":[96],"compared":[98],"quality":[100,119],"solutions":[102,120],"computational":[104,125],"other":[107],"state-of-the-art":[108],"algorithms.":[109],"results":[111],"show":[112],"that":[113],"our":[114],"achieved":[117],"good":[118],"significantly":[123],"lower":[124],"time.":[126]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-24T08:23:43.765630","created_date":"2025-10-10T00:00:00"}