{"id":"https://openalex.org/W2029604753","doi":"https://doi.org/10.1016/0167-6377(95)00031-9","title":"W[2]-hardness of precedence constrained K-processor scheduling","display_name":"W[2]-hardness of precedence constrained K-processor scheduling","publication_year":1995,"publication_date":"1995-09-01","ids":{"openalex":"https://openalex.org/W2029604753","doi":"https://doi.org/10.1016/0167-6377(95)00031-9","mag":"2029604753"},"language":"en","primary_location":{"id":"doi:10.1016/0167-6377(95)00031-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0167-6377(95)00031-9","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":true,"oa_status":"green","oa_url":"https://dspace.library.uu.nl/bitstream/handle/1874/17083/1994-14.pdf?sequence=3&isAllowed=y","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032730524","display_name":"Hans L. Bodlaender","orcid":"https://orcid.org/0000-0002-9297-3330"},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Hans L. Bodlaender","raw_affiliation_strings":["Department of Computer Science, Utrecht University, P.O. Box 80.089, 3508 TB Utrecht, The Netherlands","Department of Computer Science, Utrecht University, P.O. Box 80.089, 3508 TB, Utrecht, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Utrecht University, P.O. Box 80.089, 3508 TB Utrecht, The Netherlands","institution_ids":["https://openalex.org/I193662353"]},{"raw_affiliation_string":"Department of Computer Science, Utrecht University, P.O. Box 80.089, 3508 TB, Utrecht, The Netherlands","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054676766","display_name":"Michael R. Fellows","orcid":"https://orcid.org/0000-0002-6148-9212"},"institutions":[{"id":"https://openalex.org/I212119943","display_name":"University of Victoria","ror":"https://ror.org/04s5mat29","country_code":"CA","type":"education","lineage":["https://openalex.org/I212119943"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Michael R. Fellows","raw_affiliation_strings":["Computer Science Department, University of Victoria, Victoria, British Columbia, Canada V8W 3P6","Computer Science Department, University of Victoria, Victoria, British Columbia, Canada V8W 3P6#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Victoria, Victoria, British Columbia, Canada V8W 3P6","institution_ids":["https://openalex.org/I212119943"]},{"raw_affiliation_string":"Computer Science Department, University of Victoria, Victoria, British Columbia, Canada V8W 3P6#TAB#","institution_ids":["https://openalex.org/I212119943"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5054676766"],"corresponding_institution_ids":["https://openalex.org/I212119943"],"apc_list":{"value":2760,"currency":"USD","value_usd":2760},"apc_paid":null,"fwci":5.7184,"has_fulltext":true,"cited_by_count":54,"citation_normalized_percentile":{"value":0.95334472,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":93,"max":98},"biblio":{"volume":"18","issue":"2","first_page":"93","last_page":"97"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9997000098228455,"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.9997000098228455,"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.9966999888420105,"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.9926000237464905,"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.8796627521514893},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6387400031089783},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.591372549533844},{"id":"https://openalex.org/keywords/polynomial-hierarchy","display_name":"Polynomial hierarchy","score":0.5681310892105103},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5163196921348572},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4941892921924591},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4586164951324463},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.43014079332351685},{"id":"https://openalex.org/keywords/np-complete","display_name":"NP-complete","score":0.41703104972839355},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3451005220413208},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3284894526004791},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2476923167705536}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8796627521514893},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6387400031089783},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.591372549533844},{"id":"https://openalex.org/C2776013622","wikidata":"https://www.wikidata.org/wiki/Q2103021","display_name":"Polynomial hierarchy","level":3,"score":0.5681310892105103},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5163196921348572},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4941892921924591},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4586164951324463},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.43014079332351685},{"id":"https://openalex.org/C122749075","wikidata":"https://www.wikidata.org/wiki/Q215206","display_name":"NP-complete","level":3,"score":0.41703104972839355},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3451005220413208},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3284894526004791},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2476923167705536}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1016/0167-6377(95)00031-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0167-6377(95)00031-9","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"},{"id":"pmh:uu:oai:dspace.library.uu.nl:1874/17083","is_oa":true,"landing_page_url":"https://dspace.library.uu.nl/handle/1874/17083","pdf_url":"https://dspace.library.uu.nl/bitstream/handle/1874/17083/1994-14.pdf?sequence=3&isAllowed=y","source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/other"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.165.7723","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.165.7723","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://igitur-archive.library.uu.nl/math/2006-1215-201245/1994-14.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.19.5551","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.5551","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://archive.cs.uu.nl/pub/RUU/CS/techreps/CS-1994/1994-14.ps.gz","raw_type":"text"}],"best_oa_location":{"id":"pmh:uu:oai:dspace.library.uu.nl:1874/17083","is_oa":true,"landing_page_url":"https://dspace.library.uu.nl/handle/1874/17083","pdf_url":"https://dspace.library.uu.nl/bitstream/handle/1874/17083/1994-14.pdf?sequence=3&isAllowed=y","source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/other"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7911795393","display_name":"Algorithmic and Combinatorial Advances in VLSI Design Theory","funder_award_id":"8919312","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2029604753.pdf","grobid_xml":"https://content.openalex.org/works/W2029604753.grobid-xml"},"referenced_works_count":39,"referenced_works":["https://openalex.org/W26854244","https://openalex.org/W139921209","https://openalex.org/W182506548","https://openalex.org/W1497155250","https://openalex.org/W1501934796","https://openalex.org/W1558062873","https://openalex.org/W1587619488","https://openalex.org/W1597775697","https://openalex.org/W1598441350","https://openalex.org/W1599636498","https://openalex.org/W1918504188","https://openalex.org/W1966291420","https://openalex.org/W1973538756","https://openalex.org/W1982384331","https://openalex.org/W1999591020","https://openalex.org/W2005485907","https://openalex.org/W2011039300","https://openalex.org/W2018964411","https://openalex.org/W2020299050","https://openalex.org/W2040922070","https://openalex.org/W2061513598","https://openalex.org/W2112313560","https://openalex.org/W2115667895","https://openalex.org/W2159003936","https://openalex.org/W2576116471","https://openalex.org/W6601088962","https://openalex.org/W6604875416","https://openalex.org/W6605658434","https://openalex.org/W6607473329","https://openalex.org/W6629805644","https://openalex.org/W6629967571","https://openalex.org/W6633300128","https://openalex.org/W6635749854","https://openalex.org/W6636028123","https://openalex.org/W6651964849","https://openalex.org/W6676173883","https://openalex.org/W6676621547","https://openalex.org/W6683227944","https://openalex.org/W6758867482"],"related_works":["https://openalex.org/W2596756838","https://openalex.org/W2998684673","https://openalex.org/W2041837101","https://openalex.org/W1598441350","https://openalex.org/W1539117866","https://openalex.org/W2997249752","https://openalex.org/W2158154629","https://openalex.org/W2171811389","https://openalex.org/W2775695328","https://openalex.org/W1589381382"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":4},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}