{"id":"https://openalex.org/W1995073517","doi":"https://doi.org/10.1137/100810502","title":"Hardness of Precedence Constrained Scheduling on Identical Machines","display_name":"Hardness of Precedence Constrained Scheduling on Identical Machines","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W1995073517","doi":"https://doi.org/10.1137/100810502","mag":"1995073517"},"language":"en","primary_location":{"id":"doi:10.1137/100810502","is_oa":false,"landing_page_url":"https://doi.org/10.1137/100810502","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://infoscience.epfl.ch/record/170748","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/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Ola Svensson","raw_affiliation_strings":["ola.svensson@epfl.ch#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ola.svensson@epfl.ch#TAB#","institution_ids":["https://openalex.org/I5124864"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5046999727"],"corresponding_institution_ids":["https://openalex.org/I5124864"],"apc_list":null,"apc_paid":null,"fwci":2.2425,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":{"value":0.87929663,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"40","issue":"5","first_page":"1258","last_page":"1274"},"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.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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/scheduling","display_name":"Scheduling (production processes)","score":0.6657527089118958},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.664170503616333},{"id":"https://openalex.org/keywords/single-machine-scheduling","display_name":"Single-machine scheduling","score":0.6561590433120728},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5646539330482483},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5553730726242065},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5418790578842163},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.51103675365448},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4442730247974396},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.29680073261260986},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.19518423080444336}],"concepts":[{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6657527089118958},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.664170503616333},{"id":"https://openalex.org/C2780271269","wikidata":"https://www.wikidata.org/wiki/Q19295956","display_name":"Single-machine scheduling","level":4,"score":0.6561590433120728},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5646539330482483},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5553730726242065},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5418790578842163},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.51103675365448},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4442730247974396},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.29680073261260986},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.19518423080444336},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/100810502","is_oa":false,"landing_page_url":"https://doi.org/10.1137/100810502","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.386.5375","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.386.5375","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/SICOMP11b.pdf","raw_type":"text"},{"id":"pmh:oai:infoscience.epfl.ch:170748","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/170748","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:170748","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/170748","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":[{"id":"https://metadata.un.org/sdg/8","score":0.5099999904632568,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":36,"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"],"related_works":["https://openalex.org/W2970302286","https://openalex.org/W2810352541","https://openalex.org/W3204654320","https://openalex.org/W2142195909","https://openalex.org/W1974309933","https://openalex.org/W2092240563","https://openalex.org/W2094800167","https://openalex.org/W2898780166","https://openalex.org/W1993477581","https://openalex.org/W1909205607"],"abstract_inverted_index":{"In":[0],"1966,":[1],"Graham":[2],"showed":[3],"that":[4,73,92,155],"a":[5,12,48,61,80,103,126,169],"simple":[6],"procedure":[7],"called":[8],"list":[9],"scheduling":[10,20,53,75],"yields":[11],"2-approximation":[13],"algorithm":[14],"for":[15,149],"the":[16,35,66,69,94,108,115,150,162,173],"central":[17],"problem":[18,51,58,71,97,153],"of":[19,68,74,105,117,128,172],"precedence":[21,76],"constrained":[22,77],"jobs":[23,78],"on":[24,79],"identical":[25],"machines":[26],"to":[27,83,100,123,133,138,159],"minimize":[28,84],"makespan.":[29],"To":[30],"date":[31],"this":[32,57,141],"has":[33,46],"remained":[34],"best":[36],"algorithm,":[37],"and":[38,72,144],"whether":[39],"it":[40,156],"can":[41],"or":[42],"cannot":[43],"be":[44],"improved":[45],"become":[47],"major":[49],"open":[50],"in":[52,114],"theory.":[54],"We":[55],"address":[56],"by":[59,166],"establishing":[60],"quite":[62],"surprising":[63],"relation":[64],"between":[65],"approximability":[67],"considered":[70,109],"single":[81,95,151],"machine":[82,96,111,152],"weighted":[85],"completion":[86],"time.":[87],"More":[88],"specifically,":[89],"we":[90],"prove":[91],"if":[93],"is":[98,121,157],"hard":[99,122],"approximate":[101,124],"within":[102,125],"factor":[104,127],"$2-\\epsilon$,":[106],"then":[107],"parallel":[110],"problem,":[112],"even":[113],"case":[116],"unit":[118],"processing":[119],"times,":[120],"$2-\\zeta$,":[129],"where":[130],"$\\zeta$":[131],"tends":[132,137],"0":[134],"as":[135],"$\\epsilon$":[136],"0.":[139],"Combining":[140],"with":[142],"Bansal":[143],"Khot's":[145],"recent":[146],"hardness":[147],"result":[148],"gives":[154],"NP-hard":[158],"improve":[160],"upon":[161],"approximation":[163],"ratio":[164],"obtained":[165],"Graham,":[167],"assuming":[168],"new":[170],"variant":[171],"unique":[174],"games":[175],"conjecture.":[176]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}