{"id":"https://openalex.org/W2623314515","doi":"https://doi.org/10.1134/s0005117917060108","title":"Genetic algorithm for the resource-constrained project scheduling problem","display_name":"Genetic algorithm for the resource-constrained project scheduling problem","publication_year":2017,"publication_date":"2017-06-01","ids":{"openalex":"https://openalex.org/W2623314515","doi":"https://doi.org/10.1134/s0005117917060108","mag":"2623314515"},"language":"en","primary_location":{"id":"doi:10.1134/s0005117917060108","is_oa":false,"landing_page_url":"https://doi.org/10.1134/s0005117917060108","pdf_url":null,"source":{"id":"https://openalex.org/S134188425","display_name":"Automation and Remote Control","issn_l":"0005-1179","issn":["0005-1179","1608-3032"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320267","host_organization_name":"Pleiades Publishing","host_organization_lineage":["https://openalex.org/P4310320267","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Pleiades Publishing","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Automation and Remote Control","raw_type":"journal-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/A5091512211","display_name":"\u0415. \u041d. \u0413\u043e\u043d\u0447\u0430\u0440\u043e\u0432","orcid":"https://orcid.org/0000-0001-6843-8971"},"institutions":[{"id":"https://openalex.org/I188973947","display_name":"Novosibirsk State University","ror":"https://ror.org/04t2ss102","country_code":"RU","type":"education","lineage":["https://openalex.org/I188973947"]},{"id":"https://openalex.org/I1313323035","display_name":"Russian Academy of Sciences","ror":"https://ror.org/05qrfxd25","country_code":"RU","type":"government","lineage":["https://openalex.org/I1313323035"]},{"id":"https://openalex.org/I4210096862","display_name":"Sobolev Institute of Mathematics","ror":"https://ror.org/00shc0s02","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I1313323035","https://openalex.org/I4210096862","https://openalex.org/I4210124601","https://openalex.org/I4210127387"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"E. N. Goncharov","raw_affiliation_strings":["Novosibirsk State University, Novosibirsk, Russia","Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, Novosibirsk, Russia"],"affiliations":[{"raw_affiliation_string":"Novosibirsk State University, Novosibirsk, Russia","institution_ids":["https://openalex.org/I188973947"]},{"raw_affiliation_string":"Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, Novosibirsk, Russia","institution_ids":["https://openalex.org/I1313323035","https://openalex.org/I4210096862"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5104209735","display_name":"V.V. Leonov","orcid":null},"institutions":[{"id":"https://openalex.org/I4210096862","display_name":"Sobolev Institute of Mathematics","ror":"https://ror.org/00shc0s02","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I1313323035","https://openalex.org/I4210096862","https://openalex.org/I4210124601","https://openalex.org/I4210127387"]},{"id":"https://openalex.org/I1313323035","display_name":"Russian Academy of Sciences","ror":"https://ror.org/05qrfxd25","country_code":"RU","type":"government","lineage":["https://openalex.org/I1313323035"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"V. V. Leonov","raw_affiliation_strings":["Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, Novosibirsk, Russia"],"affiliations":[{"raw_affiliation_string":"Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, Novosibirsk, Russia","institution_ids":["https://openalex.org/I1313323035","https://openalex.org/I4210096862"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5091512211"],"corresponding_institution_ids":["https://openalex.org/I1313323035","https://openalex.org/I188973947","https://openalex.org/I4210096862"],"apc_list":null,"apc_paid":null,"fwci":3.8749,"has_fulltext":false,"cited_by_count":45,"citation_normalized_percentile":{"value":0.93507532,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"78","issue":"6","first_page":"1101","last_page":"1114"},"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.9925000071525574,"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.9726999998092651,"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.7525569200515747},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.6959078311920166},{"id":"https://openalex.org/keywords/critical-path-method","display_name":"Critical path method","score":0.5329234600067139},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.530279278755188},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.48467257618904114},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4736313223838806},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4724869132041931},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.4696566164493561},{"id":"https://openalex.org/keywords/resource-constraints","display_name":"Resource constraints","score":0.46125471591949463},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.42035534977912903},{"id":"https://openalex.org/keywords/genetic-algorithm-scheduling","display_name":"Genetic algorithm scheduling","score":0.414314866065979},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4137493968009949},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34675103425979614},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32469862699508667},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.31959861516952515},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.1400013267993927},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.12525635957717896},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.06967902183532715}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7525569200515747},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6959078311920166},{"id":"https://openalex.org/C115874739","wikidata":"https://www.wikidata.org/wiki/Q825377","display_name":"Critical path method","level":2,"score":0.5329234600067139},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.530279278755188},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.48467257618904114},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4736313223838806},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4724869132041931},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.4696566164493561},{"id":"https://openalex.org/C3017813396","wikidata":"https://www.wikidata.org/wiki/Q17078173","display_name":"Resource constraints","level":2,"score":0.46125471591949463},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.42035534977912903},{"id":"https://openalex.org/C159022435","wikidata":"https://www.wikidata.org/wiki/Q5532874","display_name":"Genetic algorithm scheduling","level":5,"score":0.414314866065979},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4137493968009949},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34675103425979614},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32469862699508667},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.31959861516952515},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.1400013267993927},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.12525635957717896},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.06967902183532715},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1134/s0005117917060108","is_oa":false,"landing_page_url":"https://doi.org/10.1134/s0005117917060108","pdf_url":null,"source":{"id":"https://openalex.org/S134188425","display_name":"Automation and Remote Control","issn_l":"0005-1179","issn":["0005-1179","1608-3032"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320267","host_organization_name":"Pleiades Publishing","host_organization_lineage":["https://openalex.org/P4310320267","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Pleiades Publishing","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Automation and Remote Control","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321079","display_name":"Russian Foundation for Basic Research","ror":"https://ror.org/02mh1ke95"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W189789383","https://openalex.org/W193608259","https://openalex.org/W620587418","https://openalex.org/W1969848548","https://openalex.org/W1973131489","https://openalex.org/W1987602810","https://openalex.org/W1992710140","https://openalex.org/W1999497806","https://openalex.org/W2000872583","https://openalex.org/W2007363252","https://openalex.org/W2024742034","https://openalex.org/W2034617747","https://openalex.org/W2038345112","https://openalex.org/W2052509829","https://openalex.org/W2054234206","https://openalex.org/W2054520435","https://openalex.org/W2057018686","https://openalex.org/W2062705997","https://openalex.org/W2062975634","https://openalex.org/W2067462952","https://openalex.org/W2067801697","https://openalex.org/W2070891082","https://openalex.org/W2075675164","https://openalex.org/W2106622621","https://openalex.org/W2120810386","https://openalex.org/W2138543065","https://openalex.org/W2140742285","https://openalex.org/W2148748601","https://openalex.org/W2158814833","https://openalex.org/W2171761463","https://openalex.org/W2225721151","https://openalex.org/W2336513509","https://openalex.org/W3122162113"],"related_works":["https://openalex.org/W1974309933","https://openalex.org/W4213379045","https://openalex.org/W3190401582","https://openalex.org/W2789293570","https://openalex.org/W4205832532","https://openalex.org/W2074319831","https://openalex.org/W1968952565","https://openalex.org/W4380905089","https://openalex.org/W2026959567","https://openalex.org/W2029136667"],"abstract_inverted_index":{"We":[0,27],"consider":[1],"the":[2,10,39,57,62,68,86,92,102,106,130,135,138],"resource-constrained":[3],"project":[4],"scheduling":[5],"problem":[6,15,73],"with":[7,24,32,74,83],"respect":[8],"to":[9],"makespan":[11],"minimization":[12],"criterion.":[13],"The":[14,48],"accounts":[16],"for":[17,61,113,122],"technological":[18],"constraints":[19],"of":[20,35,41,45,59,70,134],"activities":[21],"precedence":[22],"together":[23],"resource":[25],"constraints.":[26],"propose":[28],"a":[29,51,71,75],"genetic":[30],"algorithm":[31,94],"two":[33],"versions":[34],"crossovers":[36,49],"based":[37],"on":[38,77],"idea":[40],"most":[42],"rational":[43],"use":[44],"constrained":[46],"resources.":[47,79],"uses":[50],"heuristic":[52],"that":[53,91],"takes":[54],"into":[55],"account":[56],"degree":[58],"criticality":[60],"resources,":[63],"which":[64],"is":[65],"derived":[66],"from":[67,85,101,137],"solution":[69],"relaxed":[72],"constraint":[76],"accumulative":[78],"A":[80],"numerical":[81],"experiment":[82],"examples":[84,100],"PCPLIB":[87],"library":[88],"has":[89,95],"shown":[90],"proposed":[93],"competitive":[96],"quality.":[97],"For":[98],"some":[99],"j120":[103,123],"test":[104],"series":[105],"best":[107,131],"known":[108],"solutions":[109,136],"were":[110],"improved":[111],"and":[112,117,121],"j60":[114],"(50":[115],"000":[116,119,125],"500":[118],"iterations)":[120,126],"(500":[124],"we":[127],"have":[128],"obtain":[129],"average":[132],"deviations":[133],"critical":[139],"path":[140],"value.":[141]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":9},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}