{"id":"https://openalex.org/W2605651967","doi":"https://doi.org/10.1631/fitee.1500394","title":"An incremental ant colony optimization based approach to task assignment to processors for multiprocessor scheduling","display_name":"An incremental ant colony optimization based approach to task assignment to processors for multiprocessor scheduling","publication_year":2017,"publication_date":"2017-04-01","ids":{"openalex":"https://openalex.org/W2605651967","doi":"https://doi.org/10.1631/fitee.1500394","mag":"2605651967"},"language":"en","primary_location":{"id":"doi:10.1631/fitee.1500394","doi":"https://doi.org/10.1631/fitee.1500394","is_oa":false,"landing_page_url":"https://doi.org/10.1631/fitee.1500394","pdf_url":null,"source":{"id":"https://openalex.org/S4210189857","display_name":"Frontiers of Information Technology & Electronic Engineering","issn_l":"2095-9184","issn":["2095-9184","2095-9230"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["ccf-c","cwts-core","dongbi-c","jufo-1","norway-1","poland-40","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers of Information Technology & Electronic Engineering","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"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/A5082922066","display_name":"Hamid Reza Boveiri","orcid":"https://orcid.org/0000-0002-0278-3649","observed_orcids":["https://orcid.org/0000-0002-0278-3649"]},"institutions":[{"id":"https://openalex.org/I4210153432","display_name":"Islamic Azad University, Shoushtar Branch","ror":"https://ror.org/04w2yhr49","country_code":"IR","type":"education","lineage":["https://openalex.org/I110525433","https://openalex.org/I4210153432"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Hamid Reza Boveiri","raw_affiliation_strings":["Sama Technical and Vocational Training College, Islamic Azad University, Shoushtar Branch, Shoushtar, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sama Technical and Vocational Training College, Islamic Azad University, Shoushtar Branch, Shoushtar, Iran","institution_ids":["https://openalex.org/I4210153432"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5082922066"],"corresponding_institution_ids":["https://openalex.org/I4210153432"],"apc_list":{"value":2390,"currency":"USD","value_usd":2390},"apc_paid":null,"fwci":1.1541,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.81311577,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":97},"biblio":{"volume":"18","issue":"4","first_page":"498","last_page":"510"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.4036000072956085,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.4036000072956085,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.26420000195503235,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.2361000031232834,"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/task-scheduling","display_name":"task scheduling","score":0.6629999876022339},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"multiprocessor scheduling","score":0.9810000061988831},{"id":"https://openalex.org/keywords/ant-colony-optimization","display_name":"ant colony optimization","score":0.9819999933242798},{"id":"https://openalex.org/keywords/task-allocation","display_name":"task allocation","score":0.7089999914169312},{"id":"https://openalex.org/keywords/list-scheduling","display_name":"list scheduling","score":0.8659999966621399},{"id":"https://openalex.org/keywords/makespan-minimization","display_name":"makespan minimization","score":0.843999981880188},{"id":"https://openalex.org/keywords/parallel-and-distributed-systems","display_name":"parallel and distributed systems","score":0.7089999914169312}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.816952645778656},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6718623638153076},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.6490741968154907},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.6440167427062988},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.5832893252372742},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5782716274261475},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.45545142889022827},{"id":"https://openalex.org/C76774629","wikidata":"https://www.wikidata.org/wiki/Q1146103","display_name":"Deadline-monotonic scheduling","level":5,"score":0.425503134727478},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.38980644941329956},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.3164695203304291},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2569445073604584},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.18217474222183228},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09430518746376038},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0876099169254303},{"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":2,"locations":[{"id":"doi:10.1631/fitee.1500394","doi":"https://doi.org/10.1631/fitee.1500394","is_oa":false,"landing_page_url":"https://doi.org/10.1631/fitee.1500394","pdf_url":null,"source":{"id":"https://openalex.org/S4210189857","display_name":"Frontiers of Information Technology & Electronic Engineering","issn_l":"2095-9184","issn":["2095-9184","2095-9230"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["ccf-c","cwts-core","dongbi-c","jufo-1","norway-1","poland-40","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers of Information Technology & Electronic Engineering","raw_type":"journal-article"},{"id":"mag:3140646680","doi":null,"is_oa":false,"landing_page_url":"http://www.cqvip.com/QK/89589A/201704/671925130.html","pdf_url":null,"source":{"id":"https://openalex.org/S199067057","display_name":"Frontiers of Information Technology & Electronic Engineering","issn_l":"1869-1951","issn":["1869-1951","1869-196X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","jufo-1"],"host_organization":"https://openalex.org/P4310311937","host_organization_name":"Zhejiang University Press","host_organization_lineage":["https://openalex.org/P4310311937","https://openalex.org/P4360969398"],"host_organization_lineage_names":["Zhejiang University Press","Zhejiang University"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"\u4fe1\u606f\u4e0e\u7535\u5b50\u5de5\u7a0b\u524d\u6cbf\uff1a\u82f1\u6587\u7248","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W43570251","https://openalex.org/W1506705536","https://openalex.org/W1969750929","https://openalex.org/W2027197113","https://openalex.org/W2040466547","https://openalex.org/W2057108708","https://openalex.org/W2060160256","https://openalex.org/W2064018461","https://openalex.org/W2065689629","https://openalex.org/W2096949818","https://openalex.org/W2097911714","https://openalex.org/W2107387843","https://openalex.org/W2118051273","https://openalex.org/W2151038512","https://openalex.org/W2184077214","https://openalex.org/W2612506596","https://openalex.org/W3000570991","https://openalex.org/W6776055689"],"related_works":["https://openalex.org/W2748346359","https://openalex.org/W2807185969","https://openalex.org/W2107387843","https://openalex.org/W1583364068","https://openalex.org/W2525805827","https://openalex.org/W151817135","https://openalex.org/W2375868316","https://openalex.org/W2017519001","https://openalex.org/W2320957552","https://openalex.org/W2171362322"],"abstract_inverted_index":{"Optimized":[0],"task":[1,133,144],"scheduling":[2,33,40,55],"is":[3,41,169,184],"one":[4],"of":[5,46,51,105,127,154],"the":[6,30,49,66,69,73,79,82,93,114,121,132,140,143,162,165,179],"most":[7],"important":[8],"challenges":[9],"to":[10,42,78,120,161],"achieve":[11],"high":[12],"performance":[13],"in":[14,48,139,172],"multiprocessor":[15],"environments":[16],"such":[17],"as":[18],"parallel":[19],"and":[20,62,75],"distributed":[21],"systems.":[22],"Most":[23],"introduced":[24],"task-scheduling":[25],"algorithms":[26],"are":[27,96],"based":[28,177],"on":[29,178],"so-called":[31],"list":[32,39,53,74],"technique.":[34],"The":[35,152],"basic":[36],"idea":[37],"behind":[38],"prepare":[43],"a":[44,52,174],"sequence":[45,134],"nodes":[47],"form":[50],"for":[54,130],"by":[56,98],"assigning":[57,159],"them":[58],"some":[59],"priority":[60,71],"measurements,":[61],"then":[63],"repeatedly":[64],"removing":[65],"node":[67],"with":[68],"highest":[70],"from":[72],"allocating":[76],"it":[77,88],"processor":[80],"providing":[81],"earliest":[83],"start":[84],"time":[85],"(EST).":[86],"Therefore,":[87],"can":[89,187],"be":[90,108,118],"inferred":[91],"that":[92,158],"makespans":[94],"obtained":[95],"dominated":[97],"two":[99],"major":[100],"factors:":[101],"(1)":[102],"which":[103,186],"order":[104,116],"tasks":[106,160],"should":[107,117],"selected":[109,115],"(sequence":[110],"subproblem);":[111],"(2)":[112],"how":[113],"assigned":[119],"processors":[122,163],"(assignment":[123],"subproblem).":[124],"A":[125],"number":[126],"good":[128],"approaches":[129],"overcoming":[131],"dilemma":[135],"have":[136],"been":[137,149],"proposed":[138],"literature,":[141],"while":[142],"assignment":[145],"problem":[146],"has":[147],"not":[148,170],"studied":[150],"much.":[151],"results":[153],"this":[155],"study":[156],"prove":[157],"using":[164],"traditional":[166],"EST":[167],"method":[168],"optimum;":[171],"addition,":[173],"novel":[175],"approach":[176],"ant":[180],"colony":[181],"optimization":[182],"algorithm":[183],"introduced,":[185],"find":[188],"far":[189],"better":[190],"solutions.":[191]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2017-04-28T00:00:00"}