{"id":"https://openalex.org/W7225405486","doi":"https://doi.org/10.5281/zenodo.23995048","title":"Precedence-constrained Scheduling of Unit Jobs is Polynomial for Every Fixed Number of Machines","display_name":"Precedence-constrained Scheduling of Unit Jobs is Polynomial for Every Fixed Number of Machines","publication_year":2026,"publication_date":"2026-11-06","ids":{"openalex":"https://openalex.org/W7225405486","doi":"https://doi.org/10.5281/zenodo.23995048"},"language":"en","primary_location":{"id":"doi:10.5281/zenodo.23995048","doi":"https://doi.org/10.5281/zenodo.23995048","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.23995048","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.5281/zenodo.23995048","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5157899164","display_name":"Samson Fraser","orcid":"https://orcid.org/0009-0004-7671-9756","observed_orcids":["https://orcid.org/0009-0004-7671-9756"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Fraser, Samson","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0009-0004-7671-9756","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5157899164"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.8593999743461609,"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.8593999743461609,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.06849999725818634,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.0340999998152256,"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/precedence-constrained-scheduling","display_name":"precedence-constrained scheduling","score":0.8220000267028809},{"id":"https://openalex.org/keywords/makespan-minimization","display_name":"makespan minimization","score":0.9779999852180481},{"id":"https://openalex.org/keywords/identical-parallel-machines","display_name":"identical parallel machines","score":0.6890000104904175},{"id":"https://openalex.org/keywords/polynomial-time-algorithms","display_name":"polynomial-time algorithms","score":0.7910000085830688},{"id":"https://openalex.org/keywords/w-2-hardness","display_name":"W[2]-hardness","score":0.9879999756813049},{"id":"https://openalex.org/keywords/matrix-multiplication-exponent","display_name":"matrix multiplication exponent","score":0.5929999947547913},{"id":"https://openalex.org/keywords/lean-4-formalization","display_name":"Lean 4 formalization","score":0.6859999895095825},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"dynamic programming","score":0.5289999842643738},{"id":"https://openalex.org/keywords/multitape-turing-machines","display_name":"multitape Turing machines","score":0.5669999718666077},{"id":"https://openalex.org/keywords/fixed-parameter-tractability","display_name":"fixed-parameter tractability","score":0.675000011920929},{"id":"https://openalex.org/keywords/open-problem-resolution","display_name":"open problem resolution","score":0.382999986410141}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7261999845504761},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5989999771118164},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.5458999872207642},{"id":"https://openalex.org/C2780388253","wikidata":"https://www.wikidata.org/wiki/Q5421508","display_name":"Exponent","level":2,"score":0.512499988079071},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4909000098705292},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48559999465942383},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.47769999504089355},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.44830000400543213},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43799999356269836},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.41679999232292175},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4011000096797943},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.3799000084400177},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.3513999879360199},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33889999985694885},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30809998512268066},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.3059000074863434},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.29319998621940613},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.287200003862381},{"id":"https://openalex.org/C2780271269","wikidata":"https://www.wikidata.org/wiki/Q19295956","display_name":"Single-machine scheduling","level":4,"score":0.275299996137619},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.27489998936653137},{"id":"https://openalex.org/C9870796","wikidata":"https://www.wikidata.org/wiki/Q490481","display_name":"Turing","level":2,"score":0.27250000834465027},{"id":"https://openalex.org/C2776484797","wikidata":"https://www.wikidata.org/wiki/Q7096412","display_name":"Open shop","level":5,"score":0.2694999873638153},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.2678000032901764},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.2648000121116638},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.2590000033378601},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2565000057220459},{"id":"https://openalex.org/C122637931","wikidata":"https://www.wikidata.org/wiki/Q118084","display_name":"Unit (ring theory)","level":2,"score":0.25279998779296875},{"id":"https://openalex.org/C3019208289","wikidata":"https://www.wikidata.org/wiki/Q56612115","display_name":"Due date","level":3,"score":0.251800000667572}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.5281/zenodo.23995048","doi":"https://doi.org/10.5281/zenodo.23995048","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.23995048","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},{"id":"doi:10.5281/zenodo.23995049","doi":"https://doi.org/10.5281/zenodo.23995049","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.23995049","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.5281/zenodo.23995048","doi":"https://doi.org/10.5281/zenodo.23995048","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.23995048","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4290057610","https://openalex.org/W7225017717","https://openalex.org/W7118095031","https://openalex.org/W3020830251","https://openalex.org/W29711632","https://openalex.org/W2065962833","https://openalex.org/W2075408660","https://openalex.org/W2019712172","https://openalex.org/W2074798342","https://openalex.org/W170327819"],"abstract_inverted_index":{"SummaryIn":[0],"the":[1,39,64,123,129,146,166,170,174,220,261,281,285,310,353,362],"scheduling":[2],"problem":[3,56,130,217],"P_m":[4],"|":[5,10],"prec,":[6],"p_j":[7],"=":[8,137,240,255],"1":[9],"C_max,":[11],"n":[12],"jobs":[13],"of":[14,73,102,109,128,200,222,296,330],"unit":[15],"length,":[16],"subject":[17],"to":[18,28,37,99,361],"precedence":[19],"constraints":[20],"given":[21],"by":[22,57,173,219,323,327,333,340],"a":[23,79,87,118,208,290,293,334],"directed":[24],"acyclic":[25],"graph,":[26],"are":[27,177,356],"be":[29],"scheduled":[30],"on":[31,93,371,377],"m":[32,115,164,190,197,254,267],"identical":[33],"machines":[34,84,110,145,223],"so":[35],"as":[36,53,198],"minimize":[38],"makespan.":[40],"The":[41,48,156,216,319,366],"two-machine":[42],"case":[43,50],"was":[44,51,375],"solved":[45],"in":[46,61,131,153,163,207,226,273,303,358],"1969\u20131972.":[47],"three-machine":[49],"listed":[52],"an":[54,342,386],"open":[55,68],"Garey":[58],"and":[59,63,96,125,292,316,339,352,385],"Johnson":[60],"1979,":[62],"complexity":[65],"has":[66],"been":[67],"for":[69,82,188,264],"every":[70,100,114,265],"constant":[71],"number":[72,101,108,221],"machines.":[74,103,259],"In":[75],"2026":[76],"OpenAI":[77],"released":[78],"polynomial-time":[80],"algorithm":[81,187,194,271],"three":[83,144],"together":[85],"with":[86,151,212,253,306,380],"Lean":[88,304,359],"formalization.":[89],"This":[90],"work":[91],"builds":[92],"that":[94,195],"development":[95,320],"extends":[97],"it":[98,229,233],"Main":[104],"results":[105],"Every":[106],"fixed":[107,266],"(Theorem":[111,191,244],"1.1).":[112],"For":[113,143,348],"\u2265":[116,268],"1,":[117],"multitape":[119],"Turing":[120],"machine":[121],"solves":[122],"optimization":[124],"deadline":[126],"versions":[127],"C_m":[132],"(|x|+2)^{d_m}":[133],"steps,":[134],"where":[135,278],"d_m":[136],"70m\u00b2":[138],"+":[139,141,257],"247m":[140],"10.":[142],"exponent":[147,157,287],"is":[148,158,224,230,234,280,301,321,369],"1376,":[149],"compared":[150],"150020":[152],"OpenAI\u2019s":[154],"statement.":[155],"quadratic":[159,294],"rather":[160,182],"than":[161,183],"cubic":[162],"because":[165],"formula":[167],"leaves":[168],"describing":[169],"sets":[171],"handled":[172],"dynamic":[175],"program":[176],"counted":[178],"per":[179],"list":[180],"entry":[181],"uniformly.":[184],"A":[185,246],"single":[186],"all":[189],"1.2).":[192],"One":[193],"receives":[196],"part":[199],"its":[201],"input":[202],"runs":[203,272],"within":[204],"f(m)\u00b7(n+|E|+1)^{56m\u00b2+199m+7}":[205],"steps":[206],"RAM":[209],"cost":[210,354,364],"model":[211],"declared":[213,363],"operation":[214],"prices.":[215],"parameterized":[218],"therefore":[225],"XP.":[227],"Since":[228],"W[2]-hard":[231],"(Bodlaender\u2013Fellows),":[232],"not":[235],"fixed-parameter":[236],"tractable":[237],"unless":[238],"FPT":[239],"W[2].":[241],"Lower":[242],"bound":[243,355,368],"1.4).":[245],"direct":[247],"reduction":[248,374],"from":[249],"k-Clique":[250,262],"produces":[251],"instances":[252,379],"k":[256],"3":[258],"Under":[260],"hypothesis,":[263],"8":[269],"no":[270,317],"time":[274],"O(n^{\u03c9(m\u22123)/9":[275],"\u2212":[276],"\u03b4}),":[277],"\u03c9":[279],"matrix-multiplication":[282],"exponent.":[283],"So":[284],"optimal":[286],"lies":[288],"between":[289],"linear":[291],"function":[295],"m.":[297],"Verification":[298],"Theorem":[299,349],"1.1":[300],"proved":[302,370],"4":[305],"Mathlib,":[307],"using":[308],"only":[309],"standard":[311],"axioms":[312],"(propext,":[313],"Classical.choice,":[314],"Quot.sound)":[315],"sorry.":[318],"re-checked":[322],"Lean\u2019s":[324],"kernel":[325,337,344],"module":[326,328],"(87":[329],"87":[331],"modules),":[332],"full":[335],"from-scratch":[336],"replay,":[338],"nanoda,":[341],"independent":[343,382,387],"implementation":[345],"(26,329":[346],"declarations).":[347],"1.2,":[350],"correctness":[351],"checked":[357,376],"relative":[360],"model.":[365],"lower":[367],"paper.":[372],"Its":[373],"419":[378],"two":[381],"SAT":[383],"solvers":[384],"re-implementation.":[388]},"counts_by_year":[],"updated_date":"2026-11-08T12:12:28.789561","created_date":"2026-11-07T00:00:00"}