{"id":"https://openalex.org/W1978018278","doi":"https://doi.org/10.1145/1806689.1806791","title":"Conditional hardness of precedence constrained scheduling on identical machines","display_name":"Conditional hardness of precedence constrained scheduling on identical machines","publication_year":2010,"publication_date":"2010-06-05","ids":{"openalex":"https://openalex.org/W1978018278","doi":"https://doi.org/10.1145/1806689.1806791","mag":"1978018278"},"language":"en","primary_location":{"id":"doi:10.1145/1806689.1806791","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1806689.1806791","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-second ACM symposium on Theory of computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://infoscience.epfl.ch/record/228035","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5046999727","display_name":"Ola Svensson","orcid":"https://orcid.org/0000-0003-2997-1372"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Ola Svensson","raw_affiliation_strings":["KTH - Royal Institute of Technology, Stockholm, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"KTH - Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5046999727"],"corresponding_institution_ids":["https://openalex.org/I86987016"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":36,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"745","last_page":"754"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":1.0,"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":1.0,"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.9962999820709229,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9891999959945679,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.689818263053894},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6849527955055237},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.570284366607666},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5653502941131592},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.48946845531463623},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.47659963369369507},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.47040873765945435},{"id":"https://openalex.org/keywords/single-machine-scheduling","display_name":"Single-machine scheduling","score":0.4586309492588043},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.42287513613700867},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.4226633310317993},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3321874737739563},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3246622383594513},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19878768920898438},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.05329903960227966}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.689818263053894},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6849527955055237},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.570284366607666},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5653502941131592},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.48946845531463623},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.47659963369369507},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.47040873765945435},{"id":"https://openalex.org/C2780271269","wikidata":"https://www.wikidata.org/wiki/Q19295956","display_name":"Single-machine scheduling","level":4,"score":0.4586309492588043},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.42287513613700867},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.4226633310317993},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3321874737739563},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3246622383594513},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19878768920898438},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.05329903960227966},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.0},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/1806689.1806791","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1806689.1806791","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-second ACM symposium on Theory of computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.154.5046","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.154.5046","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.nada.kth.se/~osven/papers/PCmaxFull5Nov.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.179.2664","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.179.2664","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.nada.kth.se/%7Eosven/papers/PPrecCmax.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.386.2765","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.386.2765","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://algo.epfl.ch/~osven/Ola Svensson_publications/stoc10.pdf","raw_type":"text"},{"id":"pmh:oai:infoscience.epfl.ch:228035","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/228035","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"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":"Text"}],"best_oa_location":{"id":"pmh:oai:infoscience.epfl.ch:228035","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/228035","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"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":"Text"},"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.4300000071525574}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W5599802","https://openalex.org/W179016828","https://openalex.org/W1488422606","https://openalex.org/W1569458199","https://openalex.org/W1960330418","https://openalex.org/W1973538756","https://openalex.org/W1992370758","https://openalex.org/W1994739878","https://openalex.org/W2006905044","https://openalex.org/W2009990213","https://openalex.org/W2011039300","https://openalex.org/W2018342998","https://openalex.org/W2019712172","https://openalex.org/W2025235423","https://openalex.org/W2027077493","https://openalex.org/W2034689708","https://openalex.org/W2040558879","https://openalex.org/W2067297441","https://openalex.org/W2089269509","https://openalex.org/W2091602684","https://openalex.org/W2092333800","https://openalex.org/W2092438148","https://openalex.org/W2093392878","https://openalex.org/W2093979815","https://openalex.org/W2096521993","https://openalex.org/W2104680817","https://openalex.org/W2120358419","https://openalex.org/W2127277545","https://openalex.org/W2130418601","https://openalex.org/W2137118456","https://openalex.org/W2140566134","https://openalex.org/W2145075017","https://openalex.org/W2150446509","https://openalex.org/W2152490496","https://openalex.org/W2163626560","https://openalex.org/W2165799042","https://openalex.org/W6673012173"],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W2949165180","https://openalex.org/W2155809154","https://openalex.org/W2838819579","https://openalex.org/W131757205","https://openalex.org/W2533899164","https://openalex.org/W2807934311","https://openalex.org/W2057737420","https://openalex.org/W2596081411","https://openalex.org/W2384952691"],"abstract_inverted_index":{"Already":[0],"in":[1,54],"1966,":[2],"Graham":[3],"showed":[4],"that":[5],"a":[6,13,50],"simple":[7],"procedure":[8],"called":[9],"list":[10],"scheduling":[11,21,55],"yields":[12],"2-approximation":[14],"algorithm":[15,39],"for":[16],"the":[17,37],"central":[18],"problem":[19,53],"of":[20],"precedence":[22],"constrained":[23],"jobs":[24],"on":[25],"identical":[26],"machines":[27],"to":[28],"minimize":[29],"makespan.":[30],"Till":[31],"this":[32],"date":[33],"it":[34,42],"has":[35,48],"remained":[36],"best":[38],"and":[40],"whether":[41],"can":[43],"or":[44],"cannot":[45],"be":[46],"improved":[47],"become":[49],"major":[51],"open":[52],"theory.":[56]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}