{"id":"https://openalex.org/W2038438147","doi":"https://doi.org/10.1137/s0097539795286831","title":"Smart SMART Bounds for Weighted Response Time Scheduling","display_name":"Smart SMART Bounds for Weighted Response Time Scheduling","publication_year":1998,"publication_date":"1998-01-01","ids":{"openalex":"https://openalex.org/W2038438147","doi":"https://doi.org/10.1137/s0097539795286831","mag":"2038438147"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539795286831","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539795286831","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/A5057886883","display_name":"Uwe Schwiegelshohn","orcid":"https://orcid.org/0000-0002-3582-4961"},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Uwe Schwiegelshohn","raw_affiliation_strings":["Dortmund University"],"affiliations":[{"raw_affiliation_string":"Dortmund University","institution_ids":["https://openalex.org/I200332995"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060442972","display_name":"Walter Ludwig","orcid":null},"institutions":[{"id":"https://openalex.org/I135310074","display_name":"University of Wisconsin\u2013Madison","ror":"https://ror.org/01y2jtd41","country_code":"US","type":"education","lineage":["https://openalex.org/I135310074"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Walter Ludwig","raw_affiliation_strings":["University of Wisconsin \u2013,"],"affiliations":[{"raw_affiliation_string":"University of Wisconsin \u2013,","institution_ids":["https://openalex.org/I135310074"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065314353","display_name":"Joel L. Wolf","orcid":null},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Joel L. Wolf","raw_affiliation_strings":["IBM, ,"],"affiliations":[{"raw_affiliation_string":"IBM, ,","institution_ids":["https://openalex.org/I1341412227"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103453053","display_name":"John Turek","orcid":null},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"John Turek","raw_affiliation_strings":["IBM, ,"],"affiliations":[{"raw_affiliation_string":"IBM, ,","institution_ids":["https://openalex.org/I1341412227"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036357902","display_name":"Philip S. Yu","orcid":"https://orcid.org/0000-0002-3491-5968"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Philip S. Yu","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5057886883"],"corresponding_institution_ids":["https://openalex.org/I200332995"],"apc_list":null,"apc_paid":null,"fwci":7.4836,"has_fulltext":false,"cited_by_count":43,"citation_normalized_percentile":{"value":0.9679682,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"28","issue":"1","first_page":"237","last_page":"253"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9995999932289124,"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.9995999932289124,"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.9987000226974487,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9975000023841858,"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/preemption","display_name":"Preemption","score":0.764057993888855},{"id":"https://openalex.org/keywords/response-time","display_name":"Response time","score":0.756783664226532},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6739444732666016},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.66640305519104},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6325665712356567},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5467029213905334},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5045598745346069},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4420100450515747},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37337881326675415},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3029933571815491}],"concepts":[{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.764057993888855},{"id":"https://openalex.org/C19012869","wikidata":"https://www.wikidata.org/wiki/Q578372","display_name":"Response time","level":2,"score":0.756783664226532},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6739444732666016},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.66640305519104},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6325665712356567},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5467029213905334},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5045598745346069},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4420100450515747},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37337881326675415},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3029933571815491},{"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/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s0097539795286831","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539795286831","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.71.7921","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.71.7921","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.it.irf.uni-dortmund.de/IT/Publikationen/pdf/SLW99.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1595545560","https://openalex.org/W1988328380","https://openalex.org/W1997959089","https://openalex.org/W2011039300","https://openalex.org/W2019318803","https://openalex.org/W2024742034","https://openalex.org/W2025122413","https://openalex.org/W2043078530","https://openalex.org/W2048905935","https://openalex.org/W2071027833","https://openalex.org/W2086190489","https://openalex.org/W2154305205"],"related_works":["https://openalex.org/W2040050870","https://openalex.org/W3089811425","https://openalex.org/W2801279942","https://openalex.org/W1500315091","https://openalex.org/W2373738034","https://openalex.org/W1966261337","https://openalex.org/W1843100083","https://openalex.org/W1510578411","https://openalex.org/W1550753226","https://openalex.org/W2087568862"],"abstract_inverted_index":{"Consider":[0],"a":[1,12,27,36,68,93,112,122],"system":[2],"of":[3,20,70,72,114,124,126,134],"independent":[4],"tasks":[5],"to":[6,34,54],"be":[7],"scheduled":[8],"without":[9],"preemption":[10],"on":[11],"parallel":[13],"computer.":[14],"For":[15],"each":[16],"task":[17],"the":[18,23,79,84,99,106,130],"number":[19],"processors":[21],"required,":[22],"execution":[24],"time,":[25],"and":[26],"weight":[28],"are":[29,66,108,120],"known.":[30],"The":[31],"problem":[32,61,90],"is":[33,78],"find":[35],"schedule":[37],"with":[38],"minimum":[39,85],"weighted":[40,86],"average":[41,56,87],"response":[42,57,88],"time.":[43],"We":[44],"present":[45],"an":[46],"algorithm":[47,82],"called":[48],"SMART":[49,115],"(which":[50],"stands":[51],"for":[52,59,83,98,136],"scheduling":[53],"minimize":[55],"time)":[58],"this":[60,77,137],"that":[62,65,91,116,119],"produces":[63,117],"solutions":[64,118],"within":[67,121],"factor":[69,123],"8.53":[71],"optimal.":[73],"To":[74],"our":[75],"knowledge":[76],"first":[80],"polynomial-time":[81],"time":[89],"achieves":[92],"constant":[94],"bound.":[95],"In":[96],"addition,":[97],"unweighted":[100],"case":[101],"(that":[102],"is,":[103],"where":[104],"all":[105],"weights":[107],"unity)":[109],"we":[110],"describe":[111],"variant":[113],"8":[125],"optimal,":[127],"improving":[128],"upon":[129],"best":[131],"known":[132],"bound":[133],"32":[135],"special":[138],"case.":[139]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}