{"id":"https://openalex.org/W2136400145","doi":"https://doi.org/10.1137/s0097539701387544","title":"Online Scheduling to Minimize Average Stretch","display_name":"Online Scheduling to Minimize Average Stretch","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2136400145","doi":"https://doi.org/10.1137/s0097539701387544","mag":"2136400145"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539701387544","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539701387544","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/A5045502987","display_name":"S. Muthukrishnan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"S. Muthukrishnan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103525476","display_name":"Rajmohan Rajaraman","orcid":null},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rajmohan Rajaraman","raw_affiliation_strings":["northeastern Univ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"northeastern Univ","institution_ids":["https://openalex.org/I12912129"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088434030","display_name":"Anthony Shaheen","orcid":null},"institutions":[{"id":"https://openalex.org/I35566140","display_name":"Loyola Marymount University","ror":"https://ror.org/00xhj8c72","country_code":"US","type":"education","lineage":["https://openalex.org/I35566140"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Anthony Shaheen","raw_affiliation_strings":["Loyola-Marymount University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Loyola-Marymount University","institution_ids":["https://openalex.org/I35566140"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023537206","display_name":"Johannes Gehrke","orcid":"https://orcid.org/0009-0006-6293-5209"},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Johannes E. Gehrke","raw_affiliation_strings":["Cornell University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Cornell University","institution_ids":["https://openalex.org/I205783295"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.811,"has_fulltext":false,"cited_by_count":29,"citation_normalized_percentile":{"value":0.79321854,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"34","issue":"2","first_page":"433","last_page":"452"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"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.9998999834060669,"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.9993000030517578,"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.9969000220298767,"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.8367361426353455},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.7165809273719788},{"id":"https://openalex.org/keywords/uniprocessor-system","display_name":"Uniprocessor system","score":0.6777461171150208},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.622183620929718},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5983428955078125},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5654925107955933},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5010640621185303},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.45740416646003723},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4558615982532501},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3850458264350891},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3219478130340576},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.30750930309295654},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3061462640762329}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.8367361426353455},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.7165809273719788},{"id":"https://openalex.org/C79189994","wikidata":"https://www.wikidata.org/wiki/Q3488021","display_name":"Uniprocessor system","level":3,"score":0.6777461171150208},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.622183620929718},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5983428955078125},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5654925107955933},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5010640621185303},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.45740416646003723},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4558615982532501},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3850458264350891},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3219478130340576},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.30750930309295654},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3061462640762329},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539701387544","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539701387544","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.5400000214576721,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1978251712","https://openalex.org/W2041645394","https://openalex.org/W2058225986","https://openalex.org/W2148204686"],"related_works":["https://openalex.org/W2021050177","https://openalex.org/W4213299358","https://openalex.org/W2564742953","https://openalex.org/W232296991","https://openalex.org/W2039391036","https://openalex.org/W2793095688","https://openalex.org/W1623410360","https://openalex.org/W2186708011","https://openalex.org/W3115340459","https://openalex.org/W4390751688"],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,20,29,32,38,41,46,50,53,57,67,73,78,82,85,96,120,156,166,186],"classical":[3],"problem":[4],"of":[5,22,31,40,43,56,63,69,98,113,159,169,189],"online":[6,191],"job":[7,47],"scheduling":[8,99],"on":[9,155,185],"uniprocessor":[10],"and":[11,108,137,196],"multiprocessor":[12],"machines.":[13],"For":[14,59,139,161],"a":[15,60],"given":[16,61],"job,":[17,33],"we":[18,65,141,147,163,180],"measure":[19,66],"quality":[21],"service":[23],"provided":[24],"by":[25,28,72,77],"an":[26,70,150],"algorithm":[27,71,79,126,192],"stretch":[30,75,89,133],"which":[34],"is":[35,116,127,145,171],"defined":[36],"as":[37],"ratio":[39,158,168,188],"amount":[42],"time":[44,55,124],"that":[45,119,143,165],"spends":[48],"in":[49,84,101,105],"system":[51],"to":[52,94,117,131],"processing":[54,123],"job.":[58],"sequence":[62],"jobs,":[64],"performance":[68,97],"average":[74,88,132],"achieved":[76],"over":[80],"all":[81],"jobs":[83],"sequence.":[86],"The":[87,110],"metric":[90],"has":[91],"been":[92],"used":[93],"evaluate":[95],"algorithms":[100],"many":[102],"applications":[103],"arising":[104],"databases,":[106],"networks,":[107],"systems.":[109],"main":[111],"contribution":[112],"this":[114],"paper":[115],"show":[118,164],"shortest":[121],"remaining":[122],"(SRPT)":[125],"O(1)-competitive":[128],"with":[129],"respect":[130],"for":[134,193],"both":[135,194],"uniprocessors":[136,195],"multiprocessors.":[138,197],"uniprocessors,":[140],"prove":[142],"SRPT":[144,170],"2-competitive;":[146],"also":[148],"establish":[149,181],"essentially":[151],"matching":[152],"lower":[153,183],"bound":[154],"competitive":[157,167,187],"SRPT.":[160],"multiprocessors,":[162],"at":[172],"most":[173],"$9":[174],"+":[175],"2\\sqrt{6}":[176],"\\le":[177],"14$.":[178],"Furthermore,":[179],"constant-factor":[182],"bounds":[184],"any":[190]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}