{"id":"https://openalex.org/W2142932691","doi":"https://doi.org/10.1137/s0097539793248317","title":"Scheduling Parallel Machines On-Line","display_name":"Scheduling Parallel Machines On-Line","alternate_titles":[],"publication_year":1995,"publication_date":"1995-12-01","ids":{"openalex":"https://openalex.org/W2142932691","doi":"https://doi.org/10.1137/s0097539793248317","mag":"2142932691"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539793248317","doi":"https://doi.org/10.1137/s0097539793248317","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539793248317","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,"listed_in":["ccf-a","cwts-core","dongbi-a","jufo-3","norway-2","poland-200","russia-white-list-1"],"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"},"parent_works":[],"lineage":["https://openalex.org/W2142932691"],"child_works_count":0,"type":"article","is_traditional":true,"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/A5030030349","display_name":"David B. Shmoys","orcid":"https://orcid.org/0000-0003-3882-901X","observed_orcids":["https://orcid.org/0000-0003-3882-901X"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"David B. Shmoys","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048686753","display_name":"Joel M. Wein","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Joel Wein","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5043667154","display_name":"David P. Williamson","orcid":"https://orcid.org/0000-0002-2884-0058","observed_orcids":["https://orcid.org/0000-0002-2884-0058"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"David P. Williamson","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":23.2332,"has_fulltext":false,"cited_by_count":239,"citation_normalized_percentile":{"value":0.99720752,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":93,"max":99},"biblio":{"volume":"24","issue":"6","first_page":"1313","last_page":"1331"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.8413000106811523,"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.8413000106811523,"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.10100000351667404,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.007899999618530273,"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/online-scheduling","display_name":"online scheduling","score":0.8330000042915344},{"id":"https://openalex.org/keywords/parallel-machine-scheduling","display_name":"parallel machine scheduling","score":0.8399999737739563},{"id":"https://openalex.org/keywords/information-theoretic-lower-bounds","display_name":"information-theoretic lower bounds","score":0.7870000004768372},{"id":"https://openalex.org/keywords/polynomial-time-algorithms","display_name":"polynomial-time algorithms","score":0.6499999761581421},{"id":"https://openalex.org/keywords/constant-factor-approximation","display_name":"constant-factor approximation","score":0.5609999895095825},{"id":"https://openalex.org/keywords/makespan-minimization","display_name":"makespan minimization","score":0.6119999885559082}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7175317406654358},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6425496339797974},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5230606198310852},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4789191484451294},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4514726996421814},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.42969390749931335},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4120174050331116},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36961501836776733},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3595007658004761},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2676425278186798},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22812259197235107},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.17952144145965576},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08435723185539246},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539793248317","doi":"https://doi.org/10.1137/s0097539793248317","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539793248317","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,"listed_in":["ccf-a","cwts-core","dongbi-a","jufo-3","norway-2","poland-200","russia-white-list-1"],"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":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W1488422606","https://openalex.org/W1907411463","https://openalex.org/W1965437596","https://openalex.org/W1967392937","https://openalex.org/W1982084418","https://openalex.org/W1991124379","https://openalex.org/W2001447488","https://openalex.org/W2003016446","https://openalex.org/W2005845593","https://openalex.org/W2011039300","https://openalex.org/W2011670396","https://openalex.org/W2014071862","https://openalex.org/W2023146810","https://openalex.org/W2027920448","https://openalex.org/W2036711992","https://openalex.org/W2041645394","https://openalex.org/W2054042656","https://openalex.org/W2058817479","https://openalex.org/W2067753820","https://openalex.org/W2073083283","https://openalex.org/W2080316412","https://openalex.org/W2082099352","https://openalex.org/W2084263468","https://openalex.org/W2084524235","https://openalex.org/W2089269509","https://openalex.org/W2093979815","https://openalex.org/W2102201348","https://openalex.org/W2115931985","https://openalex.org/W2118232729","https://openalex.org/W2128467914","https://openalex.org/W2148102331","https://openalex.org/W2162656786","https://openalex.org/W4248986938","https://openalex.org/W4251714866"],"related_works":["https://openalex.org/W223742305","https://openalex.org/W1523416710","https://openalex.org/W1530414776","https://openalex.org/W2018025303","https://openalex.org/W2001501806","https://openalex.org/W1995217454","https://openalex.org/W7095922626","https://openalex.org/W1516512641","https://openalex.org/W2093901218","https://openalex.org/W2387673749"],"abstract_inverted_index":{"The":[0],"problem":[1],"of":[2,14,30,75,89,105],"scheduling":[3],"jobs":[4],"on":[5,72],"parallel":[6,83],"machines":[7],"is":[8,17,33,39],"studied":[9],"when":[10],"(1)":[11],"the":[12,27,37,59,73,106],"existence":[13],"a":[15,31,102],"job":[16,32,38],"not":[18,34],"known":[19,35],"until":[20,36],"its":[21],"unknown":[22],"release":[23],"date":[24],"and":[25,86],"(2)":[26],"processing":[28],"requirement":[29],"processed":[40],"to":[41],"completion.":[42],"Two":[43],"general":[44],"algorithmic":[45],"techniques":[46],"are":[47,78],"demonstrated":[48],"for":[49,80],"converting":[50],"existing":[51],"polynomial-time":[52],"algorithms":[53,63,91],"that":[54,64,96],"require":[55],"complete":[56],"knowledge":[57],"about":[58],"input":[60],"data":[61],"into":[62],"need":[65],"less":[66],"advance":[67],"knowledge.":[68],"Information-theoretic":[69],"lower":[70,107],"bounds":[71],"length":[74],"on-line":[76],"schedules":[77,93],"proven":[79],"several":[81],"basic":[82],"machine":[84],"models,":[85],"almost":[87],"all":[88],"our":[90],"construct":[92],"with":[94],"lengths":[95],"either":[97],"match":[98],"or":[99],"come":[100],"within":[101],"constant":[103],"factor":[104],"bound.":[108]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2142932691","counts_by_year":[{"year":2026,"cited_by_count":5},{"year":2025,"cited_by_count":8},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":10},{"year":2021,"cited_by_count":12},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":11},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":10},{"year":2012,"cited_by_count":6}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
