{"id":"https://openalex.org/W2111244700","doi":"https://doi.org/10.1287/opre.17.6.941","title":"Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm","display_name":"Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm","publication_year":1969,"publication_date":"1969-12-01","ids":{"openalex":"https://openalex.org/W2111244700","doi":"https://doi.org/10.1287/opre.17.6.941","mag":"2111244700"},"language":"en","primary_location":{"id":"doi:10.1287/opre.17.6.941","doi":"https://doi.org/10.1287/opre.17.6.941","is_oa":false,"landing_page_url":"https://doi.org/10.1287/opre.17.6.941","pdf_url":null,"source":{"id":"https://openalex.org/S125775545","display_name":"Operations Research","issn_l":"0030-364X","issn":["0030-364X","1526-5463"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["abdc-a-star","anvur-class-a","anvur-scientific","cwts-core","fnege-1-star","ft50","jufo-3","norway-2","poland-140","russia-white-list-1","utd24","vabb-shw"],"host_organization":"https://openalex.org/P4310315699","host_organization_name":"Institute for Operations Research and the Management Sciences","host_organization_lineage":["https://openalex.org/P4310315699"],"host_organization_lineage_names":["Institute for Operations Research and the Management Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operations Research","raw_type":"journal-article"},"volume":null,"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/A5072070820","display_name":"Egon Balas","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Egon Balas","raw_affiliation_strings":["Carnegie-Mellon University, Pittsburgh, Pennsylvania"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie-Mellon University, Pittsburgh, Pennsylvania","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5072070820"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":31.3056,"has_fulltext":false,"cited_by_count":406,"citation_normalized_percentile":{"value":0.9928952,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"17","issue":"6","first_page":"941","last_page":"957"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9955999851226807,"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.9955999851226807,"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/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.002300000051036477,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0003000000142492354,"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/machine-sequencing","display_name":"machine sequencing","score":0.9810000061988831},{"id":"https://openalex.org/keywords/disjunctive-graph","display_name":"disjunctive graph","score":0.9670000076293945},{"id":"https://openalex.org/keywords/implicit-enumeration","display_name":"implicit enumeration","score":0.9369999766349792},{"id":"https://openalex.org/keywords/search-tree-pruning","display_name":"search tree pruning","score":0.7089999914169312},{"id":"https://openalex.org/keywords/production-scheduling","display_name":"production scheduling","score":0.5960000157356262}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6752423644065857},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.6719042062759399},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5768927931785583},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5642656683921814},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.553281843662262},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.500037670135498},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.49254927039146423},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.41638386249542236},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4138965308666229},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4039537310600281},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34112730622291565},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3015912175178528},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.21094676852226257},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.16699951887130737},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"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/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1287/opre.17.6.941","doi":"https://doi.org/10.1287/opre.17.6.941","is_oa":false,"landing_page_url":"https://doi.org/10.1287/opre.17.6.941","pdf_url":null,"source":{"id":"https://openalex.org/S125775545","display_name":"Operations Research","issn_l":"0030-364X","issn":["0030-364X","1526-5463"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["abdc-a-star","anvur-class-a","anvur-scientific","cwts-core","fnege-1-star","ft50","jufo-3","norway-2","poland-140","russia-white-list-1","utd24","vabb-shw"],"host_organization":"https://openalex.org/P4310315699","host_organization_name":"Institute for Operations Research and the Management Sciences","host_organization_lineage":["https://openalex.org/P4310315699"],"host_organization_lineage_names":["Institute for Operations Research and the Management Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operations Research","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1548540712","https://openalex.org/W2024085737","https://openalex.org/W2099782395","https://openalex.org/W2100890245","https://openalex.org/W2134098988","https://openalex.org/W2137245272","https://openalex.org/W2150322710","https://openalex.org/W2166928920","https://openalex.org/W2169188188","https://openalex.org/W2169849417"],"related_works":["https://openalex.org/W2132921321","https://openalex.org/W2065006817","https://openalex.org/W2129550502","https://openalex.org/W2116465486","https://openalex.org/W2101572961","https://openalex.org/W1995629993","https://openalex.org/W2541062292","https://openalex.org/W1759713541","https://openalex.org/W2551933747","https://openalex.org/W2045633099"],"abstract_inverted_index":{"One":[0],"formulation":[1],"of":[2,9,33,52,97,139,160],"the":[3,27,47,53,74,77,104,118,140,153,157,161],"machine":[4],"sequencing":[5],"problem":[6,28,42],"is":[7,55,69,100],"that":[8,25,76,81],"finding":[10],"a":[11,15,31,38,92,143],"mini-maximal":[12],"path":[13],"in":[14,46,122],"disjunctive":[16,64,79],"graph.":[17],"This":[18],"paper":[19],"describes":[20],"an":[21,58],"implicit":[22],"enumeration":[23],"procedure":[24,110],"solves":[26],"by":[29,61,73,126],"generating":[30],"sequence":[32,54],"circuit-free":[34],"graphs":[35],"and":[36,129],"solving":[37],"slightly":[39],"amended":[40],"critical-path":[41],"for":[43,86],"each":[44,107],"graph":[45],"sequence.":[48],"Each":[49],"new":[50],"term":[51],"generated":[56,125],"from":[57],"earlier":[59],"one":[60,63,119,134],"complementing":[62],"arc.":[65],"The":[66,109],"search":[67,105,162],"tree":[68],"drastically":[70],"cut":[71],"down":[72],"fact":[75],"only":[78],"arcs":[80],"have":[82],"to":[83,102,152,156],"be":[84],"considered":[85],"being":[87],"complemented":[88],"are":[89,150],"those":[90],"on":[91],"critical":[93],"path.":[94],"An":[95],"evaluation":[96],"these":[98],"candidates":[99],"used":[101,121],"direct":[103],"at":[106],"stage.":[108],"can":[111,135],"start":[112],"with":[113,142],"any":[114],"feasible":[115,146],"schedule":[116],"(like":[117],"actually":[120],"production,":[123],"or":[124],"some":[127],"heuristics),":[128],"gradually":[130],"improve":[131],"it.":[132],"Thus":[133],"possibly":[136],"stop":[137],"short":[138],"optimum,":[141],"reasonably":[144],"\u201cgood\u201d":[145],"schedule.":[147],"Storage":[148],"requirements":[149],"limited":[151],"data":[154],"pertinent":[155],"current":[158],"node":[159],"tree.":[163]},"counts_by_year":[{"year":2026,"cited_by_count":8},{"year":2025,"cited_by_count":9},{"year":2024,"cited_by_count":20},{"year":2023,"cited_by_count":13},{"year":2022,"cited_by_count":13},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":12},{"year":2019,"cited_by_count":12},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":10},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":11},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":6}],"updated_date":"2026-10-08T09:06:37.294493","created_date":"2025-10-10T00:00:00"}