{"id":"https://openalex.org/W1985907895","doi":"https://doi.org/10.1137/0220035","title":"Algorithms for Scheduling Imprecise Computations with Timing Constraints","display_name":"Algorithms for Scheduling Imprecise Computations with Timing Constraints","publication_year":1991,"publication_date":"1991-06-01","ids":{"openalex":"https://openalex.org/W1985907895","doi":"https://doi.org/10.1137/0220035","mag":"1985907895"},"language":"en","primary_location":{"id":"doi:10.1137/0220035","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0220035","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/A5047897840","display_name":"Wei\u2010Kuan Shih","orcid":"https://orcid.org/0000-0001-8356-2495"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Wei-Kuan Shih","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048750937","display_name":"Jane W. S. Liu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jane W. S. Liu","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5103358636","display_name":"Jen\u2010Yao Chung","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jen-Yao Chung","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5047897840"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.7657,"has_fulltext":false,"cited_by_count":123,"citation_normalized_percentile":{"value":0.9583181,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"20","issue":"3","first_page":"537","last_page":"552"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10933","display_name":"Real-Time Systems Scheduling","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.9929999709129333,"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/T11125","display_name":"Petri Nets in System Modeling","score":0.9883000254631042,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/uniprocessor-system","display_name":"Uniprocessor system","score":0.8769017457962036},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6870717406272888},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6041512489318848},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5598581433296204},{"id":"https://openalex.org/keywords/time-constraint","display_name":"Time constraint","score":0.5221586227416992},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5098089575767517},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.44737470149993896},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43822941184043884},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.420126736164093},{"id":"https://openalex.org/keywords/preemption","display_name":"Preemption","score":0.4192889332771301},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.41694825887680054},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.34324756264686584},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19828787446022034},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.1537766456604004},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.06893283128738403}],"concepts":[{"id":"https://openalex.org/C79189994","wikidata":"https://www.wikidata.org/wiki/Q3488021","display_name":"Uniprocessor system","level":3,"score":0.8769017457962036},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6870717406272888},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6041512489318848},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5598581433296204},{"id":"https://openalex.org/C2775907273","wikidata":"https://www.wikidata.org/wiki/Q7805281","display_name":"Time constraint","level":2,"score":0.5221586227416992},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5098089575767517},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.44737470149993896},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43822941184043884},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.420126736164093},{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.4192889332771301},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.41694825887680054},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34324756264686584},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19828787446022034},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.1537766456604004},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.06893283128738403},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","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/0220035","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0220035","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":6,"referenced_works":["https://openalex.org/W1982759900","https://openalex.org/W1991708881","https://openalex.org/W2058817479","https://openalex.org/W2107216979","https://openalex.org/W2121219357","https://openalex.org/W3091269150"],"related_works":["https://openalex.org/W2569893484","https://openalex.org/W2097106574","https://openalex.org/W2171342002","https://openalex.org/W2314658126","https://openalex.org/W2040050870","https://openalex.org/W3089811425","https://openalex.org/W2801279942","https://openalex.org/W2087568862","https://openalex.org/W3189061348","https://openalex.org/W1599533843"],"abstract_inverted_index":{"Here":[0],"the":[1,42,49,55,58,70,78,82,86,116,124,139,148,153,187,209,214,219,239],"problem":[2,200],"of":[3,7,72,81,85,130,143,147,201,218,231],"scheduling":[4],"tasks,":[5],"each":[6],"which":[8],"is":[9,20,45,75,113,150,162,174,183,194,223],"logically":[10],"decomposed":[11],"into":[12],"a":[13,73,95,235],"mandatory":[14,23,43],"subtask":[15,24,39,44,62,193],"and":[16,47,106,127,158,212],"an":[17,34,203],"optional":[18,38,61,87,192,221,244],"subtask,":[19],"considered.":[21],"The":[22,37,60,67,165,199],"must":[25],"be":[26,64],"executed":[27],"to":[28,32,53,77,185],"completion":[29],"in":[30,51,57,69,115],"order":[31,52],"produce":[33],"acceptable":[35],"result.":[36,59],"begins":[40],"after":[41],"completed":[46,196],"refines":[48],"result":[50,71],"reduce":[54],"error":[56,68,142],"can":[63],"left":[65],"incomplete.":[66],"task":[74],"equal":[76],"processing":[79,107,216,248],"time":[80,126,160,169,217],"unfinished":[83],"portion":[84],"subtask.":[88],"Two":[89,225],"preemptive":[90],"algorithms":[91,149,226],"for":[92,227,238],"scheduling,":[93],"on":[94,234],"uniprocessor":[96,236],"system,":[97],"n":[98],"dependent":[99,232],"tasks":[100,132,154,177,233],"with":[101],"rational":[102],"ready":[103,125],"times,":[104],"deadlines,":[105],"times":[108,249],"are":[109,250],"described.":[110],"An":[111],"algorithm":[112,167],"optimal":[114,151,175,204,229],"following":[117],"sense:":[118],"whenever":[119],"feasible":[120,205],"schedules":[121,230],"that":[122,137,207],"meet":[123],"deadline":[128],"constraints":[129,211],"all":[131,144,243],"exist,":[133],"it":[134],"finds":[135],"one":[136],"has":[138,168],"minimum":[140],"total":[141,215],"tasks.":[145],"One":[146],"when":[152,176,190,242],"have":[155,178,246],"identical":[156,247],"weights,":[157],"its":[159],"complexity":[161,170],"$O(n\\log":[163],"n)$.":[164],"other":[166],"$O(n^2":[171],")$,":[172],"but":[173],"different":[179],"weights.":[180],"A":[181],"schedule":[182,206],"said":[184],"satisfy":[186],"$0/1$":[188,210],"constraint":[189],"every":[191],"either":[195],"or":[197],"discarded.":[198],"finding":[202,228],"satisfies":[208],"minimizes":[213],"discarded":[220],"subtasks":[222,245],"NP-complete.":[224],"system":[237],"special":[240],"case":[241],"presented.":[251]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}