{"id":"https://openalex.org/W4406793913","doi":"https://doi.org/10.1109/access.2025.3534031","title":"Agent-Based Adaptive Dynamic Round Robin (AADRR) Scheduling Algorithm","display_name":"Agent-Based Adaptive Dynamic Round Robin (AADRR) Scheduling Algorithm","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4406793913","doi":"https://doi.org/10.1109/access.2025.3534031"},"language":"en","primary_location":{"id":"doi:10.1109/access.2025.3534031","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2025.3534031","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1109/access.2025.3534031","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102491989","display_name":"Zafar Iqbal Khan","orcid":null},"institutions":[{"id":"https://openalex.org/I17120543","display_name":"National University of Modern Languages","ror":"https://ror.org/008dh2426","country_code":"PK","type":"education","lineage":["https://openalex.org/I17120543"]}],"countries":["PK"],"is_corresponding":false,"raw_author_name":"Zafar Iqbal Khan","raw_affiliation_strings":["Department of Software Engineering, National University of Modern Languages, Islamabad, Pakistan"],"raw_orcid":"https://orcid.org/0009-0005-9173-0643","affiliations":[{"raw_affiliation_string":"Department of Software Engineering, National University of Modern Languages, Islamabad, Pakistan","institution_ids":["https://openalex.org/I17120543"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101452524","display_name":"Muzafar Khan","orcid":"https://orcid.org/0000-0001-6846-3739"},"institutions":[{"id":"https://openalex.org/I17120543","display_name":"National University of Modern Languages","ror":"https://ror.org/008dh2426","country_code":"PK","type":"education","lineage":["https://openalex.org/I17120543"]}],"countries":["PK"],"is_corresponding":false,"raw_author_name":"Muzafar Khan","raw_affiliation_strings":["Department of Software Engineering, National University of Modern Languages, Islamabad, Pakistan"],"raw_orcid":"https://orcid.org/0000-0001-6846-3739","affiliations":[{"raw_affiliation_string":"Department of Software Engineering, National University of Modern Languages, Islamabad, Pakistan","institution_ids":["https://openalex.org/I17120543"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101924849","display_name":"Syed Nasir Mehmood Shah","orcid":"https://orcid.org/0000-0002-5623-1815"},"institutions":[{"id":"https://openalex.org/I197827452","display_name":"Institute of Space Technology","ror":"https://ror.org/01tmmzv45","country_code":"PK","type":"education","lineage":["https://openalex.org/I197827452"]}],"countries":["PK"],"is_corresponding":false,"raw_author_name":"Syed Nasir Mehmood Shah","raw_affiliation_strings":["Department of Computer Science, Institute of Space Technology, KICSIT Kahuta Campus, Islamabad, Pakistan","Department of Computer Science, KICSIT Kahuta Campus, Institute of Space Technology, Islamabad, Pakistan"],"raw_orcid":"https://orcid.org/0000-0002-5623-1815","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Institute of Space Technology, KICSIT Kahuta Campus, Islamabad, Pakistan","institution_ids":["https://openalex.org/I197827452"]},{"raw_affiliation_string":"Department of Computer Science, KICSIT Kahuta Campus, Institute of Space Technology, Islamabad, Pakistan","institution_ids":["https://openalex.org/I197827452"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":1850,"currency":"USD","value_usd":1850},"apc_paid":{"value":1850,"currency":"USD","value_usd":1850},"fwci":1.809,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.83712189,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":98,"max":99},"biblio":{"volume":"13","issue":null,"first_page":"18308","last_page":"18324"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9377999901771545,"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.9377999901771545,"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/computer-science","display_name":"Computer science","score":0.7954927682876587},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.5462233424186707},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.49845075607299805},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4729872941970825},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.424225389957428},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3895628750324249},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.34077394008636475},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.26911863684654236},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.13029611110687256},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11706125736236572},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.0873086154460907}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7954927682876587},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5462233424186707},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.49845075607299805},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4729872941970825},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.424225389957428},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3895628750324249},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.34077394008636475},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.26911863684654236},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.13029611110687256},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11706125736236572},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.0873086154460907}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/access.2025.3534031","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2025.3534031","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:abd60e92d4a94dedb8b8c824660f57a3","is_oa":true,"landing_page_url":"https://doaj.org/article/abd60e92d4a94dedb8b8c824660f57a3","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Access, Vol 13, Pp 18308-18324 (2025)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1109/access.2025.3534031","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2025.3534031","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1840932120","https://openalex.org/W2096462612","https://openalex.org/W2120264504","https://openalex.org/W2185983812","https://openalex.org/W2611722813","https://openalex.org/W2624825324","https://openalex.org/W2625191576","https://openalex.org/W2921839926","https://openalex.org/W2936518979","https://openalex.org/W2953493247","https://openalex.org/W2995365815","https://openalex.org/W2997207842","https://openalex.org/W3006895030","https://openalex.org/W3010836376","https://openalex.org/W3045755387","https://openalex.org/W3133782021","https://openalex.org/W4224080142","https://openalex.org/W4285231715","https://openalex.org/W4310447967","https://openalex.org/W4323665482","https://openalex.org/W4367058035","https://openalex.org/W4387712661","https://openalex.org/W4395071199","https://openalex.org/W4396662061","https://openalex.org/W4399593576","https://openalex.org/W4400985729","https://openalex.org/W6681462454","https://openalex.org/W6732874235"],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W4386580182","https://openalex.org/W1545991362","https://openalex.org/W2060984508","https://openalex.org/W1935185185","https://openalex.org/W2372008037","https://openalex.org/W4386764057","https://openalex.org/W2365679959","https://openalex.org/W4386128920","https://openalex.org/W2503553253"],"abstract_inverted_index":{"Scheduling":[0,17],"techniques":[1,379],"are":[2,89,177,184],"essential":[3],"to":[4,30,41,133,190,221,238],"increase":[5],"resource":[6,45,252],"utilization":[7],"and":[8,75,81,100,115,180,193,216,225,244,254,281,317,331,347,354,387],"task":[9],"execution":[10],"within":[11,186],"modern":[12],"computing":[13],"environments.":[14],"Round":[15,59],"Robin":[16,60],"(RR)":[18],"ensures":[19],"a":[20,93,187,212,267],"fair":[21,249],"distribution":[22,304],"of":[23,136,151,261],"processes":[24,88,128,176,183,197],"needing":[25],"attention":[26],"but":[27],"often":[28],"leads":[29],"inefficiencies":[31],"in":[32,120,129,154,198,241,357,369,380],"systems":[33],"with":[34,271,322],"heterogeneous":[35],"tasks":[36,209],"or":[37,44],"different":[38,390],"priorities":[39],"due":[40],"large":[42,318,333],"latency":[43],"usage":[46],"differences.":[47],"To":[48,257],"address":[49],"such":[50],"problems,":[51],"this":[52,166],"paper":[53],"introduces":[54],"the":[55,72,84,117,130,148,155,160,174,181,196,199,222,259,262,300,323,332,337,365],"Agent-based":[56],"Adaptive":[57],"Dynamic":[58],"(AADRR)":[61],"process":[62,67,153,242],"scheduling":[63,68,214,236,279,285,378],"technique,":[64],"which":[65,306],"enhances":[66],"by":[69,92,108,336],"continuously":[70],"adjusting":[71],"time":[73,80,140,161,218],"quantum":[74,141,162,219],"criteria,":[76],"combining":[77],"CPU":[78,245,278],"burst":[79,169,246],"priority.":[82],"In":[83,291],"proposed":[85,202],"AADRR,":[86],"all":[87,195,370],"ranked":[90],"dynamically":[91],"software":[94],"agent":[95,105],"based":[96,164],"on":[97,112,165],"user":[98],"preferences":[99],"current":[101],"system":[102,113,215,223,381],"load.":[103],"This":[104],"operates":[106],"independently":[107],"keeping":[109],"an":[110],"eye":[111],"parameters":[114],"making":[116],"required":[118],"adjustments":[119],"real-time":[121],"without":[122],"requiring":[123],"human":[124],"intervention.":[125],"We":[126],"place":[127],"queue":[131],"according":[132,220],"their":[134],"order":[135],"importance.":[137],"A":[138],"dynamic":[139,213,235,255],"policy":[142],"is":[143,204,307],"suitable":[144,206],"whenever":[145],"it":[146,373],"meets":[147],"mean":[149],"duration":[150],"each":[152,352],"queue.":[156],"Every":[157],"round":[158],"has":[159],"adjusted":[163],"method":[167],"average":[168,344,348],"time.":[170,359],"AADRR":[171,203,229,263,341,360],"highlights":[172],"that":[173,210],"short":[175],"managed":[178],"properly":[179],"long":[182],"completed":[185],"few":[188],"rounds":[189],"fairly":[191],"complete":[192],"maintain":[194],"system.":[200],"The":[201],"more":[205,385],"for":[207,310,351,389],"periodic":[208],"employ":[211],"adapt":[217],"state":[224],"job":[226,284],"features.":[227],"Additionally,":[228],"efficiently":[230,342],"manages":[231],"preemptable":[232],"tasks,":[233],"using":[234,299],"policies":[237],"accommodate":[239],"variations":[240],"priority":[243],"times,":[247],"ensuring":[248],"scheduling,":[250],"efficient":[251,386],"utilization,":[253],"adaptability.":[256],"validate":[258],"effectiveness":[260],"algorithm,":[264],"we":[265],"performed":[266],"comparative":[268],"performance":[269,289],"analysis":[270],"twelve":[272],"other":[273,377],"algorithms,":[274],"including":[275],"five":[276],"traditional":[277],"algorithms":[280],"seven":[282],"advanced":[283],"techniques,":[286],"demonstrating":[287],"optimal":[288],"results.":[290],"our":[292],"experiments,":[293],"synthetic":[294],"workload":[295,313,325,353],"traces":[296,326,334],"were":[297,320],"generated":[298],"Monte":[301,338],"Carlo":[302,339],"probability":[303],"method,":[305],"scientifically":[308],"recommended":[309],"creating":[311],"diverse":[312],"traces.":[314],"Small,":[315],"medium,":[316],"datasets":[319],"used,":[321],"small":[324],"obtained":[327],"from":[328],"published":[329],"studies":[330],"produced":[335],"simulation.":[340],"reduces":[343],"turnaround":[345],"times":[346,350],"waiting":[349],"performs":[355,374],"better":[356,375],"response":[358],"may":[361],"not":[362],"always":[363],"provide":[364],"most":[366],"favorable":[367],"measures":[368],"scenarios.":[371],"Still,":[372],"than":[376],"performance,":[382],"while":[383],"being":[384],"flexible":[388],"workloads.":[391]},"counts_by_year":[{"year":2026,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}