{"id":"https://openalex.org/W2407283477","doi":"https://doi.org/10.1142/s021812661650119x","title":"Priority-Based Task Scheduling in the Cloud Systems Using a Memetic Algorithm","display_name":"Priority-Based Task Scheduling in the Cloud Systems Using a Memetic Algorithm","publication_year":2016,"publication_date":"2016-05-21","ids":{"openalex":"https://openalex.org/W2407283477","doi":"https://doi.org/10.1142/s021812661650119x","mag":"2407283477"},"language":"en","primary_location":{"id":"doi:10.1142/s021812661650119x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s021812661650119x","pdf_url":null,"source":{"id":"https://openalex.org/S167602672","display_name":"Journal of Circuits Systems and Computers","issn_l":"0218-1266","issn":["0218-1266","1793-6454"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Circuits, Systems and Computers","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/A5013895439","display_name":"Bahman Keshanchi","orcid":null},"institutions":[{"id":"https://openalex.org/I1293555014","display_name":"Islamic Azad University of Tabriz","ror":"https://ror.org/04hnf9a51","country_code":"IR","type":"education","lineage":["https://openalex.org/I110525433","https://openalex.org/I1293555014"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Bahman Keshanchi","raw_affiliation_strings":["Department of Computer Engineering, Tabriz Branch, Islamic Azad University, Tabriz, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Tabriz Branch, Islamic Azad University, Tabriz, Iran","institution_ids":["https://openalex.org/I1293555014"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007907571","display_name":"Nima Jafari Navimipour","orcid":"https://orcid.org/0000-0002-5514-5536"},"institutions":[{"id":"https://openalex.org/I1293555014","display_name":"Islamic Azad University of Tabriz","ror":"https://ror.org/04hnf9a51","country_code":"IR","type":"education","lineage":["https://openalex.org/I110525433","https://openalex.org/I1293555014"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Nima Jafari Navimipour","raw_affiliation_strings":["Department of Computer Engineering, Tabriz Branch, Islamic Azad University, Tabriz, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Tabriz Branch, Islamic Azad University, Tabriz, Iran","institution_ids":["https://openalex.org/I1293555014"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I1293555014"],"apc_list":null,"apc_paid":null,"fwci":17.5923,"has_fulltext":false,"cited_by_count":60,"citation_normalized_percentile":{"value":0.99061329,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"25","issue":"10","first_page":"1650119","last_page":"1650119"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10101","display_name":"Cloud Computing and Resource Management","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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.9998000264167786,"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/T10273","display_name":"IoT and Edge/Fog Computing","score":0.996399998664856,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8105084896087646},{"id":"https://openalex.org/keywords/memetic-algorithm","display_name":"Memetic algorithm","score":0.6844587326049805},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.6030628085136414},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4919545352458954},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.4857045114040375},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.4809674322605133},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.47827041149139404},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.43916216492652893},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.4377296268939972},{"id":"https://openalex.org/keywords/cloud-computing","display_name":"Cloud computing","score":0.4209740459918976},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.41569966077804565},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.337394118309021},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.30026549100875854},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.18547776341438293},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09518641233444214},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.09502682089805603},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.07413360476493835}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8105084896087646},{"id":"https://openalex.org/C35129592","wikidata":"https://www.wikidata.org/wiki/Q324793","display_name":"Memetic algorithm","level":3,"score":0.6844587326049805},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.6030628085136414},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4919545352458954},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.4857045114040375},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.4809674322605133},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.47827041149139404},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.43916216492652893},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.4377296268939972},{"id":"https://openalex.org/C79974875","wikidata":"https://www.wikidata.org/wiki/Q483639","display_name":"Cloud computing","level":2,"score":0.4209740459918976},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.41569966077804565},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.337394118309021},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.30026549100875854},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.18547776341438293},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09518641233444214},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.09502682089805603},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.07413360476493835},{"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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s021812661650119x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s021812661650119x","pdf_url":null,"source":{"id":"https://openalex.org/S167602672","display_name":"Journal of Circuits Systems and Computers","issn_l":"0218-1266","issn":["0218-1266","1793-6454"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Circuits, Systems and Computers","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":49,"referenced_works":["https://openalex.org/W45105518","https://openalex.org/W1038823107","https://openalex.org/W1508143344","https://openalex.org/W1965969360","https://openalex.org/W1968102441","https://openalex.org/W1972902712","https://openalex.org/W1977251985","https://openalex.org/W1979809380","https://openalex.org/W1990046797","https://openalex.org/W1994412981","https://openalex.org/W1995064917","https://openalex.org/W2002363754","https://openalex.org/W2008434012","https://openalex.org/W2014322824","https://openalex.org/W2023717536","https://openalex.org/W2024456547","https://openalex.org/W2027839617","https://openalex.org/W2030065083","https://openalex.org/W2030425208","https://openalex.org/W2035241516","https://openalex.org/W2044472224","https://openalex.org/W2057392949","https://openalex.org/W2059060110","https://openalex.org/W2060240123","https://openalex.org/W2070307035","https://openalex.org/W2079923099","https://openalex.org/W2080381743","https://openalex.org/W2082117565","https://openalex.org/W2089927056","https://openalex.org/W2094398518","https://openalex.org/W2111271762","https://openalex.org/W2115625429","https://openalex.org/W2124910482","https://openalex.org/W2144605535","https://openalex.org/W2144907978","https://openalex.org/W2149294210","https://openalex.org/W2150339680","https://openalex.org/W2151089374","https://openalex.org/W2153779974","https://openalex.org/W2172250608","https://openalex.org/W2177307695","https://openalex.org/W2273341698","https://openalex.org/W2273653307","https://openalex.org/W2282963973","https://openalex.org/W2326874438","https://openalex.org/W2345830205","https://openalex.org/W2481534688","https://openalex.org/W2518224431","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W4386764057","https://openalex.org/W1976129816","https://openalex.org/W2341020305","https://openalex.org/W2156285842","https://openalex.org/W1904356719","https://openalex.org/W2750150650","https://openalex.org/W2091980923","https://openalex.org/W1963928426","https://openalex.org/W2096052440","https://openalex.org/W2024953199"],"abstract_inverted_index":{"Task":[0],"scheduling":[1,30,49,72,129,140,246],"is":[2,74,131,154,199],"one":[3,75],"of":[4,123,196,203,210,231,250],"the":[5,127,190,201,207,211,215,225,229,237,242,256],"major":[6],"issues":[7],"to":[8,55,58,82,86,107,168,172,184,205,255],"achieve":[9],"high":[10],"performance":[11],"in":[12,27,32,64,84,134,248],"distributed":[13,34],"systems":[14,36],"such":[15],"as":[16,96],"Grid,":[17],"Peer-to-Peer":[18],"and":[19,43,149],"cloud":[20,143],"environment.":[21],"Generally,":[22],"there":[23],"are":[24,40],"two":[25],"phases":[26,39],"heuristics-based":[28],"task":[29,41,48,128,139,245],"algorithms":[31,50,91,247],"heterogeneous":[33,66],"computing":[35,67],"(HeDCSs).":[37],"These":[38],"prioritization":[42],"processor":[44],"assigning":[45],"respectively.":[46],"Heuristic-based":[47],"may":[51],"use":[52],"different":[53,62],"policies":[54],"assign":[56,79,169],"priority":[57,81,147,171],"subtasks":[59],"which":[60],"produce":[61],"makespans":[63],"a":[65,70,80,120,137,150,160,170,177,187],"system.":[68],"Thus,":[69],"suitable":[71],"algorithm":[73,141,152,162,216,240],"that":[76,236],"can":[77],"efficiently":[78],"tasks":[83],"order":[85],"minimize":[87],"makespan.":[88],"Recently,":[89],"memetic":[90,151],"(MAs)":[92],"have":[93,115],"been":[94],"used":[95],"evolutionary":[97],"or":[98],"population-based":[99],"global":[100],"search":[101,105,185],"approaches":[102],"with":[103,165,252],"local":[104],"heuristic":[106],"optimize":[108],"NP-complete":[109],"problems.":[110,125],"Recent":[111],"studies":[112],"on":[113,119,142,217],"MAs":[114],"discovered":[116],"their":[117],"success":[118],"wide":[121],"variety":[122],"real-world":[124],"Since":[126],"problem":[130],"an":[132],"NP-complete,":[133],"this":[135],"paper,":[136],"new":[138],"environment":[144],"using":[145,176,200],"multiple":[146],"queues":[148],"(MPQMA)":[153],"proposed.":[155],"The":[156,193],"proposed":[157,238],"method":[158],"uses":[159],"genetic":[161],"(GA)":[163],"along":[164],"hill":[166],"climbing":[167],"each":[173],"subtask":[174],"while":[175],"heuristic-based":[178],"earliest":[179],"finish":[180],"time":[181],"(EFT)":[182],"approach":[183,198],"for":[186,189,228],"solution":[188],"task-to-processor":[191],"mapping.":[192],"basic":[194],"idea":[195],"our":[197],"advantage":[202],"MA":[204],"increase":[206],"convergence":[208,254],"speed":[209],"solutions.":[212],"We":[213],"implemented":[214],"Azure":[218],"Cloud":[219],"Service":[220],"by":[221],"C#":[222],"language":[223],"where":[224],"experimental":[226],"results":[227],"set":[230],"randomly":[232],"generated":[233],"graphs":[234],"revealed":[235],"MPQMA":[239],"outperformed":[241],"existing":[243],"three":[244],"terms":[249],"makespan":[251],"fast":[253],"optimized":[257],"solution.":[258]},"counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":13},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":15},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}