{"id":"https://openalex.org/W2007423330","doi":"https://doi.org/10.1137/s0097539704444440","title":"Online Scheduling of Precedence Constrained Tasks","display_name":"Online Scheduling of Precedence Constrained Tasks","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2007423330","doi":"https://doi.org/10.1137/s0097539704444440","mag":"2007423330"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539704444440","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539704444440","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/A5055734882","display_name":"Yumei Huo","orcid":"https://orcid.org/0000-0003-3550-8843"},"institutions":[{"id":"https://openalex.org/I118118575","display_name":"New Jersey Institute of Technology","ror":"https://ror.org/05e74xb87","country_code":"US","type":"education","lineage":["https://openalex.org/I118118575"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yumei Huo","raw_affiliation_strings":["New Jersey Institute of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"New Jersey Institute of Technology","institution_ids":["https://openalex.org/I118118575"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108400400","display_name":"Joseph Y.\u2010T. Leung","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Joseph Y. T. Leung","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8454,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.78001726,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"34","issue":"3","first_page":"743","last_page":"762"},"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.9991999864578247,"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.9952999949455261,"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.719170093536377},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.6847860813140869},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6716951727867126},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.6127064228057861},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.45302340388298035},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4303519129753113},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.4219357967376709},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.33059000968933105},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1528213620185852}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.719170093536377},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6847860813140869},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6716951727867126},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.6127064228057861},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.45302340388298035},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4303519129753113},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.4219357967376709},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.33059000968933105},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1528213620185852},{"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/s0097539704444440","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539704444440","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":9,"referenced_works":["https://openalex.org/W1488422606","https://openalex.org/W2011039300","https://openalex.org/W2027077493","https://openalex.org/W2028754841","https://openalex.org/W2052110143","https://openalex.org/W2058817479","https://openalex.org/W2090947986","https://openalex.org/W2092333800","https://openalex.org/W2156978792"],"related_works":["https://openalex.org/W2967782293","https://openalex.org/W2185192838","https://openalex.org/W2955323683","https://openalex.org/W1564838499","https://openalex.org/W2069961172","https://openalex.org/W2559484340","https://openalex.org/W26892725","https://openalex.org/W2165758382","https://openalex.org/W1971939018","https://openalex.org/W2140584489"],"abstract_inverted_index":{"A":[0],"fundamental":[1],"problem":[2],"in":[3,100],"scheduling":[4,9,84],"theory":[5],"is":[6,125],"that":[7,113],"of":[8,12,88],"a":[10,133],"set":[11],"n":[13],"tasks,":[14,67],"with":[15,69],"precedence":[16,71],"constraints,":[17,72],"on":[18,40],"$m":[19],"\\ge":[20],"1$":[21],"identical":[22],"and":[23,78,108,139],"parallel":[24],"processors":[25],"so":[26],"as":[27],"to":[28,82,97,127],"minimize":[29],"the":[30,35,41,51,64,79,94,137,140],"makespan":[31],"(schedule":[32],"length).":[33],"In":[34,59,91],"past,":[36],"research":[37],"has":[38,81,96],"focused":[39],"setting":[42],"whereby":[43],"all":[44],"tasks":[45,99],"are":[46,73],"available":[47],"for":[48,118,122],"processing":[49],"at":[50,54,75],"beginning":[52],"(i.e.,":[53],"time":[55],"t":[56],"=":[57],"0).":[58],"this":[60],"article":[61],"we":[62],"consider":[63,105],"situation":[65],"where":[66],"along":[68],"their":[70],"released":[74],"different":[76],"times,":[77],"scheduler":[80,95],"make":[83],"decisions":[85],"without":[86],"knowledge":[87],"future":[89],"releases.":[90],"other":[92],"words,":[93],"schedule":[98],"an":[101],"online":[102,115],"fashion.":[103],"We":[104,111],"both":[106],"preemptive":[107],"nonpreemptive":[109],"schedules.":[110],"show":[112],"optimal":[114],"algorithms":[116],"exist":[117],"some":[119],"cases,":[120],"while":[121],"others":[123],"it":[124],"impossible":[126,141],"have":[128],"one.":[129],"Our":[130],"results":[131],"give":[132],"sharp":[134],"boundary":[135],"delineating":[136],"possible":[138],"cases.":[142]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}