{"id":"https://openalex.org/W1765165123","doi":"https://doi.org/10.1109/tc.1976.1674556","title":"On the Computational Complexity of a Generalized Scheduling Problem","display_name":"On the Computational Complexity of a Generalized Scheduling Problem","publication_year":1976,"publication_date":"1976-11-01","ids":{"openalex":"https://openalex.org/W1765165123","doi":"https://doi.org/10.1109/tc.1976.1674556","mag":"1765165123"},"language":"en","primary_location":{"id":"doi:10.1109/tc.1976.1674556","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.1976.1674556","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","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/A5047221753","display_name":"Vairavan","orcid":null},"institutions":[{"id":"https://openalex.org/I43579087","display_name":"University of Wisconsin\u2013Milwaukee","ror":"https://ror.org/031q21x57","country_code":"US","type":"education","lineage":["https://openalex.org/I43579087"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Vairavan","raw_affiliation_strings":["Department of Electrical Engineering, University of Wisconsin-Milwaukee","Department of Electrical Engineering, University of Wisconsin, Milwaukee, WI, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Wisconsin-Milwaukee","institution_ids":["https://openalex.org/I43579087"]},{"raw_affiliation_string":"Department of Electrical Engineering, University of Wisconsin, Milwaukee, WI, USA","institution_ids":["https://openalex.org/I43579087"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5098037040","display_name":"Demillo","orcid":null},"institutions":[{"id":"https://openalex.org/I43579087","display_name":"University of Wisconsin\u2013Milwaukee","ror":"https://ror.org/031q21x57","country_code":"US","type":"education","lineage":["https://openalex.org/I43579087"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Demillo","raw_affiliation_strings":["Department of Electrical Engineering, University of Wisconsin, Milwaukee, WI, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Wisconsin, Milwaukee, WI, USA","institution_ids":["https://openalex.org/I43579087"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.7503,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.84490112,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"C-25","issue":"11","first_page":"1067","last_page":"1073"},"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.9986000061035156,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9965000152587891,"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/computer-science","display_name":"Computer science","score":0.7764620780944824},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.6124094724655151},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.579171895980835},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5289646983146667},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5263206362724304},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.4645421504974365},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.45454877614974976},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.42433372139930725},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34135323762893677},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33228734135627747},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.31537777185440063},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19668182730674744}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7764620780944824},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.6124094724655151},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.579171895980835},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5289646983146667},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5263206362724304},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.4645421504974365},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.45454877614974976},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.42433372139930725},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34135323762893677},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33228734135627747},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.31537777185440063},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19668182730674744},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tc.1976.1674556","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.1976.1674556","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","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":12,"referenced_works":["https://openalex.org/W1487184349","https://openalex.org/W1655990431","https://openalex.org/W1973538756","https://openalex.org/W2010927194","https://openalex.org/W2014959855","https://openalex.org/W2057392949","https://openalex.org/W2060160918","https://openalex.org/W2063747256","https://openalex.org/W2066356146","https://openalex.org/W2106001218","https://openalex.org/W2167384564","https://openalex.org/W2401610261"],"related_works":["https://openalex.org/W2195904091","https://openalex.org/W2128410848","https://openalex.org/W2102390841","https://openalex.org/W2118368532","https://openalex.org/W2126232624","https://openalex.org/W2434525066","https://openalex.org/W3140149227","https://openalex.org/W2130555437","https://openalex.org/W2096289371","https://openalex.org/W3023290810"],"abstract_inverted_index":{"The":[0,14],"parallel":[1,37],"scheduling":[2,38],"of":[3,8,23,34,39,51,64,73,97,108],"a":[4,24,40,98,103],"partially":[5,15],"ordered":[6,16],"set":[7],"tasks":[9,17],"has":[10],"received":[11],"great":[12],"attention.":[13],"can":[18],"be":[19,107],"viewed":[20],"as":[21],"components":[22],"straight-line":[25],"program.":[26],"In":[27,78],"this":[28],"note,":[29],"we":[30,69,80],"discuss":[31],"some":[32],"aspects":[33],"the":[35,49,62,71],"nonpreemptive":[36],"program":[41],"with":[42,58],"more":[43],"general":[44],"control":[45],"structures.":[46],"We":[47],"examine":[48],"existence":[50],"optimal":[52,75,94],"k-processor":[53,76,95],"schedules,":[54],"and":[55,67],"in":[56,61],"line":[57],"recent":[59],"interest":[60],"complexity":[63,72],"computer":[65],"computations":[66],"algorithms,":[68],"study":[70],"constructing":[74],"schedules.":[77],"particular":[79],"show":[81],"that,":[82],"for":[83],"every":[84],"k":[85],">":[86],"1,":[87],"any":[88],"algorithm":[89],"that":[90],"would":[91],"yield":[92],"an":[93],"schedule":[96,104],"loop-free":[99],"program,":[100],"when":[101],"such":[102],"exists,":[105],"will":[106],"exponential-time":[109],"complexity.":[110]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}