{"id":"https://openalex.org/W2031120475","doi":"https://doi.org/10.1145/2486159.2486161","title":"Online batch scheduling for flow objectives","display_name":"Online batch scheduling for flow objectives","publication_year":2013,"publication_date":"2013-07-16","ids":{"openalex":"https://openalex.org/W2031120475","doi":"https://doi.org/10.1145/2486159.2486161","mag":"2031120475"},"language":"en","primary_location":{"id":"doi:10.1145/2486159.2486161","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2486159.2486161","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-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/A5006392819","display_name":"Sungjin Im","orcid":"https://orcid.org/0000-0001-5994-7280"},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sungjin Im","raw_affiliation_strings":["Duke University, Durham, NC, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Duke University, Durham, NC, USA","institution_ids":["https://openalex.org/I170897317"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044201440","display_name":"Benjamin Moseley","orcid":"https://orcid.org/0000-0001-8162-017X"},"institutions":[{"id":"https://openalex.org/I160992636","display_name":"Toyota Technological Institute at Chicago","ror":"https://ror.org/02sn5gb64","country_code":"US","type":"education","lineage":["https://openalex.org/I160992636"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Benjamin Moseley","raw_affiliation_strings":["Toyota Technological Institute, Chicago, IL, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Toyota Technological Institute, Chicago, IL, USA","institution_ids":["https://openalex.org/I160992636"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3773,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.66394369,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"102","last_page":"104"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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":1.0,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9995999932289124,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9904000163078308,"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/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.7213715314865112},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.7049002647399902},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.702880859375},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.6594460606575012},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.6264857649803162},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.6181478500366211},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5762290358543396},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.5540051460266113},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.5385054349899292},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4962843060493469},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.48406782746315},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.36456942558288574},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.3537682592868805},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.1669236123561859},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15284815430641174},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.1321866810321808},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.1296527087688446}],"concepts":[{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.7213715314865112},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.7049002647399902},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.702880859375},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.6594460606575012},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.6264857649803162},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.6181478500366211},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5762290358543396},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5540051460266113},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.5385054349899292},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4962843060493469},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.48406782746315},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.36456942558288574},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.3537682592868805},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.1669236123561859},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15284815430641174},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.1321866810321808},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.1296527087688446},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2486159.2486161","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2486159.2486161","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.723.4240","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.723.4240","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://faculty.ucmerced.edu/sim3/papers/BatchScheduling.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.49000000953674316,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W196419053","https://openalex.org/W1498726528","https://openalex.org/W1563776668","https://openalex.org/W1868304495","https://openalex.org/W1965378629","https://openalex.org/W1966544820","https://openalex.org/W1972337144","https://openalex.org/W1972868674","https://openalex.org/W1980488765","https://openalex.org/W1996696855","https://openalex.org/W2007479771","https://openalex.org/W2018043895","https://openalex.org/W2019306084","https://openalex.org/W2067103503","https://openalex.org/W2070037973","https://openalex.org/W2081192873","https://openalex.org/W2096036254","https://openalex.org/W2105862720","https://openalex.org/W2107494406","https://openalex.org/W2109827459","https://openalex.org/W2112288559","https://openalex.org/W2151527192","https://openalex.org/W2155167089","https://openalex.org/W2164649614","https://openalex.org/W2168110243","https://openalex.org/W2295130467","https://openalex.org/W2295822836","https://openalex.org/W2484887400","https://openalex.org/W3138033350"],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W4300092030","https://openalex.org/W2167574351","https://openalex.org/W2372008037","https://openalex.org/W1545991362","https://openalex.org/W4386580182","https://openalex.org/W2377713709","https://openalex.org/W2225350526","https://openalex.org/W2172075652","https://openalex.org/W2060984508"],"abstract_inverted_index":{"Batch":[0,54],"scheduling":[1,55,68,78],"gives":[2],"a":[3,50,63,126,139],"powerful":[4],"way":[5],"of":[6,36,44,102,116,130],"increasing":[7],"the":[8,34,39,45,89,100,114,145],"throughput":[9],"by":[10],"aggregating":[11],"multiple":[12],"homogeneous":[13],"jobs.":[14],"It":[15],"has":[16],"applications":[17],"in":[18,25,33,67],"large":[19],"scale":[20],"manufacturing":[21],"as":[22,24,59],"well":[23],"server":[26,37,40],"scheduling.":[27],"In":[28,70],"batch":[29,77],"scheduling,":[30,38,62],"when":[31],"explained":[32],"setting":[35],"can":[41,56],"process":[42],"requests":[43],"same":[46],"type":[47],"up":[48],"to":[49],"certain":[51],"number":[52],"simultaneously.":[53],"be":[57],"seen":[58],"capacitated":[60],"broadcast":[61],"popular":[64],"model":[65,82],"considered":[66],"theory.":[69],"this":[71,81,143],"paper,":[72],"we":[73,83,119,137],"consider":[74],"an":[75],"online":[76,152],"model.":[79],"For":[80,109,133],"address":[84],"flow":[85,98,103,107,111,117,135],"time":[86,91,104,112,118,136],"objectives":[87],"for":[88,96,150],"first":[90],"and":[92,105,113,142],"give":[93],"positive":[94],"results":[95],"average":[97,110],"time,":[99],"k-norms":[101,115],"maximum":[106,134],"time.":[108],"show":[120,138],"algorithms":[121],"that":[122],"are":[123],"O(1)-competitive":[124],"with":[125],"small":[127],"constant":[128],"amount":[129],"resource":[131],"augmentation.":[132],"2-competitive":[140],"algorithm":[141],"is":[144],"best":[146],"possible":[147],"competitive":[148],"ratio":[149],"any":[151],"algorithm.":[153]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2016,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}