{"id":"https://openalex.org/W2055849951","doi":"https://doi.org/10.1137/0210018","title":"Scheduling Unit\u2013Time Tasks with Arbitrary Release Times and Deadlines","display_name":"Scheduling Unit\u2013Time Tasks with Arbitrary Release Times and Deadlines","publication_year":1981,"publication_date":"1981-05-01","ids":{"openalex":"https://openalex.org/W2055849951","doi":"https://doi.org/10.1137/0210018","mag":"2055849951"},"language":"en","primary_location":{"id":"doi:10.1137/0210018","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0210018","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/A5047995033","display_name":"M. R. Garey","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"M. R. Garey","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110866131","display_name":"David S. Johnson","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"D. S. Johnson","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004580935","display_name":"Barbara S\u0131mons","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"B. B. Simons","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5051027549","display_name":"Robert E. Tarjan","orcid":"https://orcid.org/0000-0001-7505-5768"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"R. E. Tarjan","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5047995033"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":21.1014,"has_fulltext":false,"cited_by_count":205,"citation_normalized_percentile":{"value":0.99545455,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"10","issue":"2","first_page":"256","last_page":"269"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998000264167786,"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.9998000264167786,"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.9980999827384949,"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.9965000152587891,"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/scheduling","display_name":"Scheduling (production processes)","score":0.7272028923034668},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6797990798950195},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.4668557941913605},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.45159125328063965},{"id":"https://openalex.org/keywords/unit-of-time","display_name":"Unit of time","score":0.45142948627471924},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.4493640959262848},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.43923261761665344},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43797749280929565},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.43158280849456787},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4272679090499878},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3369465470314026},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.29555845260620117},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24565628170967102},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.16331353783607483}],"concepts":[{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.7272028923034668},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6797990798950195},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.4668557941913605},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.45159125328063965},{"id":"https://openalex.org/C112931104","wikidata":"https://www.wikidata.org/wiki/Q1790144","display_name":"Unit of time","level":2,"score":0.45142948627471924},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.4493640959262848},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.43923261761665344},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43797749280929565},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.43158280849456787},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4272679090499878},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3369465470314026},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29555845260620117},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24565628170967102},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.16331353783607483},{"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/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},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","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/0210018","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0210018","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":[{"id":"https://metadata.un.org/sdg/16","score":0.5099999904632568,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1655990431","https://openalex.org/W2001364911","https://openalex.org/W2023658462","https://openalex.org/W2025231649","https://openalex.org/W2057392949","https://openalex.org/W2161635161","https://openalex.org/W2989713547"],"related_works":["https://openalex.org/W3012609114","https://openalex.org/W2003327526","https://openalex.org/W4226218108","https://openalex.org/W2119358936","https://openalex.org/W2365404043","https://openalex.org/W4367046720","https://openalex.org/W2098962655","https://openalex.org/W2782953044","https://openalex.org/W4291299514","https://openalex.org/W2098270445"],"abstract_inverted_index":{"The":[0],"basic":[1],"problem":[2,32,67],"considered":[3],"is":[4],"that":[5,30,60],"of":[6,65,92],"scheduling":[7],"n":[8],"unit-time":[9],"tasks,":[10],"with":[11,47],"arbitrary":[12],"release":[13,40,54],"times":[14,41,55],"and":[15],"deadlines,":[16],"so":[17],"as":[18],"to":[19],"minimize":[20],"the":[21,48,63,66,78,90],"maximum":[22],"task":[23],"completion":[24],"time.":[25],"Previous":[26],"work":[27],"has":[28],"shown":[29],"this":[31],"can":[33],"be":[34],"solved":[35],"rather":[36],"easily":[37],"when":[38],"all":[39],"are":[42,45,56,76],"integers.":[43],"We":[44],"concerned":[46],"general":[49],"case":[50],"in":[51],"which":[52],"noninteger":[53],"allowed,":[57],"a":[58,71],"generalization":[59],"considerably":[61],"increases":[62],"difficulty":[64],"even":[68],"for":[69,77],"only":[70],"single":[72],"processor.":[73],"Our":[74],"results":[75],"one-processor":[79],"case,":[80],"where":[81],"we":[82],"provide":[83],"an":[84],"$O(n\\log":[85],"n)$":[86],"algorithm":[87],"based":[88],"on":[89],"concept":[91],"\u201cforbidden":[93],"regions\u201d.":[94]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":9},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}