{"id":"https://openalex.org/W2076358787","doi":"https://doi.org/10.1137/s009753970037727x","title":"Scheduling with AND/OR Precedence Constraints","display_name":"Scheduling with AND/OR Precedence Constraints","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W2076358787","doi":"https://doi.org/10.1137/s009753970037727x","mag":"2076358787"},"language":"en","primary_location":{"id":"doi:10.1137/s009753970037727x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s009753970037727x","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/A5001357515","display_name":"Rolf H. M\u00f6hring","orcid":"https://orcid.org/0000-0003-3766-8728"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Rolf H. M\u00f6hring","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055693054","display_name":"Martin Skutella","orcid":"https://orcid.org/0000-0002-9814-1703"},"institutions":[{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"funder","lineage":["https://openalex.org/I149899117"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Martin Skutella","raw_affiliation_strings":["Algorithms and Complexity, MPI for Informatics, Max Planck Society"],"affiliations":[{"raw_affiliation_string":"Algorithms and Complexity, MPI for Informatics, Max Planck Society","institution_ids":["https://openalex.org/I149899117"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056687879","display_name":"Frederik Stork","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Frederik Stork","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5001357515"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.2332,"has_fulltext":false,"cited_by_count":104,"citation_normalized_percentile":{"value":0.9319889,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"33","issue":"2","first_page":"393","last_page":"415"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9951000213623047,"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.9951000213623047,"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.6774331331253052},{"id":"https://openalex.org/keywords/transitive-relation","display_name":"Transitive relation","score":0.5951215028762817},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5721546411514282},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5198986530303955},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5087276101112366},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4939575791358948},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.45979756116867065},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3744301199913025},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.29886573553085327},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2814989686012268},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08592566847801208}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6774331331253052},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.5951215028762817},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5721546411514282},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5198986530303955},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5087276101112366},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4939575791358948},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.45979756116867065},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3744301199913025},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29886573553085327},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2814989686012268},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08592566847801208},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s009753970037727x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s009753970037727x","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.63.1226","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.63.1226","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.tu-berlin.de/~skutella/andor.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5799999833106995,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W178659373","https://openalex.org/W181716328","https://openalex.org/W424568469","https://openalex.org/W1504285833","https://openalex.org/W1514240489","https://openalex.org/W1546862091","https://openalex.org/W1596894105","https://openalex.org/W1967618612","https://openalex.org/W1968743014","https://openalex.org/W1971499713","https://openalex.org/W1975638108","https://openalex.org/W1978543710","https://openalex.org/W2009796613","https://openalex.org/W2011992362","https://openalex.org/W2019285863","https://openalex.org/W2026128612","https://openalex.org/W2038345112","https://openalex.org/W2061936891","https://openalex.org/W2064529725","https://openalex.org/W2066066900","https://openalex.org/W2067629250","https://openalex.org/W2068290327","https://openalex.org/W2069861393","https://openalex.org/W2103132686","https://openalex.org/W2112080584","https://openalex.org/W2112660220","https://openalex.org/W2142133061","https://openalex.org/W2152727633","https://openalex.org/W2288157440","https://openalex.org/W2489748212","https://openalex.org/W2788164529","https://openalex.org/W4240251632","https://openalex.org/W4250204379"],"related_works":["https://openalex.org/W1572523360","https://openalex.org/W2997221951","https://openalex.org/W2546696010","https://openalex.org/W1992741870","https://openalex.org/W3174582865","https://openalex.org/W1882733036","https://openalex.org/W3173078019","https://openalex.org/W1969740176","https://openalex.org/W1507894569","https://openalex.org/W1993538932"],"abstract_inverted_index":{"In":[0,62,128],"many":[1,113],"scheduling":[2],"applications":[3],"it":[4],"is":[5,89],"required":[6],"that":[7,108],"the":[8,44,63,72,98,124],"processing":[9],"of":[10,27,35,60,65,74,86,102,145],"some":[11,16],"job":[12],"be":[13,21,119],"postponed":[14],"until":[15],"other":[17],"job,":[18],"which":[19,54],"can":[20,55,118],"chosen":[22],"from":[23],"a":[24],"pregiven":[25],"set":[26],"alternatives,":[28],"has":[29,46],"been":[30,47],"completed.":[31],"The":[32,84],"traditional":[33,66],"concept":[34,45],"precedence":[36,52,67,104],"constraints":[37,53],"fails":[38],"to":[39,49,90,116,130,140],"model":[40,101],"such":[41],"restrictions.":[42],"Therefore,":[43],"generalized":[48],"so-called":[50],"AND/OR":[51,103],"cope":[56,141],"with":[57,142],"this":[58,87],"kind":[59],"requirement.":[61],"context":[64],"constraints,":[68],"feasibility,":[69],"transitivity,":[70],"and":[71],"computation":[73],"earliest":[75,132],"start":[76,133],"times":[77,134],"for":[78,94,97],"jobs":[79],"are":[80],"fundamental,":[81],"well-studied":[82],"problems.":[83],"purpose":[85],"paper":[88],"provide":[91],"efficient":[92],"algorithms":[93,139],"these":[95],"tasks":[96],"more":[99],"general":[100],"constraints.":[105],"We":[106],"show":[107],"feasibility":[109],"as":[110,112],"well":[111],"questions":[114],"related":[115],"transitivity":[117],"solved":[120],"by":[121],"applying":[122],"essentially":[123],"same":[125],"linear-time":[126],"algorithm.":[127],"order":[129],"compute":[131],"we":[135],"propose":[136],"two":[137],"polynomial-time":[138],"different":[143],"classes":[144],"time":[146],"distances":[147],"between":[148],"jobs.":[149]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":12},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":5}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}