{"id":"https://openalex.org/W2040558879","doi":"https://doi.org/10.1137/0206037","title":"Worst Case Analysis of Two Scheduling Algorithms","display_name":"Worst Case Analysis of Two Scheduling Algorithms","publication_year":1977,"publication_date":"1977-09-01","ids":{"openalex":"https://openalex.org/W2040558879","doi":"https://doi.org/10.1137/0206037","mag":"2040558879"},"language":"en","primary_location":{"id":"doi:10.1137/0206037","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0206037","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/A5060747027","display_name":"Shui Lam","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Shui Lam","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5004544151","display_name":"Ravi Sethi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ravi Sethi","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5060747027"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":11.8206,"has_fulltext":false,"cited_by_count":91,"citation_normalized_percentile":{"value":0.98064516,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"6","issue":"3","first_page":"518","last_page":"536"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998999834060669,"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/T12288","display_name":"Optimization and Search Problems","score":0.9990000128746033,"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.9933000206947327,"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/omega","display_name":"Omega","score":0.7183953523635864},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.6258772015571594},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6022219657897949},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5593097805976868},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5442935824394226},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5428734421730042},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.4966433644294739},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.45427048206329346},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39501020312309265},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3610531687736511},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2882629930973053}],"concepts":[{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.7183953523635864},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.6258772015571594},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6022219657897949},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5593097805976868},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5442935824394226},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5428734421730042},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.4966433644294739},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.45427048206329346},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39501020312309265},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3610531687736511},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2882629930973053},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0206037","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0206037","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":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W634463279","https://openalex.org/W1487184349","https://openalex.org/W1830110064","https://openalex.org/W1973538756","https://openalex.org/W2020299050","https://openalex.org/W2027077493","https://openalex.org/W2027662813","https://openalex.org/W2028754841","https://openalex.org/W2052110143","https://openalex.org/W2057392949","https://openalex.org/W2058817479","https://openalex.org/W2084814858","https://openalex.org/W2089269509","https://openalex.org/W2092333800","https://openalex.org/W2095381673","https://openalex.org/W2104680817","https://openalex.org/W2110920860","https://openalex.org/W2218553884","https://openalex.org/W2401610261"],"related_works":["https://openalex.org/W238609530","https://openalex.org/W2734192830","https://openalex.org/W2118368532","https://openalex.org/W2128410848","https://openalex.org/W2126232624","https://openalex.org/W2434525066","https://openalex.org/W3140149227","https://openalex.org/W2096289371","https://openalex.org/W2143229379","https://openalex.org/W2130555437"],"abstract_inverted_index":{"Coffman":[0],"and":[1,38,73,86,100],"Graham":[2],"give":[3],"an":[4,43,87],"algorithm":[5,18,37,67],"to":[6],"schedule":[7,33,89],"unit":[8],"execution":[9],"time":[10],"task":[11,106],"systems":[12,107],"nonpreemptively.":[13],"On":[14,120],"two":[15,141],"processors,":[16],"their":[17,36],"is":[19,28,56,90,129,145],"optimal.":[20],"We":[21],"show":[22,77],"that":[23,78],"in":[24],"general,":[25],"if":[26],"$\\omega$":[27],"the":[29,40,57,65,79,82,98,101,110,143],"length":[30,41],"of":[31,42,59,64,81,84,124],"a":[32,121],"produced":[34],"by":[35,71,92],"$\\omega_0$":[39],"optimal":[44,88],"schedule,":[45],"then":[46],"$\\omega":[47],"/":[48],"\\omega_{0}":[49],"\\leqq":[50],"2":[51],"-":[52,94,113,127],"2/m$,":[53],"where":[54],"m":[55],"number":[58,123],"processors.":[60],"The":[61],"preemptive":[62,102],"equivalent":[63],"above":[66],"has":[68],"been":[69],"considered":[70],"Muntz":[72],"Coffman.":[74],"Again":[75],"we":[76],"ratio":[80,111,144],"lengths":[83],"theirs":[85],"bounded":[91],"$2":[93,112,126],"2/m$.":[95],"In":[96,135],"both":[97],"nonpreemptive":[99],"cases":[103],"there":[104],"exist":[105],"for":[108],"which":[109],"2/m$":[114,128],"can":[115],"be":[116],"approached":[117],"arbitrarily":[118],"closely.":[119],"small":[122],"machines,":[125],"not":[130],"too":[131],"far":[132],"from":[133],"1.":[134,146],"particular,":[136],"as":[137],"noted":[138],"above,":[139],"on":[140],"machines":[142]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}