{"id":"https://openalex.org/W2151482551","doi":"https://doi.org/10.1137/s0097539790186716","title":"An NC Algorithm for Scheduling Unit-Time Jobs with Arbitrary Release Times and Deadlines","display_name":"An NC Algorithm for Scheduling Unit-Time Jobs with Arbitrary Release Times and Deadlines","publication_year":1994,"publication_date":"1994-02-01","ids":{"openalex":"https://openalex.org/W2151482551","doi":"https://doi.org/10.1137/s0097539790186716","mag":"2151482551"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539790186716","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539790186716","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/A5015188847","display_name":"Greg N. Frederickson","orcid":null},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]},{"id":"https://openalex.org/I165799507","display_name":"Rensselaer Polytechnic Institute","ror":"https://ror.org/01rtyzb94","country_code":"US","type":"education","lineage":["https://openalex.org/I165799507"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Greg N. Frederickson","raw_affiliation_strings":["Department of Computer Science Purdue University West Lafayette, IN 47907","Department of Computer Science Rensselaer Polytechnic Institute Troy, NY 12180-3590"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science Purdue University West Lafayette, IN 47907","institution_ids":["https://openalex.org/I219193219"]},{"raw_affiliation_string":"Department of Computer Science Rensselaer Polytechnic Institute Troy, NY 12180-3590","institution_ids":["https://openalex.org/I165799507"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030039513","display_name":"Susan H. Rodger","orcid":"https://orcid.org/0000-0002-2524-7718"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]},{"id":"https://openalex.org/I165799507","display_name":"Rensselaer Polytechnic Institute","ror":"https://ror.org/01rtyzb94","country_code":"US","type":"education","lineage":["https://openalex.org/I165799507"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Susan H. Rodger","raw_affiliation_strings":["Department of Computer Science Rensselaer Polytechnic Institute Troy, NY 12180-3590","Department of Computer Science Purdue University West Lafayette, IN 47907"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science Rensselaer Polytechnic Institute Troy, NY 12180-3590","institution_ids":["https://openalex.org/I165799507"]},{"raw_affiliation_string":"Department of Computer Science Purdue University West Lafayette, IN 47907","institution_ids":["https://openalex.org/I219193219"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5015188847"],"corresponding_institution_ids":["https://openalex.org/I165799507","https://openalex.org/I219193219"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.29371491,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"23","issue":"1","first_page":"185","last_page":"211"},"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.9987999796867371,"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.9977999925613403,"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.6783968806266785},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6662425398826599},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5012943744659424},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.496218740940094},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.48400160670280457},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.44029700756073},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.4321352243423462},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.43147867918014526},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.43100711703300476},{"id":"https://openalex.org/keywords/preemption","display_name":"Preemption","score":0.41433870792388916},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.40618574619293213},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3599066138267517},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.28259044885635376},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2767464518547058},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.09173151850700378}],"concepts":[{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6783968806266785},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6662425398826599},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5012943744659424},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.496218740940094},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.48400160670280457},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.44029700756073},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.4321352243423462},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.43147867918014526},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.43100711703300476},{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.41433870792388916},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.40618574619293213},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3599066138267517},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.28259044885635376},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2767464518547058},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.09173151850700378}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s0097539790186716","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539790186716","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:docs.lib.purdue.edu:cstech-1007","is_oa":false,"landing_page_url":"https://docs.lib.purdue.edu/cstech/8","pdf_url":null,"source":{"id":"https://openalex.org/S4377196310","display_name":"Purdue e-Pubs (Purdue University System)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801333002","host_organization_name":"Purdue University System","host_organization_lineage":["https://openalex.org/I2801333002"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Department of Computer Science Technical Reports","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.5699999928474426,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1556711032","https://openalex.org/W1584086289","https://openalex.org/W1980289219","https://openalex.org/W1984873461","https://openalex.org/W2001364911","https://openalex.org/W2045421223","https://openalex.org/W2055849951","https://openalex.org/W2079697168","https://openalex.org/W2081140665","https://openalex.org/W2114451849","https://openalex.org/W2130566259","https://openalex.org/W2161635161"],"related_works":["https://openalex.org/W2040050870","https://openalex.org/W3089811425","https://openalex.org/W2801279942","https://openalex.org/W4377371889","https://openalex.org/W4389362338","https://openalex.org/W2158643246","https://openalex.org/W2113623403","https://openalex.org/W2055932080","https://openalex.org/W3116890492","https://openalex.org/W1968512104"],"abstract_inverted_index":{"The":[0,19,42],"problem":[1],"of":[2,25,32],"scheduling":[3],"n":[4],"unit-time":[5],"jobs":[6,33],"with":[7],"real-valued":[8],"release":[9],"times":[10],"and":[11,29,54],"deadlines":[12],"is":[13,21],"shown":[14],"to":[15,34],"be":[16,35],"in":[17,37,49],"NC.":[18],"solution":[20],"based":[22],"on":[23,45],"characterizations":[24],"a":[26,38,46],"canonical":[27],"schedule":[28],"best":[30],"subset":[31],"scheduled":[36],"given":[39],"time":[40,53],"interval.":[41],"algorithm":[43],"runs":[44],"CREW":[47],"PRAM":[48],"$O((\\log":[50],"n)^2":[51],")$":[52],"uses":[55],"$O({{n^4":[56],"}":[57],"/":[58],"{\\log":[59],"n}})$":[60],"processors.":[61]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}