{"id":"https://openalex.org/W2000431286","doi":"https://doi.org/10.1137/0214047","title":"Scheduling Flat Graphs","display_name":"Scheduling Flat Graphs","publication_year":1985,"publication_date":"1985-08-01","ids":{"openalex":"https://openalex.org/W2000431286","doi":"https://doi.org/10.1137/0214047","mag":"2000431286"},"language":"en","primary_location":{"id":"doi:10.1137/0214047","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0214047","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5013225896","display_name":"Danny Dolev","orcid":"https://orcid.org/0000-0001-8853-0644"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Danny Dolev","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5108549518","display_name":"Manfred K. Warmuth","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Manfred Warmuth","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5013225896"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.23806254,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":{"value":0.94237033,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"14","issue":"3","first_page":"638","last_page":"657"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998000264167786,"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.9998000264167786,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9807999730110168,"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/T12288","display_name":"Optimization and Search Problems","score":0.9779000282287598,"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/computer-science","display_name":"Computer science","score":0.6566754579544067},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5391128063201904},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.522931694984436},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5014524459838867},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.45820119976997375},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4106411039829254},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33188480138778687},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.322759211063385},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3204864263534546},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3194293975830078}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6566754579544067},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5391128063201904},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.522931694984436},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5014524459838867},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.45820119976997375},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4106411039829254},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33188480138778687},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.322759211063385},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3204864263534546},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3194293975830078},{"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.1137/0214047","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0214047","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W7284799","https://openalex.org/W634463279","https://openalex.org/W1487184349","https://openalex.org/W1488422606","https://openalex.org/W1655990431","https://openalex.org/W1996256520","https://openalex.org/W2005751233","https://openalex.org/W2011039300","https://openalex.org/W2018342998","https://openalex.org/W2027077493","https://openalex.org/W2057392949","https://openalex.org/W2059109315","https://openalex.org/W2060983467","https://openalex.org/W2065698702","https://openalex.org/W2092333800","https://openalex.org/W2115599154","https://openalex.org/W2150446509"],"related_works":["https://openalex.org/W3172150420","https://openalex.org/W2107725657","https://openalex.org/W2112121444","https://openalex.org/W2509452605","https://openalex.org/W3112689649","https://openalex.org/W2148608945","https://openalex.org/W2101020326","https://openalex.org/W2808535280","https://openalex.org/W3204654320","https://openalex.org/W1966261337"],"abstract_inverted_index":{"The":[0],"problem":[1],"of":[2,8,31,41,44,51,57,87,96,105,118],"scheduling":[3],"a":[4,27,127],"partially":[5],"ordered":[6],"set":[7],"unit":[9],"length":[10],"tasks":[11,77],"on":[12,54,152],"m":[13],"identical":[14],"processors":[15,53,119],"is":[16,120],"known":[17],"to":[18,63,70,80,100,112,144],"be":[19],"NP-complete.":[20],"There":[21],"are":[22],"efficient":[23],"algorithms":[24,114,146],"for":[25,147],"only":[26,75,137],"few":[28],"special":[29],"cases":[30,97],"this":[32,35,141],"problem.":[33],"In":[34,130],"paper":[36],"we":[37,98],"analyze":[38],"the":[39,42,45,49,52,55,81,88,94,103,116,123,133],"effect":[40],"structure":[43],"precedence":[46,89,124,134],"graph":[47,125,135],"and":[48,122,139],"availability":[50],"construction":[56,104],"optimal":[58,66,107,150],"schedules.":[59],"We":[60],"prove":[61],"that":[62],"find":[64],"an":[65,106,149],"schedule":[67,151],"it":[68],"suffices":[69],"consider":[71],"at":[72],"each":[73],"step":[74],"initial":[76],"which":[78],"belong":[79],"$m":[82],"-":[83],"1$":[84],"highest":[85],"components":[86],"graph.":[90],"This":[91],"result":[92,142],"reduces":[93],"number":[95,117],"have":[99],"check":[101],"during":[102],"schedule.":[108],"Our":[109],"method":[110],"leads":[111,143],"polynomial":[113],"if":[115,132],"fixed":[121],"has":[126],"certain":[128],"form.":[129],"particular,":[131],"contains":[136],"intrees":[138],"outtrees,":[140],"linear":[145],"finding":[148],"two":[153],"or":[154],"three":[155],"processors.":[156]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}