{"id":"https://openalex.org/W2969505808","doi":"https://doi.org/10.1080/24725854.2019.1657606","title":"Approximation algorithms for scheduling C-benevolent jobs on weighted machines","display_name":"Approximation algorithms for scheduling C-benevolent jobs on weighted machines","publication_year":2019,"publication_date":"2019-08-21","ids":{"openalex":"https://openalex.org/W2969505808","doi":"https://doi.org/10.1080/24725854.2019.1657606","mag":"2969505808"},"language":"en","primary_location":{"id":"doi:10.1080/24725854.2019.1657606","is_oa":false,"landing_page_url":"https://doi.org/10.1080/24725854.2019.1657606","pdf_url":null,"source":{"id":"https://openalex.org/S4210225672","display_name":"IISE Transactions","issn_l":"2472-5854","issn":["2472-5854","2472-5862"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IISE Transactions","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/A5101893954","display_name":"Yu Ge","orcid":"https://orcid.org/0000-0002-0654-0062"},"institutions":[{"id":"https://openalex.org/I1311688040","display_name":"Amazon (United States)","ror":"https://ror.org/04mv4n011","country_code":"US","type":"company","lineage":["https://openalex.org/I1311688040"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ge Yu","raw_affiliation_strings":["Amazon, Cambridge, MA, USA;"],"raw_orcid":"https://orcid.org/0000-0002-0654-0062","affiliations":[{"raw_affiliation_string":"Amazon, Cambridge, MA, USA;","institution_ids":["https://openalex.org/I1311688040"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018895822","display_name":"Sheldon H. Jacobson","orcid":"https://orcid.org/0000-0002-9042-8750"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sheldon H. Jacobson","raw_affiliation_strings":["Department of Computer Science, University of Illinois at Urbana Champaign, IL, USA"],"raw_orcid":"https://orcid.org/0000-0002-9042-8750","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Illinois at Urbana Champaign, IL, USA","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5018895822"],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":null,"apc_paid":null,"fwci":0.2208,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.61896098,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"52","issue":"4","first_page":"432","last_page":"443"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9993000030517578,"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.9993000030517578,"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.9993000030517578,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/greedy-algorithm","display_name":"Greedy algorithm","score":0.7217960357666016},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.6678234934806824},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6030847430229187},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5550119876861572},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5511514544487},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5067923665046692},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.46539270877838135},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.45076191425323486},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4315975308418274},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4258246421813965},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33444744348526},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.08519041538238525}],"concepts":[{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.7217960357666016},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.6678234934806824},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6030847430229187},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5550119876861572},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5511514544487},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5067923665046692},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46539270877838135},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.45076191425323486},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4315975308418274},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4258246421813965},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33444744348526},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.08519041538238525},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1080/24725854.2019.1657606","is_oa":false,"landing_page_url":"https://doi.org/10.1080/24725854.2019.1657606","pdf_url":null,"source":{"id":"https://openalex.org/S4210225672","display_name":"IISE Transactions","issn_l":"2472-5854","issn":["2472-5854","2472-5862"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IISE Transactions","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:taf:uiiexx:v:52:y:2020:i:4:p:432-443","is_oa":false,"landing_page_url":"http://hdl.handle.net/10.1080/24725854.2019.1657606","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6600000262260437,"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":21,"referenced_works":["https://openalex.org/W1507141328","https://openalex.org/W1964047916","https://openalex.org/W1980135493","https://openalex.org/W1993690929","https://openalex.org/W2022187611","https://openalex.org/W2038345112","https://openalex.org/W2046446291","https://openalex.org/W2055364146","https://openalex.org/W2058681277","https://openalex.org/W2069832779","https://openalex.org/W2094561371","https://openalex.org/W2120501415","https://openalex.org/W2123585184","https://openalex.org/W2136149017","https://openalex.org/W2136848105","https://openalex.org/W2149935414","https://openalex.org/W2153297228","https://openalex.org/W2176610120","https://openalex.org/W2592843708","https://openalex.org/W2754548199","https://openalex.org/W3163474831"],"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/W2950803469","https://openalex.org/W4390203503","https://openalex.org/W2797898895","https://openalex.org/W2131569046","https://openalex.org/W2045215405"],"abstract_inverted_index":{"This":[0],"article":[1],"considers":[2],"a":[3,30,34,136],"new":[4],"variation":[5],"of":[6,14,41,51,66,126,139,147],"the":[7,39,42,46,58,86,93,98,103,107,112,118,123,127,144],"online":[8],"interval":[9],"scheduling":[10,15,53,152],"problem,":[11],"which":[12],"consists":[13],"C-benevolent":[16,153],"jobs":[17,154],"on":[18,155],"multiple":[19],"heterogeneous":[20],"machines":[21,90,159],"with":[22,78,160],"different":[23],"positive":[24],"weights.":[25],"The":[26,49],"reward":[27,60],"for":[28,61,143,151],"completing":[29],"job":[31,43],"assigned":[32],"to":[33,56],"machine":[35,47],"is":[36,55],"given":[37],"by":[38],"product":[40],"value":[44],"and":[45,74,141,157],"weight.":[48],"objective":[50],"this":[52],"problem":[54],"maximize":[57],"total":[59],"completed":[62],"jobs.":[63],"Two":[64],"classes":[65],"approximation":[67],"algorithms":[68,73],"are":[69,91],"analyzed,":[70],"Cooperative":[71,94,113],"Greedy":[72,76,95,100,109,114,129],"Prioritized":[75,99,108,128],"algorithms,":[77],"competitive":[79,124,145],"ratios":[80,88,105,120],"provided.":[81],"We":[82,133],"show":[83],"that":[84],"when":[85],"weight":[87,104,119],"between":[89],"small,":[92],"algorithm":[96,110,130,150],"outperforms":[97,111],"algorithm.":[101,115],"As":[102],"increase,":[106],"Moreover,":[116],"as":[117],"approach":[121],"infinity,":[122],"ratio":[125,146],"approaches":[131],"four.":[132],"also":[134],"provide":[135],"lower":[137],"bound":[138],"3/2":[140],"9/7":[142],"any":[148],"deterministic":[149],"two":[156],"three":[158],"arbitrary":[161],"weights,":[162],"respectively.":[163]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}