{"id":"https://openalex.org/W4206466315","doi":"https://doi.org/10.1109/tnet.2021.3138991","title":"From Spectrum Bonding to Contiguous-Resource Batching Task Scheduling","display_name":"From Spectrum Bonding to Contiguous-Resource Batching Task Scheduling","publication_year":2022,"publication_date":"2022-01-10","ids":{"openalex":"https://openalex.org/W4206466315","doi":"https://doi.org/10.1109/tnet.2021.3138991"},"language":"en","primary_location":{"id":"doi:10.1109/tnet.2021.3138991","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnet.2021.3138991","pdf_url":null,"source":{"id":"https://openalex.org/S62238642","display_name":"IEEE/ACM Transactions on Networking","issn_l":"1063-6692","issn":["1063-6692","1558-2566"],"is_oa":false,"is_in_doaj":false,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE/ACM Transactions on Networking","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/A5020401009","display_name":"Hehuan Shi","orcid":"https://orcid.org/0009-0006-6912-5751"},"institutions":[{"id":"https://openalex.org/I157773358","display_name":"Sun Yat-sen University","ror":"https://ror.org/0064kty71","country_code":"CN","type":"education","lineage":["https://openalex.org/I157773358"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hehuan Shi","raw_affiliation_strings":["School of Computer Science and Engineering, Sun Yat-sen University, Guangzhou, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Engineering, Sun Yat-sen University, Guangzhou, China","institution_ids":["https://openalex.org/I157773358"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069716714","display_name":"Lin Chen","orcid":"https://orcid.org/0000-0001-7943-3172"},"institutions":[{"id":"https://openalex.org/I157773358","display_name":"Sun Yat-sen University","ror":"https://ror.org/0064kty71","country_code":"CN","type":"education","lineage":["https://openalex.org/I157773358"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Lin Chen","raw_affiliation_strings":["School of Computer Science and Engineering, Sun Yat-sen University, Guangzhou, China"],"raw_orcid":"https://orcid.org/0000-0001-7943-3172","affiliations":[{"raw_affiliation_string":"School of Computer Science and Engineering, Sun Yat-sen University, Guangzhou, China","institution_ids":["https://openalex.org/I157773358"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I157773358"],"apc_list":null,"apc_paid":null,"fwci":0.5344,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.64076279,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"30","issue":"3","first_page":"1245","last_page":"1254"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9990000128746033,"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/T12288","display_name":"Optimization and Search Problems","score":0.9990000128746033,"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.9979000091552734,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9968000054359436,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8485899567604065},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6903249025344849},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.6187115907669067},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.5484857559204102},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5365294218063354},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5202808976173401},{"id":"https://openalex.org/keywords/shared-resource","display_name":"Shared resource","score":0.4748164415359497},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4601910412311554},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.41745585203170776},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.36889559030532837},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.21627020835876465},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19014251232147217},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.09478333592414856}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8485899567604065},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6903249025344849},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.6187115907669067},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5484857559204102},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5365294218063354},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5202808976173401},{"id":"https://openalex.org/C51332947","wikidata":"https://www.wikidata.org/wiki/Q1172305","display_name":"Shared resource","level":2,"score":0.4748164415359497},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4601910412311554},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.41745585203170776},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.36889559030532837},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.21627020835876465},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19014251232147217},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.09478333592414856},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","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},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tnet.2021.3138991","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnet.2021.3138991","pdf_url":null,"source":{"id":"https://openalex.org/S62238642","display_name":"IEEE/ACM Transactions on Networking","issn_l":"1063-6692","issn":["1063-6692","1558-2566"],"is_oa":false,"is_in_doaj":false,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE/ACM Transactions on Networking","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6346705237","display_name":null,"funder_award_id":"62172455","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":18,"referenced_works":["https://openalex.org/W1492069605","https://openalex.org/W1507141328","https://openalex.org/W1608651920","https://openalex.org/W1972312731","https://openalex.org/W1980008867","https://openalex.org/W1990180428","https://openalex.org/W1996696855","https://openalex.org/W2003902046","https://openalex.org/W2015840394","https://openalex.org/W2040756373","https://openalex.org/W2069832779","https://openalex.org/W2093274793","https://openalex.org/W2096347791","https://openalex.org/W2097078863","https://openalex.org/W2125893200","https://openalex.org/W2503761073","https://openalex.org/W2592580506","https://openalex.org/W4232879267"],"related_works":["https://openalex.org/W2970302286","https://openalex.org/W2810352541","https://openalex.org/W1908901187","https://openalex.org/W2142195909","https://openalex.org/W2963761620","https://openalex.org/W2045215405","https://openalex.org/W2131569046","https://openalex.org/W2797898895","https://openalex.org/W2098754607","https://openalex.org/W4308943899"],"abstract_inverted_index":{"We":[0,58,139],"formulate":[1],"and":[2,26,35,64,93,99,119,135,148,178,184],"analyze":[3],"a":[4,9,18,30,86],"generic":[5,157],"task":[6,81],"scheduling":[7,67,82,137],"problem:":[8],"set":[10],"of":[11,20,33,55,88,144,151,176],"tasks":[12,39],"need":[13,101],"to":[14,102],"be":[15,41,103],"executed":[16,42],"on":[17],"pool":[19],"continuous":[21],"resource":[22,62],"such":[23],"as":[24,77],"spectrum":[25,111,116],"memory,":[27],"each":[28],"requiring":[29,52],"certain":[31],"amount":[32],"time":[34],"contiguous":[36],"resource;":[37],"some":[38],"can":[40],"simultaneously":[43],"in":[44,85,114,125,155,174],"batch":[45],"by":[46],"sharing":[47],"the":[48,56,65,70,78,110,120,142,145,149,152,160,182],"resource,":[49],"while":[50],"others":[51],"exclusive":[53],"use":[54],"resource.":[57],"seek":[59],"an":[60],"optimal":[61],"allocation":[63,123],"related":[66],"policy":[68],"maximizing":[69],"overall":[71],"system":[72],"utility.":[73],"This":[74],"problem,":[75,83],"termed":[76],"contiguous-resource":[79],"batching":[80],"arises":[84],"variety":[87],"engineering":[89],"fields,":[90],"where":[91],"communication":[92],"storage":[94,122],"resources":[95],"are":[96,109],"potential":[97],"bottlenecks":[98],"thus":[100],"carefully":[104],"scheduled.":[105],"Two":[106],"motivating":[107],"examples":[108],"bonding":[112],"problem":[113,124],"dynamic":[115,121],"access":[117],"systems":[118],"computer":[126],"systems.":[127],"In":[128],"this":[129],"paper,":[130],"we":[131,164],"investigate":[132],"both":[133],"offline":[134,146,183],"online":[136,153,185],"settings.":[138,186],"first":[140],"establish":[141],"NP-hardness":[143],"setting":[147,154],"inapproximability":[150],"its":[156],"form.":[158],"Given":[159],"theoretical":[161],"performance":[162,172],"limit,":[163],"then":[165],"develop":[166],"approximation":[167,177],"algorithms":[168],"with":[169],"mathematically":[170],"proven":[171],"guarantee":[173],"terms":[175],"competitive":[179],"ratios":[180],"for":[181]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}