{"id":"https://openalex.org/W4386709944","doi":"https://doi.org/10.1145/3605573.3605595","title":"Scheduling Dependent Batching Tasks","display_name":"Scheduling Dependent Batching Tasks","publication_year":2023,"publication_date":"2023-08-07","ids":{"openalex":"https://openalex.org/W4386709944","doi":"https://doi.org/10.1145/3605573.3605595"},"language":"en","primary_location":{"id":"doi:10.1145/3605573.3605595","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3605573.3605595","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3605573.3605595","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd International Conference on Parallel Processing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3605573.3605595","any_repository_has_fulltext":null},"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":["Sun Yat-sen University, China"],"raw_orcid":"https://orcid.org/0009-0006-6912-5751","affiliations":[{"raw_affiliation_string":"Sun Yat-sen University, China","institution_ids":["https://openalex.org/I157773358"]}]},{"author_position":"middle","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":["Sun Yat-sen University, China"],"raw_orcid":"https://orcid.org/0000-0001-7943-3172","affiliations":[{"raw_affiliation_string":"Sun Yat-sen University, China","institution_ids":["https://openalex.org/I157773358"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043727524","display_name":"Ming Lin","orcid":"https://orcid.org/0000-0003-3778-5924"},"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":"Ming Lin","raw_affiliation_strings":["Sun Yat-sen University, China"],"raw_orcid":"https://orcid.org/0000-0003-3778-5924","affiliations":[{"raw_affiliation_string":"Sun Yat-sen University, China","institution_ids":["https://openalex.org/I157773358"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113000256","display_name":"Rapharl Phan","orcid":null},"institutions":[{"id":"https://openalex.org/I11662577","display_name":"Monash University Malaysia","ror":"https://ror.org/00yncr324","country_code":"MY","type":"education","lineage":["https://openalex.org/I11662577"]}],"countries":["MY"],"is_corresponding":false,"raw_author_name":"Rapharl Phan","raw_affiliation_strings":["Monash University, Malaysia"],"raw_orcid":"https://orcid.org/0000-0001-7448-4595","affiliations":[{"raw_affiliation_string":"Monash University, Malaysia","institution_ids":["https://openalex.org/I11662577"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.2066216,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"585","last_page":"594"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9984999895095825,"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.9984999895095825,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.998199999332428,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9955999851226807,"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/computer-science","display_name":"Computer science","score":0.8374137878417969},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.6263583302497864},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.6261386871337891},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6172024011611938},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.5978360176086426},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.5890650153160095},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.5841984152793884},{"id":"https://openalex.org/keywords/executable","display_name":"Executable","score":0.5709598660469055},{"id":"https://openalex.org/keywords/fixed-priority-pre-emptive-scheduling","display_name":"Fixed-priority pre-emptive scheduling","score":0.562552273273468},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.4613066017627716},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.41000378131866455},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2438565492630005},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.11938762664794922},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.07691869139671326}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8374137878417969},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.6263583302497864},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.6261386871337891},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6172024011611938},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5978360176086426},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.5890650153160095},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.5841984152793884},{"id":"https://openalex.org/C160145156","wikidata":"https://www.wikidata.org/wiki/Q778586","display_name":"Executable","level":2,"score":0.5709598660469055},{"id":"https://openalex.org/C122141398","wikidata":"https://www.wikidata.org/wiki/Q5456330","display_name":"Fixed-priority pre-emptive scheduling","level":5,"score":0.562552273273468},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.4613066017627716},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.41000378131866455},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2438565492630005},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.11938762664794922},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.07691869139671326},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"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.1145/3605573.3605595","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3605573.3605595","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3605573.3605595","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd International Conference on Parallel Processing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3605573.3605595","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3605573.3605595","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3605573.3605595","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd International Conference on Parallel Processing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4809022629","display_name":null,"funder_award_id":"2022A0505050028","funder_id":"https://openalex.org/F4320324202","funder_display_name":"Guangdong Science and Technology Department"},{"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/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320324202","display_name":"Guangdong Science and Technology Department","ror":"https://ror.org/00tjzgn92"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4386709944.pdf","grobid_xml":"https://content.openalex.org/works/W4386709944.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W1492069605","https://openalex.org/W1618165415","https://openalex.org/W1980008867","https://openalex.org/W1996055174","https://openalex.org/W2003902046","https://openalex.org/W2008690976","https://openalex.org/W2019483472","https://openalex.org/W2028754841","https://openalex.org/W2030087828","https://openalex.org/W2049994136","https://openalex.org/W2069832779","https://openalex.org/W2078795041","https://openalex.org/W2096036254","https://openalex.org/W2096521993","https://openalex.org/W2097078863","https://openalex.org/W2150446509","https://openalex.org/W2748897018","https://openalex.org/W2794130716","https://openalex.org/W3113907809","https://openalex.org/W4206395494","https://openalex.org/W4206466315","https://openalex.org/W4297780314"],"related_works":["https://openalex.org/W4300092030","https://openalex.org/W2184166483","https://openalex.org/W1545991362","https://openalex.org/W3184267879","https://openalex.org/W2167574351","https://openalex.org/W1935185185","https://openalex.org/W2545511463","https://openalex.org/W2404383452","https://openalex.org/W2372008037","https://openalex.org/W2978148977"],"abstract_inverted_index":{"We":[0,62,73,129,148],"formulate":[1],"and":[2,78,117],"analyze":[3],"the":[4,38,70,76,88,103,106,112,118,165],"following":[5],"problem":[6,108],"of":[7,37,47,105,145,160,167],"scheduling":[8,67,107,114,123,133,169],"dependent":[9],"batching":[10],"tasks":[11,48,59],"on":[12,44,83],"a":[13,45,65,84,92,95,158],"common":[14],"resource.":[15,39],"Each":[16],"task":[17,41,66,89],"is":[18,115],"associated":[19],"with":[20,125,138],"an":[21],"execution":[22],"time":[23],"window.":[24],"Some":[25],"can":[26],"be":[27],"executed":[28],"simultaneously":[29],"in":[30,143],"batch,":[31],"while":[32],"others":[33],"need":[34],"exclusively":[35],"use":[36],"A":[40],"may":[42],"depend":[43],"set":[46],"such":[49],"that":[50,111],"it":[51],"becomes":[52],"executable":[53],"only":[54],"if":[55],"all":[56],"its":[57],"ancestor":[58],"are":[60],"completed.":[61],"look":[63],"for":[64,135],"policy":[68,124],"maximizing":[69],"system":[71,146],"reward.":[72],"investigate":[74],"both":[75,98,136],"offline":[77,113],"online":[79,119],"settings":[80,162],"by":[81,109],"focusing":[82],"typical":[85],"scenario":[86],"where":[87],"dependency":[90],"forms":[91],"tree":[93],"or":[94],"forest.":[96],"In":[97],"settings,":[99],"we":[100],"formally":[101],"establish":[102],"hardness":[104],"showing":[110],"NP-hard":[116],"counterpart":[120],"admits":[121],"no":[122],"finite":[126],"competitive":[127],"ratio.":[128],"then":[130],"develop":[131],"approximation":[132],"algorithms":[134,156],"cases":[137],"deterministic":[139],"worst-case":[140],"performance":[141],"guarantee":[142],"terms":[144],"utility.":[147],"further":[149],"conduct":[150],"numeric":[151],"experiments":[152],"to":[153,163],"evaluate":[154],"our":[155,168],"under":[157],"variety":[159],"parameter":[161],"demonstrate":[164],"effectiveness":[166],"algorithms.":[170]},"counts_by_year":[],"updated_date":"2026-07-31T08:31:51.225901","created_date":"2025-10-10T00:00:00"}