{"id":"https://openalex.org/W4399344216","doi":"https://doi.org/10.1145/3626183.3660263","title":"Brief Announcement: Scheduling Jobs for Minimum Span: Improved Bounds and Learning-Augmented Algorithms","display_name":"Brief Announcement: Scheduling Jobs for Minimum Span: Improved Bounds and Learning-Augmented Algorithms","publication_year":2024,"publication_date":"2024-06-04","ids":{"openalex":"https://openalex.org/W4399344216","doi":"https://doi.org/10.1145/3626183.3660263"},"language":"en","primary_location":{"id":"doi:10.1145/3626183.3660263","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3626183.3660263","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 36th 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/A5075835633","display_name":"Mozhengfu Liu","orcid":"https://orcid.org/0000-0001-6181-9958"},"institutions":[{"id":"https://openalex.org/I111979921","display_name":"Northwestern University","ror":"https://ror.org/000e0be47","country_code":"US","type":"education","lineage":["https://openalex.org/I111979921"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mozhengfu Liu","raw_affiliation_strings":["Northwestern University, Evanston, USA"],"affiliations":[{"raw_affiliation_string":"Northwestern University, Evanston, USA","institution_ids":["https://openalex.org/I111979921"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015527156","display_name":"Xueyan Tang","orcid":"https://orcid.org/0000-0002-7404-7595"},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Xueyan Tang","raw_affiliation_strings":["Nanyang Technological University, Singapore, Singapore"],"affiliations":[{"raw_affiliation_string":"Nanyang Technological University, Singapore, Singapore","institution_ids":["https://openalex.org/I172675005"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5075835633"],"corresponding_institution_ids":["https://openalex.org/I111979921"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.07411403,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"141","last_page":"143"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9984999895095825,"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.9984999895095825,"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.9929999709129333,"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/T12546","display_name":"Smart Parking Systems Research","score":0.9873999953269958,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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.7259469628334045},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5640820264816284},{"id":"https://openalex.org/keywords/span","display_name":"Span (engineering)","score":0.5376454591751099},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.4499800503253937},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36950191855430603},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2908004820346832},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13517743349075317},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.0996168851852417},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.09474459290504456},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.07436737418174744}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7259469628334045},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5640820264816284},{"id":"https://openalex.org/C2778753569","wikidata":"https://www.wikidata.org/wiki/Q1960395","display_name":"Span (engineering)","level":2,"score":0.5376454591751099},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.4499800503253937},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36950191855430603},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2908004820346832},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13517743349075317},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0996168851852417},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.09474459290504456},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.07436737418174744},{"id":"https://openalex.org/C147176958","wikidata":"https://www.wikidata.org/wiki/Q77590","display_name":"Civil engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3626183.3660263","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3626183.3660263","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.5600000023841858,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W2023661795","https://openalex.org/W2036642805","https://openalex.org/W2560674852","https://openalex.org/W2600391725","https://openalex.org/W2726686740","https://openalex.org/W2736800093","https://openalex.org/W4311079974"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2748952813","https://openalex.org/W2128410848","https://openalex.org/W2102390841","https://openalex.org/W2118368532","https://openalex.org/W2126232624","https://openalex.org/W2434525066","https://openalex.org/W3140149227","https://openalex.org/W2130555437","https://openalex.org/W3023290810"],"abstract_inverted_index":{"We":[0,63,78],"study":[1],"a":[2,17,21,65],"flexible":[3],"job":[4,60],"scheduling":[5],"problem.":[6,90],"A":[7],"set":[8],"of":[9,69,74,88],"jobs":[10,25],"is":[11,46,61],"released":[12],"over":[13],"time,":[14],"each":[15],"with":[16],"starting":[18,38],"deadline":[19],"and":[20,40],"processing":[22],"length.":[23],"The":[24,44],"are":[26],"to":[27,47],"be":[28],"started":[29],"by":[30],"an":[31],"online":[32,76],"scheduler":[33],"no":[34],"later":[35],"than":[36],"their":[37],"deadlines":[39],"will":[41],"run":[42],"nonpreemptively.":[43],"objective":[45],"minimize":[48],"the":[49,52,72,85,89],"span":[50],"--":[51],"time":[53],"duration":[54],"for":[55],"which":[56],"at":[57],"least":[58],"one":[59],"running.":[62],"present":[64],"new":[66],"lower":[67],"bound":[68],"4":[70],"on":[71],"competitiveness":[73,82],"any":[75],"algorithm.":[77],"also":[79],"establish":[80],"tight":[81],"bounds":[83],"in":[84],"learning-augmented":[86],"setting":[87]},"counts_by_year":[],"updated_date":"2025-12-21T01:58:51.020947","created_date":"2025-10-10T00:00:00"}