{"id":"https://openalex.org/W2079455887","doi":"https://doi.org/10.1016/0196-6774(82)90030-x","title":"Complexity results for scheduling tasks with discrete starting times","display_name":"Complexity results for scheduling tasks with discrete starting times","publication_year":1982,"publication_date":"1982-12-01","ids":{"openalex":"https://openalex.org/W2079455887","doi":"https://doi.org/10.1016/0196-6774(82)90030-x","mag":"2079455887"},"language":"en","primary_location":{"id":"doi:10.1016/0196-6774(82)90030-x","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0196-6774(82)90030-x","pdf_url":null,"source":{"id":"https://openalex.org/S110520077","display_name":"Journal of Algorithms","issn_l":"0196-6774","issn":["0196-6774","1090-2678"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319955","host_organization_name":"Academic Press","host_organization_lineage":["https://openalex.org/P4310319955","https://openalex.org/P4310320990"],"host_organization_lineage_names":["Academic Press","Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Algorithms","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/A5102116980","display_name":"Kazuo Nakajima","orcid":null},"institutions":[{"id":"https://openalex.org/I12315562","display_name":"Texas Tech University","ror":"https://ror.org/0405mnx93","country_code":"US","type":"education","lineage":["https://openalex.org/I12315562"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kazuo Nakajima","raw_affiliation_strings":["Computer Science Section, Department of Electrical Engineering, Texas Tech University, Box 4439, Lubbock, Texas 79409 USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Section, Department of Electrical Engineering, Texas Tech University, Box 4439, Lubbock, Texas 79409 USA","institution_ids":["https://openalex.org/I12315562"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108528137","display_name":"S. L. Hakimi","orcid":null},"institutions":[{"id":"https://openalex.org/I111979921","display_name":"Northwestern University","ror":"https://ror.org/000e0be47","country_code":"US","type":"education","lineage":["https://openalex.org/I111979921"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S.Louis Hakimi","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, Illinois 60201 USA","Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, Illinois 60201, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, Illinois 60201 USA","institution_ids":["https://openalex.org/I111979921"]},{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, Illinois 60201, USA","institution_ids":["https://openalex.org/I111979921"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.6718,"has_fulltext":false,"cited_by_count":35,"citation_normalized_percentile":{"value":0.84709784,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"3","issue":"4","first_page":"344","last_page":"361"},"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.9994000196456909,"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/T10829","display_name":"Interconnection Networks and Systems","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"}}],"keywords":[{"id":"https://openalex.org/keywords/preemption","display_name":"Preemption","score":0.7380081415176392},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.6420378088951111},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6303776502609253},{"id":"https://openalex.org/keywords/multiprocessor-scheduling","display_name":"Multiprocessor scheduling","score":0.6082923412322998},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5912480354309082},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5485005974769592},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5472665429115295},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5404340624809265},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5270723700523376},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42086827754974365},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37344127893447876},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.32616809010505676},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.17459285259246826},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.06974634528160095},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.05568423867225647}],"concepts":[{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.7380081415176392},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.6420378088951111},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6303776502609253},{"id":"https://openalex.org/C85924588","wikidata":"https://www.wikidata.org/wiki/Q107419135","display_name":"Multiprocessor scheduling","level":5,"score":0.6082923412322998},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5912480354309082},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5485005974769592},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5472665429115295},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5404340624809265},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5270723700523376},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42086827754974365},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37344127893447876},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.32616809010505676},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.17459285259246826},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.06974634528160095},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.05568423867225647}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0196-6774(82)90030-x","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0196-6774(82)90030-x","pdf_url":null,"source":{"id":"https://openalex.org/S110520077","display_name":"Journal of Algorithms","issn_l":"0196-6774","issn":["0196-6774","1090-2678"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319955","host_organization_name":"Academic Press","host_organization_lineage":["https://openalex.org/P4310319955","https://openalex.org/P4310320990"],"host_organization_lineage_names":["Academic Press","Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Algorithms","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":18,"referenced_works":["https://openalex.org/W1761548667","https://openalex.org/W2001364911","https://openalex.org/W2009990213","https://openalex.org/W2011039300","https://openalex.org/W2029808296","https://openalex.org/W2036265926","https://openalex.org/W2055849951","https://openalex.org/W2068428611","https://openalex.org/W2097774291","https://openalex.org/W2137152947","https://openalex.org/W2161635161","https://openalex.org/W2166566648","https://openalex.org/W2167291048","https://openalex.org/W6659573362","https://openalex.org/W6680328777","https://openalex.org/W6683915054","https://openalex.org/W6684452080","https://openalex.org/W6684468096"],"related_works":["https://openalex.org/W2794663421","https://openalex.org/W2283291034","https://openalex.org/W1998948241","https://openalex.org/W4244289241","https://openalex.org/W2186708011","https://openalex.org/W2364223843","https://openalex.org/W4239937204","https://openalex.org/W2101964286","https://openalex.org/W2155564881","https://openalex.org/W1640420690"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-22T06:23:43.705686","created_date":"2025-10-10T00:00:00"}