{"id":"https://openalex.org/W4392614832","doi":"https://doi.org/10.54216/fpa.150113","title":"Optimizing Task Scheduling and Resource Allocation in Computing Environments using Metaheuristic Methods","display_name":"Optimizing Task Scheduling and Resource Allocation in Computing Environments using Metaheuristic Methods","alternate_titles":[],"publication_year":2024,"publication_date":"2024-01-01","ids":{"openalex":"https://openalex.org/W4392614832","doi":"https://doi.org/10.54216/fpa.150113"},"language":"en","primary_location":{"id":"doi:10.54216/fpa.150113","doi":"https://doi.org/10.54216/fpa.150113","is_oa":false,"landing_page_url":"https://doi.org/10.54216/fpa.150113","pdf_url":null,"source":{"id":"https://openalex.org/S4210171581","display_name":"Fusion Practice and Applications","issn_l":"2692-4048","issn":["2692-4048","2770-0070"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["norway-1"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fusion: Practice and Applications","raw_type":"journal-article"},"parent_works":[],"lineage":["https://openalex.org/W4392614832"],"child_works_count":0,"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/A5094105136","display_name":"Heba Heba","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"Heba Heba","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5094105136"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6382,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.64718015,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":96},"biblio":{"volume":"15","issue":"1","first_page":"157","last_page":"179"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.5317000150680542,"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"}},"topics":[{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.5317000150680542,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.27250000834465027,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.07829999923706055,"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.9990000128746033},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"resource allocation","score":0.9990000128746033},{"id":"https://openalex.org/keywords/metaheuristic-algorithms","display_name":"metaheuristic algorithms","score":0.8600000143051147},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"genetic algorithm","score":0.9520000219345093},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"particle swarm optimization","score":1.0},{"id":"https://openalex.org/keywords/ant-colony-optimization","display_name":"ant colony optimization","score":1.0},{"id":"https://openalex.org/keywords/firefly-algorithm","display_name":"firefly algorithm","score":1.0},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"simulated annealing","score":1.0},{"id":"https://openalex.org/keywords/heterogeneous-computing-environments","display_name":"heterogeneous computing environments","score":0.800000011920929},{"id":"https://openalex.org/keywords/deadline-constraints","display_name":"deadline constraints","score":0.6710000038146973},{"id":"https://openalex.org/keywords/finishing-time","display_name":"finishing time","score":0.859000027179718},{"id":"https://openalex.org/keywords/workload-characteristics","display_name":"workload characteristics","score":0.6169999837875366},{"id":"https://openalex.org/keywords/adaptive-algorithm-selection","display_name":"adaptive algorithm selection","score":0.6959999799728394}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8359125852584839},{"id":"https://openalex.org/C2778476105","wikidata":"https://www.wikidata.org/wiki/Q628539","display_name":"Workload","level":2,"score":0.6689011454582214},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.6108434796333313},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5979974269866943},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.5633324384689331},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.559124767780304},{"id":"https://openalex.org/C154982244","wikidata":"https://www.wikidata.org/wiki/Q5451844","display_name":"Firefly algorithm","level":3,"score":0.5446928143501282},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.5009915828704834},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.48702937364578247},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4421535134315491},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.43834397196769714},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4226612448692322},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.41124409437179565},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35319268703460693},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23803627490997314},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.14971712231636047},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.13518404960632324},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09012702107429504},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"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/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.54216/fpa.150113","doi":"https://doi.org/10.54216/fpa.150113","is_oa":false,"landing_page_url":"https://doi.org/10.54216/fpa.150113","pdf_url":null,"source":{"id":"https://openalex.org/S4210171581","display_name":"Fusion Practice and Applications","issn_l":"2692-4048","issn":["2692-4048","2770-0070"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["norway-1"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fusion: Practice and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W7056254385","https://openalex.org/W2076570706","https://openalex.org/W4413918332","https://openalex.org/W6948823438","https://openalex.org/W4304734498","https://openalex.org/W7217568584","https://openalex.org/W7215280749","https://openalex.org/W4388902356","https://openalex.org/W4403840714","https://openalex.org/W7129439257"],"abstract_inverted_index":{"Optimizing":[0],"system":[1,146,198,241],"performance":[2,73,288],"in":[3,28,105,172,193,234],"dynamic":[4],"and":[5,8,24,50,68,82,113,118,160,178,209,216,243],"heterogeneous":[6],"environments":[7],"the":[9,60,77,87,100,111,116,137,158,173,182,194,232,267,285],"efficient":[10],"management":[11],"of":[12,79,86,89,127,167,175,206,227,266,269,279],"computational":[13],"tasks":[14,128,168,177,228],"are":[15],"crucial.":[16],"This":[17],"paper":[18,64],"therefore":[19],"looks":[20],"at":[21,276],"task":[22,207],"scheduling":[23,208,218,256],"resource":[25,210,258],"allocation":[26,259],"algorithms":[27,91,120,162,270],"some":[29],"depth.":[30],"The":[31,63,140,196,247],"work":[32],"evaluates":[33],"five":[34],"algorithms:":[35],"Genetic":[36],"Algorithms":[37],"(GA),":[38],"Particle":[39],"Swarm":[40],"Optimization":[41,45],"(PSO),":[42],"Ant":[43],"Colony":[44],"(ACO),":[46],"Firefly":[47],"Algorithm":[48],"(FA)":[49],"Simulated":[51],"Annealing":[52],"(SA)":[53],"across":[54,92],"various":[55,295],"workloads":[56,94],"achieved":[57],"by":[58,108],"varying":[59],"task-to-node":[61],"ratio.":[62],"identifies":[65],"Finish":[66],"Time":[67],"Deadline":[69],"as":[70],"two":[71],"key":[72],"metrics":[74],"for":[75,231],"gauging":[76],"efficacy":[78],"an":[80,149,200,214],"algorithm,":[81],"a":[83,134,143,224,263],"comprehensive":[84],"investigation":[85],"behaviors":[88,107],"these":[90],"different":[93],"was":[95,133],"carried":[96],"out.":[97],"Results":[98],"from":[99,284],"experiments":[101,286],"reveal":[102],"unique":[103],"patterns":[104],"algorithmic":[106,151],"workload.":[109],"In":[110],"15-task":[112],"5-node":[114],"scenario,":[115],"GA":[117,159],"PSO":[119,161],"outclass":[121],"all":[122],"others,":[123],"completing":[124,164],"100":[125,165],"percent":[126,166],"before":[129,169],"deadlines,":[130],"Task":[131],"5":[132,179],"bane":[135],"to":[136,203,236],"ACO":[138,183],"algorithm.":[139],"study":[141],"proposes":[142],"more":[144],"extensive":[145],"that":[147,220],"promotes":[148],"adaptive":[150],"approach":[152,202],"based":[153,271],"on":[154,186,272,287],"workload":[155],"characteristics.":[156],"Numerically,":[157],"triumphed":[163],"their":[170],"deadlines":[171],"face":[174],"10":[176],"nodes,":[180],"while":[181],"algorithm":[184,292],"stumbled":[185],"certain":[187],"tasks.":[188],"As":[189],"it":[190],"is":[191,229],"stated":[192],"study,":[195],"above-mentioned":[197],"offers":[199,213],"integrated":[201],"ill-structured":[204],"problem":[205],"allocation.":[211],"It":[212,261],"intelligent":[215],"aggressive":[217],"scheme":[219],"runs":[221],"asynchronously":[222],"when":[223],"higher":[225],"number":[226],"submitted":[230],"completion":[233],"addition":[235],"those":[237],"dynamically":[238],"aborts":[239],"whenever":[240],"load":[242],"utilization":[244],"cascade":[245],"excessively.":[246],"proposed":[248],"design":[249],"seems":[250],"like":[251],"full-fledged":[252],"solution":[253],"over":[254],"project":[255],"or":[257],"issues.":[260],"highlights":[262],"detailed":[264],"method":[265],"choice":[268],"semantic":[273],"features,":[274],"aiming":[275],"flexibility.":[277],"Effects":[278],"producing":[280],"quantifiable":[281],"statistical":[282],"results":[283],"empirically":[289],"demonstrate":[290],"each":[291],"performed":[293],"under":[294],"settings.":[296]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W4392614832","counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2024-03-09T00:00:00"}
