{"id":"https://openalex.org/W2165479406","doi":"https://doi.org/10.1109/cec.2009.4983168","title":"Improved crossover and mutation operators for Genetic-Algorithm project scheduling","display_name":"Improved crossover and mutation operators for Genetic-Algorithm project scheduling","publication_year":2009,"publication_date":"2009-05-01","ids":{"openalex":"https://openalex.org/W2165479406","doi":"https://doi.org/10.1109/cec.2009.4983168","mag":"2165479406"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2009.4983168","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2009.4983168","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE Congress on Evolutionary Computation","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/A5088638819","display_name":"M. A. Abido","orcid":"https://orcid.org/0000-0001-5292-6938"},"institutions":[{"id":"https://openalex.org/I134085113","display_name":"King Fahd University of Petroleum and Minerals","ror":"https://ror.org/03yez3163","country_code":"SA","type":"education","lineage":["https://openalex.org/I134085113"]}],"countries":["SA"],"is_corresponding":true,"raw_author_name":"M. A. Abido","raw_affiliation_strings":["King Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabia"],"affiliations":[{"raw_affiliation_string":"King Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabia","institution_ids":["https://openalex.org/I134085113"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054707421","display_name":"Ashraf Elazouni","orcid":"https://orcid.org/0000-0003-0641-9921"},"institutions":[{"id":"https://openalex.org/I134085113","display_name":"King Fahd University of Petroleum and Minerals","ror":"https://ror.org/03yez3163","country_code":"SA","type":"education","lineage":["https://openalex.org/I134085113"]}],"countries":["SA"],"is_corresponding":false,"raw_author_name":"A. Elazouni","raw_affiliation_strings":["King Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabia"],"affiliations":[{"raw_affiliation_string":"King Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabia","institution_ids":["https://openalex.org/I134085113"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5088638819"],"corresponding_institution_ids":["https://openalex.org/I134085113"],"apc_list":null,"apc_paid":null,"fwci":0.8034,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.78466598,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1865","last_page":"1872"},"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.9954000115394592,"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/T11006","display_name":"BIM and Construction Integration","score":0.949999988079071,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.9463372230529785},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5898091197013855},{"id":"https://openalex.org/keywords/chromosome","display_name":"Chromosome","score":0.5453341603279114},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.5247880816459656},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.5245806574821472},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49999570846557617},{"id":"https://openalex.org/keywords/mutation","display_name":"Mutation","score":0.4895823895931244},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.47573328018188477},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.463326632976532},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4425743818283081},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2820117473602295},{"id":"https://openalex.org/keywords/genetics","display_name":"Genetics","score":0.18586578965187073},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.18156003952026367},{"id":"https://openalex.org/keywords/biology","display_name":"Biology","score":0.12417614459991455},{"id":"https://openalex.org/keywords/gene","display_name":"Gene","score":0.11282795667648315}],"concepts":[{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.9463372230529785},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5898091197013855},{"id":"https://openalex.org/C30481170","wikidata":"https://www.wikidata.org/wiki/Q37748","display_name":"Chromosome","level":3,"score":0.5453341603279114},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.5247880816459656},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.5245806574821472},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49999570846557617},{"id":"https://openalex.org/C501734568","wikidata":"https://www.wikidata.org/wiki/Q42918","display_name":"Mutation","level":3,"score":0.4895823895931244},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.47573328018188477},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.463326632976532},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4425743818283081},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2820117473602295},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.18586578965187073},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18156003952026367},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.12417614459991455},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.11282795667648315},{"id":"https://openalex.org/C86339819","wikidata":"https://www.wikidata.org/wiki/Q407384","display_name":"Transcription factor","level":3,"score":0.0},{"id":"https://openalex.org/C158448853","wikidata":"https://www.wikidata.org/wiki/Q425218","display_name":"Repressor","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2009.4983168","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2009.4983168","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE Congress on Evolutionary Computation","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":20,"referenced_works":["https://openalex.org/W1588020177","https://openalex.org/W1836977276","https://openalex.org/W1984858738","https://openalex.org/W2022800532","https://openalex.org/W2027818944","https://openalex.org/W2051235345","https://openalex.org/W2057006832","https://openalex.org/W2071555327","https://openalex.org/W2073078180","https://openalex.org/W2083150960","https://openalex.org/W2089306248","https://openalex.org/W2095256715","https://openalex.org/W2131775716","https://openalex.org/W2154168058","https://openalex.org/W2158814833","https://openalex.org/W2168079536","https://openalex.org/W4233050449","https://openalex.org/W4249208652","https://openalex.org/W4285719527","https://openalex.org/W6638652084"],"related_works":["https://openalex.org/W2371108399","https://openalex.org/W2525152177","https://openalex.org/W2979917306","https://openalex.org/W2369738212","https://openalex.org/W2383252209","https://openalex.org/W2152922390","https://openalex.org/W2381787154","https://openalex.org/W1617803207","https://openalex.org/W2014162767","https://openalex.org/W2367372043"],"abstract_inverted_index":{"In":[0],"Genetic":[1],"Algorithms":[2],"(GAs)":[3],"technique,":[4],"offspring":[5,53,67],"chromosomes":[6,13],"are":[7],"created":[8],"by":[9,111,120],"merging":[10],"two":[11],"parent":[12],"using":[14,23],"a":[15,24,79],"crossover":[16,40,59],"operator":[17],"or":[18],"modifying":[19],"an":[20],"existing":[21],"chromosome":[22],"mutation":[25,42,61],"operator.":[26],"However,":[27],"in":[28,31,51],"scheduling":[29],"problems":[30],"which":[32],"the":[33,39,48,52,73,91,96,113,116,121],"genes":[34],"represent":[35],"activities'":[36],"start":[37],"times,":[38],"and":[41,60,78,99],"operators":[43],"may":[44],"cause":[45],"violation":[46],"of":[47,90],"precedence":[49],"relationships":[50],"chromosomes.":[54,68],"This":[55],"paper":[56],"proposes":[57],"improved":[58],"algorithms":[62,71,93],"to":[63,94,102],"directly":[64],"devise":[65],"feasible":[66],"The":[69,85],"proposed":[70,92],"employed":[72],"traditional":[74],"Free":[75,82],"Float":[76,83],"(FF)":[77],"newly-introduced":[80],"Backward":[81],"(BFF).":[84],"obtained":[86,119],"results":[87,114],"exhibited":[88],"robustness":[89],"reduce":[95],"computational":[97],"costs,":[98],"high":[100],"effectiveness":[101],"search":[103],"for":[104],"optimal":[105],"solutions.":[106],"Moreover,":[107],"validation":[108],"was":[109],"performed":[110],"comparing":[112],"against":[115],"exact":[117],"solutions":[118],"Integer":[122],"Programming":[123],"(IP)":[124],"technique.":[125]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}