{"id":"https://openalex.org/W2808764965","doi":"https://doi.org/10.1145/3210377.3210384","title":"A Unified Rounding Algorithm For Unrelated Machines Scheduling Problems","display_name":"A Unified Rounding Algorithm For Unrelated Machines Scheduling Problems","publication_year":2018,"publication_date":"2018-07-11","ids":{"openalex":"https://openalex.org/W2808764965","doi":"https://doi.org/10.1145/3210377.3210384","mag":"2808764965"},"language":"en","primary_location":{"id":"doi:10.1145/3210377.3210384","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3210377.3210384","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-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/A5060217026","display_name":"Nikhil R. Devanur","orcid":"https://orcid.org/0009-0005-4406-5935"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Nikhil Devanur","raw_affiliation_strings":["Microsoft Research, Redmond, WA, USA"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, WA, USA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043137436","display_name":"Janardhan Kulkarni","orcid":"https://orcid.org/0009-0005-9980-7836"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Janardhan Kulkarni","raw_affiliation_strings":["Microsoft Research, Redmond, WA, USA"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, WA, USA","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5060217026"],"corresponding_institution_ids":["https://openalex.org/I1290206253"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.0994629,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"283","last_page":"290"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9988999962806702,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9988999962806702,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9983999729156494,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9969000220298767,"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/rounding","display_name":"Rounding","score":0.8451151251792908},{"id":"https://openalex.org/keywords/tardiness","display_name":"Tardiness","score":0.6481478214263916},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6257925629615784},{"id":"https://openalex.org/keywords/generalized-assignment-problem","display_name":"Generalized assignment problem","score":0.6162928342819214},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6142769455909729},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5910560488700867},{"id":"https://openalex.org/keywords/single-machine-scheduling","display_name":"Single-machine scheduling","score":0.5712180137634277},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5586131811141968},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5502224564552307},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.528253436088562},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.456041157245636},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.43471813201904297},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.4252275824546814},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.4179176688194275},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2735556364059448},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.2485300898551941},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.09352532029151917},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.0879163146018982}],"concepts":[{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.8451151251792908},{"id":"https://openalex.org/C2778047078","wikidata":"https://www.wikidata.org/wiki/Q82299449","display_name":"Tardiness","level":4,"score":0.6481478214263916},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6257925629615784},{"id":"https://openalex.org/C194146004","wikidata":"https://www.wikidata.org/wiki/Q5532462","display_name":"Generalized assignment problem","level":3,"score":0.6162928342819214},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6142769455909729},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5910560488700867},{"id":"https://openalex.org/C2780271269","wikidata":"https://www.wikidata.org/wiki/Q19295956","display_name":"Single-machine scheduling","level":4,"score":0.5712180137634277},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5586131811141968},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5502224564552307},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.528253436088562},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.456041157245636},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.43471813201904297},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.4252275824546814},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.4179176688194275},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2735556364059448},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2485300898551941},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.09352532029151917},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0879163146018982},{"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},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3210377.3210384","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3210377.3210384","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.4699999988079071}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W165387623","https://openalex.org/W1508968115","https://openalex.org/W1587883041","https://openalex.org/W1596968903","https://openalex.org/W1931592052","https://openalex.org/W1998136934","https://openalex.org/W2004165818","https://openalex.org/W2009636784","https://openalex.org/W2014369282","https://openalex.org/W2015231501","https://openalex.org/W2022191808","https://openalex.org/W2036772182","https://openalex.org/W2048730512","https://openalex.org/W2085325317","https://openalex.org/W2099961254","https://openalex.org/W2102201348","https://openalex.org/W2102588682","https://openalex.org/W2104144451","https://openalex.org/W2138779116","https://openalex.org/W2171261418","https://openalex.org/W2269281743","https://openalex.org/W2569078150","https://openalex.org/W2736762914","https://openalex.org/W2911443069","https://openalex.org/W3014052784"],"related_works":["https://openalex.org/W2162966494","https://openalex.org/W2951717752","https://openalex.org/W2153799489","https://openalex.org/W4251798786","https://openalex.org/W2381796141","https://openalex.org/W2044691059","https://openalex.org/W2051062041","https://openalex.org/W2042513519","https://openalex.org/W2051555966","https://openalex.org/W2067391087"],"abstract_inverted_index":{"The":[0,73,109],"rise":[1],"of":[2,11,27,41,45,81,84,101,136],"cloud":[3],"computing":[4],"platforms":[5],"has":[6],"led":[7],"to":[8,23,123,151],"the":[9,42,48,65,90,93,102,113,152],"study":[10],"many":[12],"scheduling":[13,68,131,155],"problems.":[14],"Towards":[15],"this,":[16],"general":[17,141],"algorithmic":[18],"techniques":[19],"that":[20,92],"are":[21,29,116],"applicable":[22],"a":[24,38,55,60,79,82,106,146],"wide":[25],"range":[26],"problems":[28,150],"highly":[30],"valuable.":[31],"We":[32],"develop":[33],"one":[34,100],"such":[35],"technique":[36],"by":[37,144],"temporal":[39],"generalization":[40],"rounding":[43],"algorithm":[44,53,58],"\\citetShmoysT93":[46],"for":[47,59,76,128],"generalized":[49,66,153],"assignment":[50,110,161],"problem.":[51],"Our":[52],"gives":[54],"bi-criteria":[56],"approximation":[57,126],"problem":[61,74,156],"we":[62,120],"introduce,":[63],"called":[64],"interval":[67,117,154],"problem,":[69],"on":[70,86,105],"unrelated":[71],"machines.":[72],"allows":[75],"each":[77,87],"job,":[78],"specification":[80],"collection":[83],"intervals":[85,104],"machine,":[88],"with":[89,157],"constraint":[91],"job":[94],"must":[95],"be":[96],"completely":[97],"processed":[98],"in":[99],"given":[103],"single":[107],"machine.":[108],"costs":[111,143],"and":[112,140],"processing":[114],"lengths":[115],"dependent.":[118],"Next":[119],"show":[121],"how":[122],"get":[124],"improved":[125],"factors":[127],"several":[129],"classical":[130],"problems,":[132],"involving":[133],"energy,":[134],"$\\ell_p$-norms":[135],"completion":[137],"time,":[138],"tardiness,":[139],"delay":[142],"giving":[145],"reduction":[147],"from":[148],"these":[149],"an":[158],"appropriately":[159],"defined":[160],"cost.":[162]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}