{"id":"https://openalex.org/W2076433109","doi":"https://doi.org/10.1137/s009753970343395x","title":"Better Online Algorithms for Scheduling with Machine Cost","display_name":"Better Online Algorithms for Scheduling with Machine Cost","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W2076433109","doi":"https://doi.org/10.1137/s009753970343395x","mag":"2076433109"},"language":"en","primary_location":{"id":"doi:10.1137/s009753970343395x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s009753970343395x","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/A5069718437","display_name":"Gy\u00f6rgy D\u00f3sa","orcid":"https://orcid.org/0000-0002-4909-6694"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Gy\u00f6rgy D\u00f3sa","raw_affiliation_strings":["Pannon University"],"affiliations":[{"raw_affiliation_string":"Pannon University","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101940833","display_name":"Yong He","orcid":"https://orcid.org/0000-0001-7919-890X"},"institutions":[{"id":"https://openalex.org/I76130692","display_name":"Zhejiang University","ror":"https://ror.org/00a2xv884","country_code":"CN","type":"education","lineage":["https://openalex.org/I76130692"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yong He","raw_affiliation_strings":["Department of Mathematics, Zhejiang University, Hangzhou, P.R. China#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Zhejiang University, Hangzhou, P.R. China#TAB#","institution_ids":["https://openalex.org/I76130692"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5069718437"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.7847,"has_fulltext":false,"cited_by_count":30,"citation_normalized_percentile":{"value":0.96189118,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"33","issue":"5","first_page":"1035","last_page":"1051"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9997000098228455,"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/T11182","display_name":"Auction Theory and Applications","score":0.9872999787330627,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.9124516844749451},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.7553249597549438},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.7085951566696167},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.658720076084137},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6473532915115356},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5781588554382324},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5726420283317566},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4322700500488281},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4130197763442993},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2615543007850647},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.17541846632957458}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.9124516844749451},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.7553249597549438},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.7085951566696167},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.658720076084137},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6473532915115356},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5781588554382324},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5726420283317566},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4322700500488281},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4130197763442993},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2615543007850647},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.17541846632957458},{"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/s009753970343395x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s009753970343395x","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":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.49000000953674316}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1876899120","https://openalex.org/W1966527086","https://openalex.org/W1971354639","https://openalex.org/W1982084418","https://openalex.org/W1992125546","https://openalex.org/W1993134505","https://openalex.org/W1996869102","https://openalex.org/W2008793458","https://openalex.org/W2013144881","https://openalex.org/W2021598206","https://openalex.org/W2022260726","https://openalex.org/W2027593932","https://openalex.org/W2058817479","https://openalex.org/W2060023372","https://openalex.org/W2081075075","https://openalex.org/W2089269509","https://openalex.org/W2092031801","https://openalex.org/W2104680817","https://openalex.org/W4210281823"],"related_works":["https://openalex.org/W4213299358","https://openalex.org/W2564742953","https://openalex.org/W2793095688","https://openalex.org/W1623410360","https://openalex.org/W3115340459","https://openalex.org/W4390751688","https://openalex.org/W4390203503","https://openalex.org/W2797898895","https://openalex.org/W2131569046","https://openalex.org/W2045215405"],"abstract_inverted_index":{"For":[0,41],"most":[1,111,157],"scheduling":[2,32],"problems":[3,33],"the":[4,15,18,26,36,74,77,88,91,115,133,160,169],"set":[5],"of":[6,17,28,49,90,95],"machines":[7,64],"is":[8,72,85,129],"fixed":[9],"initially":[10,66],"and":[11,22,34,68,93],"remains":[12],"unchanged":[13],"for":[14,121,159],"duration":[16],"problem.":[19,40],"Recently":[20],"Imreh":[21],"Noga":[23],"proposed":[24],"adding":[25],"concept":[27],"machine":[29,134],"cost":[30,94],"to":[31,79,86],"considered":[35],"so-called":[37],"list":[38],"model":[39],"this":[42,98],"problem,":[43],"we":[44,100,136,148],"are":[45,65],"given":[46],"a":[47,61,70,107,122,143,153],"sequence":[48],"independent":[50],"jobs":[51],"with":[52,106,142,152,163],"positive":[53],"sizes,":[54],"which":[55,113,167],"must":[56],"be":[57],"processed":[58],"nonpreemptively":[59],"on":[60],"machine.":[62],"No":[63],"provided,":[67],"when":[69],"job":[71,127],"revealed":[73],"algorithm":[75,105,141,151],"has":[76],"option":[78],"purchase":[80],"new":[81],"machines.":[82,96],"The":[83],"objective":[84],"minimize":[87],"sum":[89],"makespan":[92],"In":[97],"paper,":[99],"first":[101],"present":[102,137,149],"an":[103,138,150],"online":[104,140],"competitive":[108,144,154],"ratio":[109,145,155],"at":[110,156],"1.5798,":[112],"improves":[114,168],"known":[116,164,170],"upper":[117,171],"bound":[118,172],"1.618.":[119],"Then":[120],"special":[123],"case":[124],"where":[125],"every":[126],"size":[128],"no":[130],"greater":[131],"than":[132],"cost,":[135],"optimal":[139],"4/3.":[146],"Last,":[147],"3/2":[158],"semionline":[161],"problem":[162],"largest":[165],"size,":[166],"1.5309.":[173]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":1}],"updated_date":"2026-03-30T08:08:38.191290","created_date":"2025-10-10T00:00:00"}