{"id":"https://openalex.org/W2736800093","doi":"https://doi.org/10.1145/3087556.3087562","title":"Online Flexible Job Scheduling for Minimum Span","display_name":"Online Flexible Job Scheduling for Minimum Span","publication_year":2017,"publication_date":"2017-07-20","ids":{"openalex":"https://openalex.org/W2736800093","doi":"https://doi.org/10.1145/3087556.3087562","mag":"2736800093"},"language":"en","primary_location":{"id":"doi:10.1145/3087556.3087562","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3087556.3087562","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 29th 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/A5047511868","display_name":"Runtian Ren","orcid":"https://orcid.org/0000-0002-8640-0421"},"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":true,"raw_author_name":"Runtian Ren","raw_affiliation_strings":["Nanyang Technological University, Singapore, Singapore"],"affiliations":[{"raw_affiliation_string":"Nanyang Technological University, Singapore, Singapore","institution_ids":["https://openalex.org/I172675005"]}]},{"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":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5047511868"],"corresponding_institution_ids":["https://openalex.org/I172675005"],"apc_list":null,"apc_paid":null,"fwci":0.6216,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.71845721,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"55","last_page":"66"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998000264167786,"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.9998000264167786,"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.9966999888420105,"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/T10772","display_name":"Distributed systems and fault tolerance","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/competitive-analysis","display_name":"Competitive analysis","score":0.7655209302902222},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6877129077911377},{"id":"https://openalex.org/keywords/job-scheduler","display_name":"Job scheduler","score":0.6592787504196167},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5651339888572693},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5624313950538635},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5450199246406555},{"id":"https://openalex.org/keywords/job-queue","display_name":"Job queue","score":0.5296691656112671},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.48445749282836914},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4772379398345947},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.3953842520713806},{"id":"https://openalex.org/keywords/cloud-computing","display_name":"Cloud computing","score":0.3518820106983185},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.3361469507217407},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3229018449783325},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.20088845491409302},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.1476927101612091},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1450701653957367},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.09745088219642639}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.7655209302902222},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6877129077911377},{"id":"https://openalex.org/C111873713","wikidata":"https://www.wikidata.org/wiki/Q1641413","display_name":"Job scheduler","level":3,"score":0.6592787504196167},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5651339888572693},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5624313950538635},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5450199246406555},{"id":"https://openalex.org/C171627638","wikidata":"https://www.wikidata.org/wiki/Q6206744","display_name":"Job queue","level":4,"score":0.5296691656112671},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.48445749282836914},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4772379398345947},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.3953842520713806},{"id":"https://openalex.org/C79974875","wikidata":"https://www.wikidata.org/wiki/Q483639","display_name":"Cloud computing","level":2,"score":0.3518820106983185},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.3361469507217407},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3229018449783325},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20088845491409302},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.1476927101612091},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1450701653957367},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.09745088219642639},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3087556.3087562","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3087556.3087562","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1552828154","https://openalex.org/W1980135493","https://openalex.org/W1997595976","https://openalex.org/W2003902046","https://openalex.org/W2023661795","https://openalex.org/W2028234874","https://openalex.org/W2032570272","https://openalex.org/W2048348088","https://openalex.org/W2051158805","https://openalex.org/W2069832779","https://openalex.org/W2089078077","https://openalex.org/W2089278681","https://openalex.org/W2097078863","https://openalex.org/W2110171203","https://openalex.org/W2116981347","https://openalex.org/W2131641675","https://openalex.org/W2134807578","https://openalex.org/W2140320442","https://openalex.org/W2176549387","https://openalex.org/W2469847610","https://openalex.org/W2505550437","https://openalex.org/W2560689012","https://openalex.org/W2726686740"],"related_works":["https://openalex.org/W4213299358","https://openalex.org/W2564742953","https://openalex.org/W2793095688","https://openalex.org/W1623410360","https://openalex.org/W4390203503","https://openalex.org/W2797898895","https://openalex.org/W2131569046","https://openalex.org/W2045215405","https://openalex.org/W1966397500","https://openalex.org/W3003614595"],"abstract_inverted_index":{"In":[0,98,162],"this":[1],"paper,":[2],"we":[3,141],"study":[4,88],"an":[5,24],"online":[6,89,129,198,227],"Flexible":[7],"Job":[8],"Scheduling":[9],"(FJS)":[10],"problem.":[11],"The":[12,64,149,209],"input":[13],"of":[14,20,58,71,105,120,126,160,169,189,195,217],"the":[15,41,52,59,69,73,76,93,99,102,123,134,163,166,192,222],"problem":[16],"is":[17,66,85,108,133,152,172],"a":[18,27,31,56,117,156,186,214],"set":[19],"jobs,":[21],"each":[22,106,170],"having":[23],"arrival":[25,45,176],"time,":[26],"starting":[28,48],"deadline":[29],"and":[30,46,95,147,177,200,207,233],"processing":[32,60,103,137,167],"length.":[33],"Each":[34],"job":[35,53,84,107,136,171,228],"has":[36],"to":[37,67,154,236],"be":[38,179],"started":[39],"by":[40],"scheduler":[42,151,211],"between":[43],"its":[44,47,175],"deadline.":[49],"Once":[50],"started,":[51],"runs":[54],"for":[55,111,181,224],"period":[57],"length":[61,104,138,168],"without":[62],"interruption.":[63],"target":[65],"minimize":[68],"span":[70],"all":[72],"jobs":[74,237],"---":[75],"time":[77],"duration":[78],"in":[79,231,241],"which":[80],"at":[81,174],"least":[82],"one":[83],"running.":[86],"We":[87,114,184],"FJS":[90],"under":[91],"both":[92],"non-clairvoyant":[94,100],"clairvoyant":[96,164],"settings.":[97],"setting,":[101,165],"not":[109],"known":[110,173],"scheduling":[112,182,229],"purposes.":[113,183],"first":[115],"establish":[116,185],"lower":[118,187],"bound":[119,188],"\u03bc":[121,132],"on":[122,191],"competitive":[124,158,193,215],"ratio":[125,159,194,216],"any":[127,196],"deterministic":[128,197],"scheduler,":[130,199],"where":[131],"max/min":[135],"ratio.":[139],"Then,":[140],"propose":[142,201],"two":[143,202],"O(\u03bc)-competitive":[144],"schedulers:":[145,204],"Batch":[146],"Batch+.":[148],"Batch+":[150,206],"proved":[153],"have":[155,239],"tight":[157],"(\u03bc+1).":[161],"can":[178,212],"used":[180],"(\u221a5+1)/2":[190],"O(1)-competitive":[203],"Classify-by-Duration":[205],"Profit.":[208],"Profit":[210],"achieve":[213],"4+2\u221a2.":[218],"Our":[219],"work":[220],"lays":[221],"foundation":[223],"extending":[225],"several":[226],"problems":[230],"cloud":[232],"energy-efficient":[234],"computing":[235],"that":[238],"laxity":[240],"starting.":[242]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}