{"id":"https://openalex.org/W2021987086","doi":"https://doi.org/10.1137/0215081","title":"Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem","display_name":"Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem","publication_year":1986,"publication_date":"1986-11-01","ids":{"openalex":"https://openalex.org/W2021987086","doi":"https://doi.org/10.1137/0215081","mag":"2021987086"},"language":"en","primary_location":{"id":"doi:10.1137/0215081","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0215081","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/A5113709716","display_name":"Tsuyoshi Kawaguchi","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Tsuyoshi Kawaguchi","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5034567736","display_name":"Seiki Kyan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Seiki Kyan","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5113709716"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.6975,"has_fulltext":false,"cited_by_count":149,"citation_normalized_percentile":{"value":0.89482759,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"15","issue":"4","first_page":"1119","last_page":"1129"},"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.9959999918937683,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9950000047683716,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7062473893165588},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5888597965240479},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5521458983421326},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.4741520285606384},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4602777659893036},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.44567936658859253},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4347516596317291},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4298584461212158},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.4236019253730774},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3473944067955017},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3171560764312744},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2705649137496948}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7062473893165588},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5888597965240479},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5521458983421326},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.4741520285606384},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4602777659893036},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.44567936658859253},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4347516596317291},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4298584461212158},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.4236019253730774},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3473944067955017},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3171560764312744},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2705649137496948},{"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},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0215081","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0215081","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W634463279","https://openalex.org/W1988328380","https://openalex.org/W1999370138","https://openalex.org/W2058817479","https://openalex.org/W2067297441","https://openalex.org/W2092438148"],"related_works":["https://openalex.org/W2108800124","https://openalex.org/W2373226645","https://openalex.org/W2590727506","https://openalex.org/W1966261337","https://openalex.org/W2039086323","https://openalex.org/W2096589954","https://openalex.org/W1581805909","https://openalex.org/W2076740206","https://openalex.org/W2086365412","https://openalex.org/W2188409860"],"abstract_inverted_index":{"This":[0],"paper":[1],"studies":[2],"the":[3,40,66,72,92],"problem":[4,25],"of":[5,9,50,87],"scheduling":[6],"a":[7,51],"set":[8],"n":[10],"independent":[11],"tasks":[12],"on":[13],"m":[14,44],"identical":[15],"processors":[16],"so":[17],"as":[18],"to":[19,28,36],"minimize":[20],"mean":[21,67],"weighted":[22,68],"flow-time.":[23],"The":[24,46],"is":[26,59,63,100],"known":[27],"be":[29,37],"NP-complete":[30,38],"for":[31,43],"$m":[32],"\\geqq":[33],"2$":[34],"and":[35,61],"in":[39],"strong":[41],"sense":[42],"arbitrary.":[45],"worst":[47],"case":[48],"behavior":[49],"heuristic":[52],"algorithm":[53,73],"which":[54],"requires":[55],"time":[56],"$O(n\\log":[57],"n)$":[58],"investigated,":[60],"it":[62],"shown":[64],"that":[65,86],"flow-time":[69],"obtained":[70],"by":[71],"does":[74],"not":[75],"exceed":[76],"${{(\\sqrt":[77,94],"2":[78,95],"+":[79,96],"1)}":[80,97],"/":[81,98],"2}":[82],"\\cong":[83],"1.0207$":[84],"times":[85],"an":[88],"optimal":[89],"schedule.":[90],"Moreover":[91],"bound":[93],"2}$":[99],"best":[101],"possible.":[102]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":9}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}