{"id":"https://openalex.org/W2169878774","doi":"https://doi.org/10.1016/0167-6377(94)90024-8","title":"Three, four, five, six, or the complexity of scheduling with communication delays","display_name":"Three, four, five, six, or the complexity of scheduling with communication delays","publication_year":1994,"publication_date":"1994-10-01","ids":{"openalex":"https://openalex.org/W2169878774","doi":"https://doi.org/10.1016/0167-6377(94)90024-8","mag":"2169878774"},"language":"en","primary_location":{"id":"doi:10.1016/0167-6377(94)90024-8","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0167-6377(94)90024-8","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/A5007204231","display_name":"J.A. Hoogeveen","orcid":null},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"J.A. Hoogeveen","raw_affiliation_strings":["Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057978522","display_name":"Jan Karel Lenstra","orcid":null},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"J.K. Lenstra","raw_affiliation_strings":["Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5017885019","display_name":"Bart Veltman","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"B. Veltman","raw_affiliation_strings":["ORTEC Consultants BV, Groningenweg 6-02, 2803 PV Gouda, Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ORTEC Consultants BV, Groningenweg 6-02, 2803 PV Gouda, Netherlands","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5057978522"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":{"value":2760,"currency":"USD","value_usd":2760},"apc_paid":null,"fwci":11.3246,"has_fulltext":false,"cited_by_count":95,"citation_normalized_percentile":{"value":0.98659187,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"16","issue":"3","first_page":"129","last_page":"137"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998999834060669,"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.9998999834060669,"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.9940000176429749,"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.9932000041007996,"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/time-complexity","display_name":"Time complexity","score":0.6558303833007812},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.603698194026947},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5962671637535095},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.571901798248291},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5085264444351196},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4821864664554596},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.464127779006958},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.45011624693870544},{"id":"https://openalex.org/keywords/np-complete","display_name":"NP-complete","score":0.44084277749061584},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4394555687904358},{"id":"https://openalex.org/keywords/due-date","display_name":"Due date","score":0.4242589473724365},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4173009395599365},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35582518577575684},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.33930280804634094},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30680081248283386}],"concepts":[{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6558303833007812},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.603698194026947},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5962671637535095},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.571901798248291},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5085264444351196},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4821864664554596},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.464127779006958},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45011624693870544},{"id":"https://openalex.org/C122749075","wikidata":"https://www.wikidata.org/wiki/Q215206","display_name":"NP-complete","level":3,"score":0.44084277749061584},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4394555687904358},{"id":"https://openalex.org/C3019208289","wikidata":"https://www.wikidata.org/wiki/Q56612115","display_name":"Due date","level":3,"score":0.4242589473724365},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4173009395599365},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35582518577575684},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33930280804634094},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30680081248283386},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"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":5,"locations":[{"id":"doi:10.1016/0167-6377(94)90024-8","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0167-6377(94)90024-8","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:oai:pure.tue.nl:publications/58a861cd-8821-4584-b271-feee9c65d810","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/58a861cd-8821-4584-b271-feee9c65d810","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Hoogeveen, J A, Lenstra, J K & Veltman, B 1994, 'Three, four, five, six, or the complexity of scheduling with communication delays', Operations Research Letters, vol. 16, no. 3, pp. 129-137. https://doi.org/10.1016/0167-6377(94)90024-8","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:403142","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=403142","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"External research report"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/f349bdc8-64c0-4ad0-aca5-ed70bd3fd066","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/f349bdc8-64c0-4ad0-aca5-ed70bd3fd066","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Hoogeveen, J A, Lenstra, J K & Veltman, B 1992, Three, four, five, six, or the complexity of scheduling with communication delays. CWI report. BS-R, vol. 9229, Centrum voor Wiskunde en Informatica, Amsterdam.","raw_type":"info:eu-repo/semantics/report"},{"id":"pmh:tue:oai:pure.tue.nl:publications/58a861cd-8821-4584-b271-feee9c65d810","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/58a861cd-8821-4584-b271-feee9c65d810","pdf_url":null,"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Operations Research Letters, 16(3), 129 - 137. Elsevier","raw_type":"info:eu-repo/semantics/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/W1488422606","https://openalex.org/W1826268072","https://openalex.org/W1963547452","https://openalex.org/W1985059007","https://openalex.org/W1989582918","https://openalex.org/W2078031780","https://openalex.org/W2148654963","https://openalex.org/W2150446509","https://openalex.org/W2158923044","https://openalex.org/W2581172100","https://openalex.org/W4298262456","https://openalex.org/W6646348985"],"related_works":["https://openalex.org/W2048358792","https://openalex.org/W2620541949","https://openalex.org/W2915050772","https://openalex.org/W196928694","https://openalex.org/W1589381382","https://openalex.org/W961142965","https://openalex.org/W1963587549","https://openalex.org/W2030493804","https://openalex.org/W2169878774","https://openalex.org/W2030437622"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-20T22:02:38.213706","created_date":"2025-10-10T00:00:00"}