{"id":"https://openalex.org/W2047204419","doi":"https://doi.org/10.1137/s0097539704446608","title":"Online Scheduling of Equal\u2010Length Jobs: Randomization and Restarts Help","display_name":"Online Scheduling of Equal\u2010Length Jobs: Randomization and Restarts Help","publication_year":2007,"publication_date":"2007-01-01","ids":{"openalex":"https://openalex.org/W2047204419","doi":"https://doi.org/10.1137/s0097539704446608","mag":"2047204419"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539704446608","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539704446608","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5024529572","display_name":"Marek Chrob\u00e1k","orcid":"https://orcid.org/0000-0002-8673-2709"},"institutions":[{"id":"https://openalex.org/I103635307","display_name":"University of California, Riverside","ror":"https://ror.org/03nawhv43","country_code":"US","type":"education","lineage":["https://openalex.org/I103635307"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Marek Chrobak","raw_affiliation_strings":["Department of Computer Science, University of California - Riverside, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California - Riverside, USA","institution_ids":["https://openalex.org/I103635307"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045597687","display_name":"Wojciech Jawor","orcid":null},"institutions":[{"id":"https://openalex.org/I103635307","display_name":"University of California, Riverside","ror":"https://ror.org/03nawhv43","country_code":"US","type":"education","lineage":["https://openalex.org/I103635307"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Wojciech Jawor","raw_affiliation_strings":["Department of Computer Science, University of California - Riverside, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California - Riverside, USA","institution_ids":["https://openalex.org/I103635307"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061997850","display_name":"Ji\u0159\u0131\u0301 Sgall","orcid":"https://orcid.org/0000-0003-3658-4848"},"institutions":[{"id":"https://openalex.org/I4210120266","display_name":"Czech Academy of Sciences, Institute of Mathematics","ror":"https://ror.org/02tv1yf50","country_code":"CZ","type":"facility","lineage":["https://openalex.org/I202391551","https://openalex.org/I4210120266"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Ji\u0159\u00ed Sgall","raw_affiliation_strings":["Mathematical Institute, AS CR, Praha 1, Czech Republic"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mathematical Institute, AS CR, Praha 1, Czech Republic","institution_ids":["https://openalex.org/I4210120266"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041023653","display_name":"Tom\u00e1\u0161 Tich\u00fd","orcid":"https://orcid.org/0000-0002-6503-5330"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tom\u00e1\u0161 Tich\u00fd","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.3153,"has_fulltext":false,"cited_by_count":47,"citation_normalized_percentile":{"value":0.96557948,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"36","issue":"6","first_page":"1709","last_page":"1728"},"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.9980000257492065,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9901999831199646,"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.8648024797439575},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.8013675212860107},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.7060778141021729},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6929870247840881},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6645188331604004},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6578305959701538},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.5800317525863647},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45205941796302795},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.4495026171207428},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.44417837262153625},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4225977063179016},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.32868242263793945},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28702133893966675}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.8648024797439575},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.8013675212860107},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.7060778141021729},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6929870247840881},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6645188331604004},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6578305959701538},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.5800317525863647},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45205941796302795},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.4495026171207428},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.44417837262153625},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4225977063179016},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32868242263793945},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28702133893966675},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539704446608","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539704446608","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5199999809265137,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1492322076","https://openalex.org/W1527683310","https://openalex.org/W1539914310","https://openalex.org/W1552828154","https://openalex.org/W1565113225","https://openalex.org/W1567931806","https://openalex.org/W1923579438","https://openalex.org/W1963663039","https://openalex.org/W1980008867","https://openalex.org/W1997595976","https://openalex.org/W2018130631","https://openalex.org/W2023171863","https://openalex.org/W2039381785","https://openalex.org/W2049645503","https://openalex.org/W2055849951","https://openalex.org/W2078234942","https://openalex.org/W2080158054","https://openalex.org/W2099261768","https://openalex.org/W2119226317","https://openalex.org/W2161635161","https://openalex.org/W2952155643","https://openalex.org/W3044911583","https://openalex.org/W3137469021"],"related_works":["https://openalex.org/W4241266436","https://openalex.org/W2047204419","https://openalex.org/W2169102169","https://openalex.org/W2592843708","https://openalex.org/W4301494121","https://openalex.org/W2951569031","https://openalex.org/W4287613499","https://openalex.org/W3117905837","https://openalex.org/W2951962248","https://openalex.org/W2121732764"],"abstract_inverted_index":{"We":[0,55,88],"consider":[1],"the":[2,39,45,71,97,113,125,137,149],"following":[3],"scheduling":[4],"problem.":[5],"The":[6,28],"input":[7],"is":[8,20,30,152],"a":[9,33,77,91,132,161],"set":[10],"of":[11,41,94,100,108,164],"jobs":[12],"with":[13,60,118,157],"equal":[14,119],"processing":[15],"times,":[16],"where":[17],"each":[18,48],"job":[19,49],"specified":[21],"by":[22],"its":[23,52],"release":[24,53],"time":[25],"and":[26,65,142],"deadline.":[27],"goal":[29],"to":[31,127],"determine":[32],"single\u2010processor":[34],"nonpreemptive":[35],"schedule":[36],"that":[37,82,104,139,145],"maximizes":[38],"number":[40],"completed":[42],"jobs.":[43],"In":[44],"online":[46,58],"version,":[47],"arrives":[50],"at":[51],"time.":[54],"give":[56,76,131],"two":[57,109,114],"algorithms":[59,103,115,156],"competitive":[61,72,98],"ratios":[62],"below":[63],"2":[64],"show":[66,90,144,160],"several":[67],"lower":[68,92,162],"bounds":[69],"on":[70,96],"ratios.":[73],"First,":[74],"we":[75,121,130,143,159],"barely":[78,101],"random":[79,86,102],"$5/3$\u2010competitive":[80],"algorithm":[81,135],"uses":[83],"only":[84],"one":[85,107],"bit.":[87],"also":[89],"bound":[93,126,163],"$3/2$":[95,151],"ratio":[99,150],"randomly":[105],"choose":[106],"deterministic":[110,133],"algorithms.":[111],"If":[112],"are":[116],"selected":[117],"probability,":[120],"can":[122],"further":[123],"improve":[124],"$8/5$.":[128],"Second,":[129],"$3/2$\u2010competitive":[134],"in":[136,146],"model":[138,148],"allows":[140],"restarts,":[141],"this":[147],"optimal.":[153],"For":[154],"randomized":[155],"restarts":[158],"$6/5$.":[165]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":6}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}