{"id":"https://openalex.org/W4417508361","doi":"https://doi.org/10.1109/tmc.2025.3646450","title":"Optimization of Task Scheduling Strategy With Timing and Data Dependencies in VEC Based on Deep Reinforcement Learning","display_name":"Optimization of Task Scheduling Strategy With Timing and Data Dependencies in VEC Based on Deep Reinforcement Learning","publication_year":2025,"publication_date":"2025-12-19","ids":{"openalex":"https://openalex.org/W4417508361","doi":"https://doi.org/10.1109/tmc.2025.3646450"},"language":null,"primary_location":{"id":"doi:10.1109/tmc.2025.3646450","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tmc.2025.3646450","pdf_url":null,"source":{"id":"https://openalex.org/S69141925","display_name":"IEEE Transactions on Mobile Computing","issn_l":"1536-1233","issn":["1536-1233","1558-0660","2161-9875"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Mobile Computing","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/A5042651690","display_name":"Wenxian Jiang","orcid":"https://orcid.org/0000-0002-2542-1667"},"institutions":[{"id":"https://openalex.org/I119045251","display_name":"Huaqiao University","ror":"https://ror.org/03frdh605","country_code":"CN","type":"education","lineage":["https://openalex.org/I119045251"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Wenxian Jiang","raw_affiliation_strings":["College of Computer Science and Technology, Huaqiao University, Xiamen, China"],"raw_orcid":"https://orcid.org/0000-0002-2542-1667","affiliations":[{"raw_affiliation_string":"College of Computer Science and Technology, Huaqiao University, Xiamen, China","institution_ids":["https://openalex.org/I119045251"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007396634","display_name":"Naizhou Wang","orcid":"https://orcid.org/0000-0002-5440-4348"},"institutions":[{"id":"https://openalex.org/I119045251","display_name":"Huaqiao University","ror":"https://ror.org/03frdh605","country_code":"CN","type":"education","lineage":["https://openalex.org/I119045251"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Naizhou Wang","raw_affiliation_strings":["College of Computer Science and Technology, Huaqiao University, Xiamen, China"],"raw_orcid":"https://orcid.org/0009-0001-0707-8332","affiliations":[{"raw_affiliation_string":"College of Computer Science and Technology, Huaqiao University, Xiamen, China","institution_ids":["https://openalex.org/I119045251"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5042651690"],"corresponding_institution_ids":["https://openalex.org/I119045251"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.43154466,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"25","issue":"6","first_page":"7845","last_page":"7858"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10273","display_name":"IoT and Edge/Fog Computing","score":0.8064000010490417,"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/T10273","display_name":"IoT and Edge/Fog Computing","score":0.8064000010490417,"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/T10761","display_name":"Vehicular Ad Hoc Networks (VANETs)","score":0.05139999836683273,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T13553","display_name":"Age of Information Optimization","score":0.038600001484155655,"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/computation","display_name":"Computation","score":0.6200000047683716},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.6007999777793884},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5728999972343445},{"id":"https://openalex.org/keywords/time-constraint","display_name":"Time constraint","score":0.4684999883174896},{"id":"https://openalex.org/keywords/computation-offloading","display_name":"Computation offloading","score":0.4399999976158142},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.43320000171661377},{"id":"https://openalex.org/keywords/edge-computing","display_name":"Edge computing","score":0.41179999709129333},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4000999927520752},{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"Reinforcement learning","score":0.38659998774528503},{"id":"https://openalex.org/keywords/task-analysis","display_name":"Task analysis","score":0.36570000648498535}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8751000165939331},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6200000047683716},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.6007999777793884},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5728999972343445},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4878999888896942},{"id":"https://openalex.org/C2775907273","wikidata":"https://www.wikidata.org/wiki/Q7805281","display_name":"Time constraint","level":2,"score":0.4684999883174896},{"id":"https://openalex.org/C2781041963","wikidata":"https://www.wikidata.org/wiki/Q18348618","display_name":"Computation offloading","level":4,"score":0.4399999976158142},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.43320000171661377},{"id":"https://openalex.org/C2778456923","wikidata":"https://www.wikidata.org/wiki/Q5337692","display_name":"Edge computing","level":3,"score":0.41179999709129333},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4000999927520752},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.38659998774528503},{"id":"https://openalex.org/C175154964","wikidata":"https://www.wikidata.org/wiki/Q380077","display_name":"Task analysis","level":3,"score":0.36570000648498535},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.3601999878883362},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.34869998693466187},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.34060001373291016},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.33469998836517334},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.32359999418258667},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.3075000047683716},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.30239999294281006},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3003999888896942},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.2872999906539917},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2872999906539917},{"id":"https://openalex.org/C93996380","wikidata":"https://www.wikidata.org/wiki/Q44127","display_name":"Server","level":2,"score":0.28700000047683716},{"id":"https://openalex.org/C138236772","wikidata":"https://www.wikidata.org/wiki/Q25098575","display_name":"Edge device","level":3,"score":0.28459998965263367},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.28369998931884766},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.27900001406669617},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2775000035762787},{"id":"https://openalex.org/C138827492","wikidata":"https://www.wikidata.org/wiki/Q6661985","display_name":"Data processing","level":2,"score":0.2757999897003174},{"id":"https://openalex.org/C2780609101","wikidata":"https://www.wikidata.org/wiki/Q17156588","display_name":"Resource management (computing)","level":2,"score":0.2750999927520752},{"id":"https://openalex.org/C19012869","wikidata":"https://www.wikidata.org/wiki/Q578372","display_name":"Response time","level":2,"score":0.2732999920845032},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.27140000462532043},{"id":"https://openalex.org/C110875604","wikidata":"https://www.wikidata.org/wiki/Q75","display_name":"The Internet","level":2,"score":0.26910001039505005},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2689000070095062},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.2687000036239624},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.2646999955177307},{"id":"https://openalex.org/C2781327853","wikidata":"https://www.wikidata.org/wiki/Q3552547","display_name":"User equipment","level":3,"score":0.2619999945163727},{"id":"https://openalex.org/C2778484313","wikidata":"https://www.wikidata.org/wiki/Q1172540","display_name":"Data stream","level":2,"score":0.25119999051094055}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tmc.2025.3646450","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tmc.2025.3646450","pdf_url":null,"source":{"id":"https://openalex.org/S69141925","display_name":"IEEE Transactions on Mobile Computing","issn_l":"1536-1233","issn":["1536-1233","1558-0660","2161-9875"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Mobile Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2735381568","display_name":null,"funder_award_id":"62372190","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W2075268401","https://openalex.org/W2901631215","https://openalex.org/W2963644017","https://openalex.org/W2968764495","https://openalex.org/W3039093196","https://openalex.org/W3095147220","https://openalex.org/W3127646665","https://openalex.org/W3171468598","https://openalex.org/W3216768220","https://openalex.org/W4212876679","https://openalex.org/W4225531527","https://openalex.org/W4225976909","https://openalex.org/W4285168076","https://openalex.org/W4312389599","https://openalex.org/W4312648030","https://openalex.org/W4313134679","https://openalex.org/W4317384315","https://openalex.org/W4317620402","https://openalex.org/W4319878926","https://openalex.org/W4322704128","https://openalex.org/W4324135649","https://openalex.org/W4367277020","https://openalex.org/W4378979439","https://openalex.org/W4380362904","https://openalex.org/W4381988174","https://openalex.org/W4386025821","https://openalex.org/W4386511263","https://openalex.org/W4391065735","https://openalex.org/W4392121678","https://openalex.org/W4399408130","https://openalex.org/W4400098508","https://openalex.org/W4405933975","https://openalex.org/W4406278010","https://openalex.org/W4406433407","https://openalex.org/W4411080608"],"related_works":[],"abstract_inverted_index":{"In":[0,46],"the":[1,6,30,35,63,68,72,76,82,91,121,138,145,156,166,176,186,190],"Internet":[2],"of":[3,9,34,75,84,93,125,141,179,198],"Vehicles":[4],"(IoV),":[5],"large":[7],"number":[8],"computation":[10,32,102,116,170],"tasks":[11],"generated":[12],"by":[13,54],"intelligent":[14],"vehicles":[15],"can":[16],"usually":[17],"be":[18],"decomposed":[19],"into":[20],"multiple":[21],"subtasks":[22,41,66],"with":[23],"timing":[24],"and":[25,67,130,189,202,219],"data":[26,131],"dependencies.":[27],"Due":[28],"to":[29,61,89,114,120,136,174],"limited":[31],"resources":[33,117],"vehicle":[36],"itself,":[37],"effectively":[38],"handling":[39],"these":[40,214],"becomes":[42],"a":[43,56,100,148],"significant":[44,194],"challenge.":[45],"this":[47,79],"paper,":[48],"task":[49,199,203],"processing":[50,200],"delay":[51,74,201],"is":[52],"modelled":[53],"using":[55],"directed":[57],"acyclic":[58],"graph":[59],"(DAG)":[60],"represent":[62],"dependencies":[64],"between":[65],"longest":[69],"path":[70],"as":[71,147],"total":[73],"task.":[77],"Secondly,":[78],"paper":[80],"introduces":[81],"concept":[83],"latest":[85],"start":[86],"time":[87,128,212],"(LST)":[88],"measure":[90],"urgency":[92],"subtasks.":[94],"Based":[95],"on":[96],"this,":[97],"we":[98,143,164],"design":[99],"LST-based":[101],"resource":[103],"allocation":[104],"(LST-CRA)":[105],"algorithm,":[106,163],"which":[107],"allows":[108],"vehicular":[109],"edge":[110],"computing":[111],"(VEC)":[112],"server":[113],"allocate":[115],"efficiently":[118],"according":[119],"two":[122],"key":[123],"characteristics":[124],"subtasks,":[126,142],"i.e.,":[127],"constraint":[129],"volume.":[132],"Furthermore,":[133],"in":[134,196],"order":[135],"optimize":[137],"offloading":[139,171],"process":[140],"model":[144],"problem":[146],"multi-agent":[149,157],"collaborative":[150],"optimization":[151,177],"decision-making":[152],"problem.":[153],"By":[154],"employing":[155],"deep":[158],"deterministic":[159],"policy":[160],"gradient":[161],"(MADDPG)":[162],"propose":[165],"LST-CRA":[167,191],"driven":[168],"MADDPG-based":[169],"(LDMCO)":[172],"algorithm":[173,188,192],"meet":[175],"requirements":[178],"subtask":[180],"offloading.":[181],"Experimental":[182],"results":[183],"show":[184],"that":[185],"LDMCO":[187],"demonstrate":[193,216],"advantages":[195],"terms":[197],"completion":[204],"ratio.":[205],"Even":[206],"under":[207],"high":[208],"loads":[209],"or":[210],"strict":[211],"constraints,":[213],"algorithms":[215],"strong":[217],"robustness":[218],"balanced":[220],"system":[221],"performance.":[222]},"counts_by_year":[],"updated_date":"2026-05-09T06:09:20.037420","created_date":"2025-12-19T00:00:00"}
