{"id":"https://openalex.org/W4294975881","doi":"https://doi.org/10.1109/mmar55195.2022.9874286","title":"Genetic Algorithm for Resource Leveling Problems under Various Objective Functions","display_name":"Genetic Algorithm for Resource Leveling Problems under Various Objective Functions","publication_year":2022,"publication_date":"2022-08-22","ids":{"openalex":"https://openalex.org/W4294975881","doi":"https://doi.org/10.1109/mmar55195.2022.9874286"},"language":"en","primary_location":{"id":"doi:10.1109/mmar55195.2022.9874286","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mmar55195.2022.9874286","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 26th International Conference on Methods and Models in Automation and Robotics (MMAR)","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/A5045235706","display_name":"Grzegorz Walig\u00f3ra","orcid":"https://orcid.org/0000-0003-2108-1113"},"institutions":[{"id":"https://openalex.org/I46597724","display_name":"Pozna\u0144 University of Technology","ror":"https://ror.org/00p7p3302","country_code":"PL","type":"education","lineage":["https://openalex.org/I46597724"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Grzegorz Waligora","raw_affiliation_strings":["Institute of Computing Science Poznan University of Technology,Pozna&#x0144;,Poland"],"affiliations":[{"raw_affiliation_string":"Institute of Computing Science Poznan University of Technology,Pozna&#x0144;,Poland","institution_ids":["https://openalex.org/I46597724"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5045235706"],"corresponding_institution_ids":["https://openalex.org/I46597724"],"apc_list":null,"apc_paid":null,"fwci":0.6547,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.71709709,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.9934999942779541,"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.9531999826431274,"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/heuristics","display_name":"Heuristics","score":0.7114837169647217},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6660943031311035},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6639766693115234},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5978626608848572},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5681586861610413},{"id":"https://openalex.org/keywords/resource","display_name":"Resource (disambiguation)","score":0.5274396538734436},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4818105101585388},{"id":"https://openalex.org/keywords/resource-leveling","display_name":"Resource leveling","score":0.4475225508213043},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4466457962989807},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44628047943115234},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4211960732936859},{"id":"https://openalex.org/keywords/fitness-function","display_name":"Fitness function","score":0.4130077362060547},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"Resource allocation","score":0.3036959171295166},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18196076154708862},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.11707544326782227}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7114837169647217},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6660943031311035},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6639766693115234},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5978626608848572},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5681586861610413},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.5274396538734436},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4818105101585388},{"id":"https://openalex.org/C40797050","wikidata":"https://www.wikidata.org/wiki/Q7315828","display_name":"Resource leveling","level":3,"score":0.4475225508213043},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4466457962989807},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44628047943115234},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4211960732936859},{"id":"https://openalex.org/C176066374","wikidata":"https://www.wikidata.org/wiki/Q629118","display_name":"Fitness function","level":3,"score":0.4130077362060547},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.3036959171295166},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18196076154708862},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.11707544326782227},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"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/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/mmar55195.2022.9874286","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mmar55195.2022.9874286","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 26th International Conference on Methods and Models in Automation and Robotics (MMAR)","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":19,"referenced_works":["https://openalex.org/W1497256448","https://openalex.org/W1970475912","https://openalex.org/W1973131489","https://openalex.org/W1973770523","https://openalex.org/W1983545211","https://openalex.org/W2014349223","https://openalex.org/W2024742034","https://openalex.org/W2038345112","https://openalex.org/W2047568237","https://openalex.org/W2056140175","https://openalex.org/W2070537839","https://openalex.org/W2142183404","https://openalex.org/W2157002008","https://openalex.org/W2225721151","https://openalex.org/W2739887727","https://openalex.org/W3036690399","https://openalex.org/W3039021638","https://openalex.org/W3201218056","https://openalex.org/W4249208652"],"related_works":["https://openalex.org/W4323650391","https://openalex.org/W3050209628","https://openalex.org/W2957530701","https://openalex.org/W2135854070","https://openalex.org/W1489675356","https://openalex.org/W2323583079","https://openalex.org/W2364702800","https://openalex.org/W2008733948","https://openalex.org/W2111499695","https://openalex.org/W2160794106"],"abstract_inverted_index":{"In":[0,15],"this":[1,16,73],"paper":[2],"some":[3],"resource":[4,11,33,46],"leveling":[5],"problems":[6],"for":[7,61],"project":[8,21],"scheduling":[9],"under":[10],"constraints":[12,34],"are":[13,22,35,51,55,64],"considered.":[14],"problem":[17,63],"activities":[18],"of":[19,45,79,93,101],"a":[20,27,38,91,94,99],"to":[23,71,86],"be":[24],"scheduled":[25],"in":[26],"way":[28],"that":[29],"all":[30],"precedence":[31],"and":[32,37,53,84],"satisfied,":[36],"given":[39],"objective":[40,59],"function":[41],"describing":[42],"the":[43,62,80],"fluctuations":[44],"usage":[47],"is":[48,69,82],"minimized.":[49],"Activities":[50],"nonpreemptable,":[52],"resources":[54],"renewable.":[56],"Several":[57],"various":[58],"functions":[60],"analyzed.":[65],"A":[66],"genetic":[67],"algorithm":[68,81],"proposed":[70],"solve":[72],"strongly":[74],"NP-hard":[75],"problem.":[76],"The":[77],"performance":[78],"examined":[83],"compared":[85],"other":[87],"simple":[88],"heuristics":[89],"on":[90,98],"basis":[92],"computational":[95],"experiment":[96],"performed":[97],"set":[100],"standard":[102],"benchmark":[103],"instances.":[104]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
