{"id":"https://openalex.org/W4312201581","doi":"https://doi.org/10.3390/a16010015","title":"Improvement of Ant Colony Algorithm Performance for the Job-Shop Scheduling Problem Using Evolutionary Adaptation and Software Realization Heuristics","display_name":"Improvement of Ant Colony Algorithm Performance for the Job-Shop Scheduling Problem Using Evolutionary Adaptation and Software Realization Heuristics","publication_year":2022,"publication_date":"2022-12-26","ids":{"openalex":"https://openalex.org/W4312201581","doi":"https://doi.org/10.3390/a16010015"},"language":"en","primary_location":{"id":"doi:10.3390/a16010015","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a16010015","pdf_url":null,"source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.3390/a16010015","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5010505634","display_name":"\u041f\u0430\u0432\u0435\u043b \u041c\u0430\u0442\u0440\u0435\u043d\u0438\u043d","orcid":"https://orcid.org/0000-0001-5704-0976"},"institutions":[{"id":"https://openalex.org/I130823665","display_name":"Ural Federal University","ror":"https://ror.org/00hs7dr46","country_code":"RU","type":"education","lineage":["https://openalex.org/I130823665"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Pavel V. Matrenin","raw_affiliation_strings":["Ural Power Engineering Institute, Ural Federal University named after the first President of Russia B.N. Yeltsin, 620002 Ekaterinburg, Russia"],"affiliations":[{"raw_affiliation_string":"Ural Power Engineering Institute, Ural Federal University named after the first President of Russia B.N. Yeltsin, 620002 Ekaterinburg, Russia","institution_ids":["https://openalex.org/I130823665"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5010505634"],"corresponding_institution_ids":["https://openalex.org/I130823665"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":2.4346,"has_fulltext":true,"cited_by_count":19,"citation_normalized_percentile":{"value":0.89753781,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":97,"max":99},"biblio":{"volume":"16","issue":"1","first_page":"15","last_page":"15"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9997000098228455,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9970999956130981,"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/T12782","display_name":"Assembly Line Balancing Optimization","score":0.9909999966621399,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.7634648084640503},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7269341349601746},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.6458950042724609},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.587672770023346},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.4992539882659912},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.4968102276325226},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.45263564586639404},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.4294532239437103},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.42104077339172363},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.4116951525211334},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2914848327636719},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14714539051055908}],"concepts":[{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.7634648084640503},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7269341349601746},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6458950042724609},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.587672770023346},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.4992539882659912},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.4968102276325226},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.45263564586639404},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.4294532239437103},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.42104077339172363},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.4116951525211334},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2914848327636719},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14714539051055908},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"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/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.3390/a16010015","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a16010015","pdf_url":null,"source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:elar.urfu.ru:10995/130914","is_oa":true,"landing_page_url":"http://elar.urfu.ru/handle/10995/130914","pdf_url":"https://elar.urfu.ru/bitstream/10995/130914/1/2-s2.0-85146727253.pdf","source":{"id":"https://openalex.org/S4306401522","display_name":"Electronic scientific archive of UrFU (Ural Federal University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I130823665","host_organization_name":"Ural Federal University","host_organization_lineage":["https://openalex.org/I130823665"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms","raw_type":"|info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:doaj.org/article:4101154d7b6743a3b9bf6467b8cbb69a","is_oa":true,"landing_page_url":"https://doaj.org/article/4101154d7b6743a3b9bf6467b8cbb69a","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 16, Iss 1, p 15 (2022)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/16/1/15/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a16010015","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms; Volume 16; Issue 1; Pages: 15","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a16010015","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a16010015","pdf_url":null,"source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.5299999713897705,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":54,"referenced_works":["https://openalex.org/W1498362757","https://openalex.org/W1551399787","https://openalex.org/W1843953315","https://openalex.org/W1855741192","https://openalex.org/W1964373220","https://openalex.org/W1969953660","https://openalex.org/W1979164496","https://openalex.org/W1986967821","https://openalex.org/W1989908347","https://openalex.org/W2014366273","https://openalex.org/W2019595142","https://openalex.org/W2021040818","https://openalex.org/W2024085737","https://openalex.org/W2035292227","https://openalex.org/W2041252124","https://openalex.org/W2049967755","https://openalex.org/W2059566833","https://openalex.org/W2071315752","https://openalex.org/W2074337226","https://openalex.org/W2088304441","https://openalex.org/W2089907543","https://openalex.org/W2117517754","https://openalex.org/W2118573797","https://openalex.org/W2151554678","https://openalex.org/W2170428215","https://openalex.org/W2236499470","https://openalex.org/W2305203104","https://openalex.org/W2581743933","https://openalex.org/W2752418289","https://openalex.org/W2763934033","https://openalex.org/W2888421223","https://openalex.org/W2900715471","https://openalex.org/W2952808052","https://openalex.org/W2984895259","https://openalex.org/W3003077338","https://openalex.org/W3021058566","https://openalex.org/W3028498088","https://openalex.org/W3102338173","https://openalex.org/W3119175840","https://openalex.org/W3130585385","https://openalex.org/W3138537503","https://openalex.org/W3194871405","https://openalex.org/W3206083529","https://openalex.org/W3213152741","https://openalex.org/W4210714644","https://openalex.org/W4211130072","https://openalex.org/W4220823206","https://openalex.org/W4221024633","https://openalex.org/W4242274135","https://openalex.org/W4297505015","https://openalex.org/W4306161131","https://openalex.org/W4312270156","https://openalex.org/W6788790089","https://openalex.org/W6847671378"],"related_works":["https://openalex.org/W1611875833","https://openalex.org/W1547053391","https://openalex.org/W1521781013","https://openalex.org/W1975009952","https://openalex.org/W1588949866","https://openalex.org/W2838819579","https://openalex.org/W2949165180","https://openalex.org/W131757205","https://openalex.org/W2384952691","https://openalex.org/W2538210412"],"abstract_inverted_index":{"Planning":[0],"tasks":[1],"are":[2,142,163],"important":[3],"in":[4,41,46,72,93],"construction,":[5],"manufacturing,":[6],"logistics,":[7],"and":[8,37,85],"education.":[9],"At":[10],"the":[11,18,31,51,54,59,69,73,80,83,94,104,107,110,116,130,133,154,166,180,185],"same":[12],"time,":[13],"scheduling":[14,56,70,95,195],"problems":[15,45,173],"belong":[16],"to":[17,53,106,128],"class":[19],"of":[20,30,67,75,82,103,109,132,136,145,153,168,174,184],"NP-hard":[21],"optimization":[22,27,44,62,188],"problems.":[23,196],"Ant":[24],"colony":[25,61,140,187],"algorithm":[26,105,141,189],"is":[28,38,97,112,148,177],"one":[29],"most":[32],"common":[33],"swarm":[34],"intelligence":[35],"algorithms":[36],"a":[39,76,151],"leader":[40],"solving":[42],"complex":[43],"graphs.":[47],"This":[48],"paper":[49],"discusses":[50],"solution":[52],"job-shop":[55,194],"problem":[57,71,111],"using":[58],"ant":[60,139,186],"algorithm.":[63,118],"An":[64],"original":[65],"way":[66],"representing":[68],"form":[74],"graph,":[77],"which":[78],"increases":[79],"flexibility":[81],"approach":[84],"allows":[86],"for":[87,192],"taking":[88],"into":[89],"account":[90],"additional":[91],"restrictions":[92],"problems,":[96],"proposed.":[98],"A":[99],"dynamic":[100],"evolutionary":[101,138],"adaptation":[102],"conditions":[108],"proposed":[113],"based":[114],"on":[115,171],"genetic":[117],"In":[119],"addition,":[120],"some":[121],"heuristic":[122],"techniques":[123,147],"that":[124,179],"make":[125],"it":[126],"possible":[127],"increase":[129],"performance":[131],"software":[134],"implementation":[135],"this":[137],"presented.":[143],"One":[144],"these":[146],"parallelization;":[149],"therefore,":[150],"study":[152],"algorithm\u2019s":[155],"parallelization":[156],"effectiveness":[157],"was":[158],"made.":[159],"The":[160],"obtained":[161],"results":[162,167],"compared":[164],"with":[165],"other":[169],"authors":[170],"test":[172],"scheduling.":[175],"It":[176],"shown":[178],"best":[181],"heuristics":[182],"coefficients":[183],"differ":[190],"even":[191],"similar":[193]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":5}],"updated_date":"2026-03-13T16:22:10.518609","created_date":"2025-10-10T00:00:00"}