{"id":"https://openalex.org/W2055945959","doi":"https://doi.org/10.1137/120902288","title":"Online Scheduling with General Cost Functions","display_name":"Online Scheduling with General Cost Functions","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W2055945959","doi":"https://doi.org/10.1137/120902288","mag":"2055945959"},"language":"en","primary_location":{"id":"doi:10.1137/120902288","is_oa":false,"landing_page_url":"https://doi.org/10.1137/120902288","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/A5006392819","display_name":"Sungjin Im","orcid":"https://orcid.org/0000-0001-5994-7280"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sungjin Im","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044201440","display_name":"Benjamin Moseley","orcid":"https://orcid.org/0000-0001-8162-017X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Benjamin Moseley","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5046525615","display_name":"Kirk Pruhs","orcid":"https://orcid.org/0000-0001-5680-1753"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kirk Pruhs","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0797,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.80969447,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"43","issue":"1","first_page":"126","last_page":"143"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9937999844551086,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9718999862670898,"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/scheduling","display_name":"Scheduling (production processes)","score":0.6089249849319458},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5581075549125671},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5364865064620972},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5090265274047852},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.4811212122440338},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.47410231828689575},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.45495787262916565},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.44530245661735535},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3532443046569824},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3293323516845703},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.25551164150238037}],"concepts":[{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6089249849319458},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5581075549125671},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5364865064620972},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5090265274047852},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.4811212122440338},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.47410231828689575},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.45495787262916565},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.44530245661735535},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3532443046569824},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3293323516845703},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.25551164150238037},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"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":2,"locations":[{"id":"doi:10.1137/120902288","is_oa":false,"landing_page_url":"https://doi.org/10.1137/120902288","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.231.9464","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.231.9464","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://siam.omnibooksonline.com/2012SODA/data/papers/053.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6100000143051147,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1970286891","https://openalex.org/W1972337144","https://openalex.org/W1972868674","https://openalex.org/W2067139730","https://openalex.org/W2075653507","https://openalex.org/W2079538592","https://openalex.org/W2112288559","https://openalex.org/W2155603250"],"related_works":["https://openalex.org/W2564742953","https://openalex.org/W4213299358","https://openalex.org/W2793095688","https://openalex.org/W1623410360","https://openalex.org/W3115340459","https://openalex.org/W2950803469","https://openalex.org/W4390203503","https://openalex.org/W2797898895","https://openalex.org/W2131569046","https://openalex.org/W2045215405"],"abstract_inverted_index":{"We":[0,54,73],"consider":[1],"a":[2],"general":[3,52],"online":[4],"scheduling":[5,45,58],"problem":[6],"where":[7,16],"the":[8,19,26,30,33,57,80],"goal":[9],"is":[10,18,25,37,64],"to":[11],"minimize":[12],"$\\sum_j":[13],"w_j":[14],"g(F_j)$,":[15],"$w_j$":[17],"weight/importance":[20],"of":[21,29,50],"job":[22,31],"$J_j$,":[23],"$F_j$":[24],"flow":[27],"time":[28],"in":[32,97],"schedule,":[34],"and":[35,83],"$g$":[36,71],"an":[38],"arbitrary":[39],"nondecreasing":[40],"cost":[41,69],"function.":[42],"Numerous":[43],"natural":[44],"objectives":[46],"are":[47,86,95],"special":[48,99],"cases":[49],"this":[51,84],"framework.":[53],"show":[55,78,91],"that":[56,77,79,92],"algorithm":[59,82],"Highest":[60],"Density":[61],"First":[62],"(HDF)":[63],"$(2+\\epsilon)$-speed":[65],"$O(1)$-competitive":[66],"for":[67],"all":[68],"functions":[70],"simultaneously.":[72],"give":[74],"lower":[75],"bounds":[76],"HDF":[81],"analysis":[85],"essentially":[87],"optimal.":[88],"Finally,":[89],"we":[90],"scalable":[93],"algorithms":[94],"achievable":[96],"some":[98],"cases.":[100]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}