{"id":"https://openalex.org/W4414170405","doi":"https://doi.org/10.1109/iwqos65803.2025.11143433","title":"SLIM: Scheduling Deadline-Driven Tasks with a Minimum Number of UAVs","display_name":"SLIM: Scheduling Deadline-Driven Tasks with a Minimum Number of UAVs","publication_year":2025,"publication_date":"2025-07-02","ids":{"openalex":"https://openalex.org/W4414170405","doi":"https://doi.org/10.1109/iwqos65803.2025.11143433"},"language":"en","primary_location":{"id":"doi:10.1109/iwqos65803.2025.11143433","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iwqos65803.2025.11143433","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE/ACM 33rd International Symposium on Quality of Service (IWQoS)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5100978116","display_name":"Jianping Huang","orcid":null},"institutions":[{"id":"https://openalex.org/I76569877","display_name":"Southeast University","ror":"https://ror.org/04ct4d772","country_code":"CN","type":"education","lineage":["https://openalex.org/I76569877"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jianping Huang","raw_affiliation_strings":["School of Computer Science and Engineering, Southeast University,China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Engineering, Southeast University,China","institution_ids":["https://openalex.org/I76569877"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007711808","display_name":"Feng Shan","orcid":"https://orcid.org/0000-0001-7398-8265"},"institutions":[{"id":"https://openalex.org/I76569877","display_name":"Southeast University","ror":"https://ror.org/04ct4d772","country_code":"CN","type":"education","lineage":["https://openalex.org/I76569877"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Feng Shan","raw_affiliation_strings":["School of Computer Science and Engineering, Southeast University,China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Engineering, Southeast University,China","institution_ids":["https://openalex.org/I76569877"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I76569877"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.27535417,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"10"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11133","display_name":"UAV Applications and Optimization","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/T11133","display_name":"UAV Applications and Optimization","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/T11942","display_name":"Transportation and Mobility Innovations","score":0.9868999719619751,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.984000027179718,"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/scheduling","display_name":"Scheduling (production processes)","score":0.6676999926567078},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.507099986076355},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.47279998660087585},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4374000132083893},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4311999976634979},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.40119999647140503},{"id":"https://openalex.org/keywords/resource-constraints","display_name":"Resource constraints","score":0.35359999537467957},{"id":"https://openalex.org/keywords/task-analysis","display_name":"Task analysis","score":0.3425999879837036},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.34139999747276306}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7419999837875366},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6676999926567078},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.515999972820282},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.507099986076355},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.47279998660087585},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.45989999175071716},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4374000132083893},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4311999976634979},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.40119999647140503},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.39739999175071716},{"id":"https://openalex.org/C3017813396","wikidata":"https://www.wikidata.org/wiki/Q17078173","display_name":"Resource constraints","level":2,"score":0.35359999537467957},{"id":"https://openalex.org/C175154964","wikidata":"https://www.wikidata.org/wiki/Q380077","display_name":"Task analysis","level":3,"score":0.3425999879837036},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.34139999747276306},{"id":"https://openalex.org/C2780165032","wikidata":"https://www.wikidata.org/wiki/Q16869822","display_name":"Energy consumption","level":2,"score":0.3192000091075897},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.3125},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3025999963283539},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.3000999987125397},{"id":"https://openalex.org/C2777480716","wikidata":"https://www.wikidata.org/wiki/Q23582796","display_name":"Resource consumption","level":2,"score":0.2976999878883362},{"id":"https://openalex.org/C59519942","wikidata":"https://www.wikidata.org/wiki/Q650665","display_name":"Drone","level":2,"score":0.289900004863739},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2782000005245209},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.2718000113964081},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.2646999955177307},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.26190000772476196},{"id":"https://openalex.org/C2775935494","wikidata":"https://www.wikidata.org/wiki/Q741964","display_name":"Search and rescue","level":3,"score":0.2605000138282776},{"id":"https://openalex.org/C2778456923","wikidata":"https://www.wikidata.org/wiki/Q5337692","display_name":"Edge computing","level":3,"score":0.25429999828338623},{"id":"https://openalex.org/C2776061582","wikidata":"https://www.wikidata.org/wiki/Q25325231","display_name":"Mobile edge computing","level":3,"score":0.2538999915122986}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iwqos65803.2025.11143433","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iwqos65803.2025.11143433","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE/ACM 33rd International Symposium on Quality of Service (IWQoS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6657121739","display_name":null,"funder_award_id":"62472090","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W1491744105","https://openalex.org/W1548885290","https://openalex.org/W1974725056","https://openalex.org/W2005908084","https://openalex.org/W2964023906","https://openalex.org/W3047074398","https://openalex.org/W3110123607","https://openalex.org/W3119069103","https://openalex.org/W3154579422","https://openalex.org/W4205348215","https://openalex.org/W4206460612","https://openalex.org/W4211195223","https://openalex.org/W4211236403","https://openalex.org/W4224248396","https://openalex.org/W4226215778","https://openalex.org/W4283211846","https://openalex.org/W4285295908","https://openalex.org/W4292267328","https://openalex.org/W4295832395","https://openalex.org/W4296338485","https://openalex.org/W4313534960","https://openalex.org/W4313535466","https://openalex.org/W4323645931","https://openalex.org/W4327954933","https://openalex.org/W4328007710","https://openalex.org/W4366504184","https://openalex.org/W4376456702","https://openalex.org/W4379932028","https://openalex.org/W4384080876","https://openalex.org/W4386243267","https://openalex.org/W4386453810","https://openalex.org/W4390659130","https://openalex.org/W4391974593","https://openalex.org/W4392114333","https://openalex.org/W4393140099","https://openalex.org/W4393864710","https://openalex.org/W4400771720","https://openalex.org/W4401326513","https://openalex.org/W4401878798"],"related_works":[],"abstract_inverted_index":{"Unmanned":[0],"Aerial":[1],"Vehicles":[2],"(UAVs)":[3],"have":[4],"been":[5],"widely":[6],"employed":[7],"to":[8,31,37,164],"execute":[9],"tasks":[10,70],"in":[11,45],"diverse":[12],"scenarios.":[13,136],"However,":[14],"most":[15],"existing":[16],"studies":[17],"focus":[18],"on":[19],"task":[20,93],"scheduling":[21,68],"using":[22],"a":[23,72,110],"fixed":[24],"number":[25,74,158],"of":[26,67,75,147,159],"UAVs,":[27],"which":[28],"often":[29],"leads":[30],"resource":[32],"waste":[33],"or":[34],"the":[35,64,148,156],"inability":[36],"complete":[38],"all":[39],"deadline-driven":[40,69],"tasks-a":[41],"critical":[42],"issue":[43],"particularly":[44],"practical":[46],"scenarios":[47],"such":[48],"as":[49,83],"search":[50],"and":[51,54,90,97,122],"rescue,":[52],"surveillance":[53],"mobile":[55],"edge":[56],"computing.":[57],"Distinct":[58],"from":[59],"previous":[60],"works,":[61],"we":[62,104],"investigate":[63],"novel":[65],"problem":[66],"with":[71],"minimum":[73],"UAVs":[76,160],"(termed":[77],"SLIM).":[78],"This":[79],"optimization":[80],"is":[81],"non-trivial":[82],"it":[84],"requires":[85],"both":[86],"minimizing":[87],"UAV":[88],"count":[89],"ensuring":[91],"optimal":[92,117,149],"execution":[94],"within":[95],"deadline":[96],"energy":[98],"constraints.":[99],"To":[100],"address":[101],"these":[102],"challenges,":[103],"develop":[105],"two":[106],"complementary":[107],"algorithms:":[108],"(1)":[109],"dynamic":[111,150],"programming":[112,151],"based":[113],"algorithm":[114,126,143],"that":[115,127,140],"provides":[116],"solutions":[118],"for":[119,132],"small-scale":[120],"scenarios,":[121],"(2)":[123],"an":[124],"approximation":[125,142],"ensures":[128],"theoretical":[129],"performance":[130,153],"guarantees":[131],"efficiently":[133],"handling":[134],"largescale":[135],"Extensive":[137],"simulations":[138],"demonstrate":[139],"our":[141],"achieves":[144],"approximately":[145],"85%":[146],"solution's":[152],"while":[154],"reducing":[155],"average":[157],"by":[161],"21.8%-39.9%":[162],"compared":[163],"state-of-the-art":[165],"approaches.":[166]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}