{"id":"https://openalex.org/W2080664213","doi":"https://doi.org/10.1016/0167-6377(92)90087-j","title":"On the complexity of scheduling tasks with discrete starting times","display_name":"On the complexity of scheduling tasks with discrete starting times","publication_year":1992,"publication_date":"1992-11-01","ids":{"openalex":"https://openalex.org/W2080664213","doi":"https://doi.org/10.1016/0167-6377(92)90087-j","mag":"2080664213"},"language":"en","primary_location":{"id":"doi:10.1016/0167-6377(92)90087-j","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0167-6377(92)90087-j","pdf_url":null,"source":{"id":"https://openalex.org/S27769002","display_name":"Operations Research Letters","issn_l":"0167-6377","issn":["0167-6377","1872-7468"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operations Research Letters","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/A5043506071","display_name":"Julian Keil","orcid":"https://orcid.org/0000-0002-5284-2002"},"institutions":[{"id":"https://openalex.org/I32625721","display_name":"University of Saskatchewan","ror":"https://ror.org/010x8gc63","country_code":"CA","type":"education","lineage":["https://openalex.org/I32625721"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"J Mark Keil","raw_affiliation_strings":["Dept. of Computational Science, University of Saskatchewan, Saskatoon, Canada S7N 0W0","Department of Computational Science, University of Saskatchewan, Saskatoon, Canada S7N 0W0"],"affiliations":[{"raw_affiliation_string":"Dept. of Computational Science, University of Saskatchewan, Saskatoon, Canada S7N 0W0","institution_ids":["https://openalex.org/I32625721"]},{"raw_affiliation_string":"Department of Computational Science, University of Saskatchewan, Saskatoon, Canada S7N 0W0","institution_ids":["https://openalex.org/I32625721"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5043506071"],"corresponding_institution_ids":["https://openalex.org/I32625721"],"apc_list":{"value":2760,"currency":"USD","value_usd":2760},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":43,"citation_normalized_percentile":{"value":0.26002449,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"12","issue":"5","first_page":"293","last_page":"295"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9972000122070312,"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.9972000122070312,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9957000017166138,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9746000170707703,"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/computer-science","display_name":"Computer science","score":0.6821528673171997},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6686588525772095},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4242496192455292},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4207155704498291},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.38786378502845764},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3775669038295746},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3524450957775116},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3132874369621277},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2633548974990845}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6821528673171997},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6686588525772095},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4242496192455292},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4207155704498291},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.38786378502845764},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3775669038295746},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3524450957775116},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3132874369621277},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2633548974990845},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0167-6377(92)90087-j","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0167-6377(92)90087-j","pdf_url":null,"source":{"id":"https://openalex.org/S27769002","display_name":"Operations Research Letters","issn_l":"0167-6377","issn":["0167-6377","1872-7468"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operations Research Letters","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":5,"referenced_works":["https://openalex.org/W2003160050","https://openalex.org/W2011039300","https://openalex.org/W2053913299","https://openalex.org/W2069323107","https://openalex.org/W2079455887"],"related_works":["https://openalex.org/W2117014006","https://openalex.org/W4233815414","https://openalex.org/W2372170743","https://openalex.org/W1558545464","https://openalex.org/W1984303163","https://openalex.org/W1509211761","https://openalex.org/W2358725432","https://openalex.org/W2502560717","https://openalex.org/W3047022145","https://openalex.org/W99847340"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":1}],"updated_date":"2026-03-14T08:43:22.919905","created_date":"2025-10-10T00:00:00"}