{"id":"https://openalex.org/W2062989923","doi":"https://doi.org/10.1137/0216001","title":"On Stochastic Scheduling with In-Tree Precedence Constraints","display_name":"On Stochastic Scheduling with In-Tree Precedence Constraints","publication_year":1987,"publication_date":"1987-02-01","ids":{"openalex":"https://openalex.org/W2062989923","doi":"https://doi.org/10.1137/0216001","mag":"2062989923"},"language":"en","primary_location":{"id":"doi:10.1137/0216001","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0216001","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/A5103200572","display_name":"Christos H. Papadimitriou","orcid":"https://orcid.org/0009-0000-7264-8015"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Christos H. Papadimitriou","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5109219783","display_name":"John N. Tsitsiklis","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"John N. Tsitsiklis","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5103200572"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":49,"citation_normalized_percentile":{"value":0.27069073,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"16","issue":"1","first_page":"1","last_page":"6"},"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.9987000226974487,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9975000023841858,"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/independent-and-identically-distributed-random-variables","display_name":"Independent and identically distributed random variables","score":0.8059654235839844},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.6636201739311218},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6379885673522949},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5653005838394165},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.500208854675293},{"id":"https://openalex.org/keywords/infinity","display_name":"Infinity","score":0.44728416204452515},{"id":"https://openalex.org/keywords/minor","display_name":"Minor (academic)","score":0.4445209801197052},{"id":"https://openalex.org/keywords/random-variable","display_name":"Random variable","score":0.44082656502723694},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.43963199853897095},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.41043156385421753},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.39943021535873413},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.37212076783180237},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3381800055503845},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.1352747082710266}],"concepts":[{"id":"https://openalex.org/C141513077","wikidata":"https://www.wikidata.org/wiki/Q378542","display_name":"Independent and identically distributed random variables","level":3,"score":0.8059654235839844},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.6636201739311218},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6379885673522949},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5653005838394165},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.500208854675293},{"id":"https://openalex.org/C7321624","wikidata":"https://www.wikidata.org/wiki/Q205","display_name":"Infinity","level":2,"score":0.44728416204452515},{"id":"https://openalex.org/C2779760435","wikidata":"https://www.wikidata.org/wiki/Q5396169","display_name":"Minor (academic)","level":2,"score":0.4445209801197052},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.44082656502723694},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.43963199853897095},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.41043156385421753},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39943021535873413},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.37212076783180237},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3381800055503845},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.1352747082710266},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"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/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/0216001","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0216001","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.65.9654","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.65.9654","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mit.edu/people/jnt/Papers/J015-87-intree_scheduling.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.91.204","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.91.204","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://dspace.mit.edu/bitstream/1721.1/2892/1/P-1478-13692043.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.47999998927116394,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W634463279","https://openalex.org/W1983804795","https://openalex.org/W2022822977","https://openalex.org/W2027077493","https://openalex.org/W2033451942","https://openalex.org/W2077476995"],"related_works":["https://openalex.org/W2347733609","https://openalex.org/W2605475288","https://openalex.org/W2292976891","https://openalex.org/W4245457074","https://openalex.org/W2128683635","https://openalex.org/W4240383795","https://openalex.org/W2066502241","https://openalex.org/W2008809748","https://openalex.org/W2951620698","https://openalex.org/W4297848787"],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,28,46,55,64],"problem":[3],"of":[4,7,10,20,31,54,66],"optimal":[5,61],"scheduling":[6],"a":[8,17,42],"set":[9],"jobs":[11,33,67],"obeying":[12],"in-tree":[13],"precedence":[14],"constraints,":[15],"when":[16],"number":[18,65],"M":[19],"processors":[21],"is":[22,25],"available.":[23],"It":[24],"assumed":[26],"that":[27,52],"service":[29,47],"times":[30],"different":[32],"are":[34,60],"independent":[35],"identically":[36],"distributed":[37],"random":[38],"variables.":[39],"Subject":[40],"to":[41,69],"minor":[43],"assumption":[44],"on":[45],"time":[48],"distribution,":[49],"we":[50],"show":[51],"policies":[53],"\u201cHighest":[56],"Level":[57],"First\u201d":[58],"type":[59],"asymptotically,":[62],"as":[63],"tends":[68],"infinity.":[70]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":4},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}
