{"id":"https://openalex.org/W2104144451","doi":"https://doi.org/10.1145/1060590.1060639","title":"Convex programming for scheduling unrelated parallel machines","display_name":"Convex programming for scheduling unrelated parallel machines","publication_year":2005,"publication_date":"2005-05-22","ids":{"openalex":"https://openalex.org/W2104144451","doi":"https://doi.org/10.1145/1060590.1060639","mag":"2104144451"},"language":"en","primary_location":{"id":"doi:10.1145/1060590.1060639","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1060590.1060639","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-seventh annual ACM symposium on Theory of computing","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/A5082061504","display_name":"Yossi Azar","orcid":"https://orcid.org/0000-0002-5097-8993"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Yossi Azar","raw_affiliation_strings":["Tel-Aviv University, Tel-Aviv, Israel","Tel Aviv University, Tel Aviv, Israel,"],"affiliations":[{"raw_affiliation_string":"Tel-Aviv University, Tel-Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel,","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057109268","display_name":"Amir Epstein","orcid":null},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Amir Epstein","raw_affiliation_strings":["Tel-Aviv University, Tel-Aviv, Israel","Tel Aviv University, Tel Aviv, Israel,"],"affiliations":[{"raw_affiliation_string":"Tel-Aviv University, Tel-Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel,","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5082061504"],"corresponding_institution_ids":["https://openalex.org/I16391192"],"apc_list":null,"apc_paid":null,"fwci":2.7373,"has_fulltext":false,"cited_by_count":85,"citation_normalized_percentile":{"value":0.9158226,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9995999932289124,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9970999956130981,"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/computer-science","display_name":"Computer science","score":0.7067906260490417},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5691722631454468},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5193454027175903},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.5047827959060669},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.26534581184387207},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15675917267799377},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.1242792010307312}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7067906260490417},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5691722631454468},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5193454027175903},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.5047827959060669},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.26534581184387207},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15675917267799377},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.1242792010307312},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1060590.1060639","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1060590.1060639","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-seventh annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.298.3081","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.298.3081","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.tau.ac.il/~azar/lp_unrelated.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.62.1661","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.62.1661","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.tau.ac.il/~azar/lp_unrelated.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.5600000023841858,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1531908439","https://openalex.org/W1563703481","https://openalex.org/W1604192610","https://openalex.org/W1632601927","https://openalex.org/W1977276352","https://openalex.org/W1985123706","https://openalex.org/W1992734168","https://openalex.org/W2012329067","https://openalex.org/W2014071862","https://openalex.org/W2014369282","https://openalex.org/W2093979815","https://openalex.org/W2100440346","https://openalex.org/W2102201348","https://openalex.org/W2102588682","https://openalex.org/W2148204686","https://openalex.org/W2574678133","https://openalex.org/W2607875432","https://openalex.org/W2619122734","https://openalex.org/W6732183559"],"related_works":["https://openalex.org/W1507894569","https://openalex.org/W3174582865","https://openalex.org/W2546696010","https://openalex.org/W2140012984","https://openalex.org/W2997221951","https://openalex.org/W2160662451","https://openalex.org/W2045607085","https://openalex.org/W303617728","https://openalex.org/W4308087753","https://openalex.org/W2055471337"],"abstract_inverted_index":{"Abstract":[0],"We":[1,69,86,145,207],"consider":[2,147,208],"the":[3,37,47,52,60,93,104,111,127,151,155,164,168,177,179,182,185,209,233,239,264],"classical":[4,210],"problem":[5,48,152,190,211],"of":[6,67,106,129,143,150,167,212],"scheduling":[7,213],"parallel":[8,216],"unrelated":[9,217],"machines.":[10,144,218],"Each":[11],"job":[12,21],"is":[13,110,161,173],"tobe":[14],"processed":[15],"by":[16],"exactly":[17],"one":[18],"machine.":[19],"Processing":[20],"j":[22],"on":[23,99,215],"machine":[24],"i":[25],"requires":[26],"time":[27,113],"pij.":[28],"The":[29],"goalis":[30],"to":[31,51,162],"find":[32],"a":[33,43,65,71,88,137,174,193,228,250,261],"schedule":[34],"that":[35,114],"minimizes":[36],"`p":[38,58,76,135,165,201,240,255],"norm.":[39,54,95,256],"Previous":[40],"work":[41],"showed":[42],"2-approximation":[44,72,90,229,251],"algo-rithm":[45],"for":[46,92,132,139,198,231,238,253,263],"with":[49],"respect":[50],"`1":[53],"For":[55,188],"any":[56,74,133,140,199,254],"fixed":[57,75,141,200],"norm":[59,77,136,166,202,241],"previously":[61],"knownapproximation":[62],"algorithm":[63,81,91,97,197,230,244,252],"has":[64],"performance":[66],"`(p).":[68],"provide":[70],"algorithmfor":[73],"(p>":[78,203],"1).":[79,204],"This":[80,96],"uses":[82],"convex":[83,100,116],"programming":[84,117],"relaxation.":[85,102],"alsogive":[87],"p":[89],"`2":[94],"relies":[98],"quadraticprogramming":[101],"To":[103],"best":[105],"our":[107],"knowledge,":[108],"this":[109,189],"first":[112],"general":[115],"techniques":[118],"(apart":[119],"from":[120],"SDPs":[121],"and":[122,181,222,224],"CQPs)":[123],"are":[124,157],"used":[125],"in":[126,153],"area":[128],"scheduling.":[130],"Weshow":[131],"given":[134],"PTAS":[138],"number":[142],"also":[146],"themultidimensional":[148],"generalization":[149],"which":[154,172],"jobs":[156,186,214],"d-dimensional.":[158],"Here":[159],"thegoal":[160],"minimize":[163],"generalized":[169],"load":[170],"vector,":[171],"matrix":[175],"where":[176],"rowsrepresent":[178],"machines":[180],"columns":[183],"represent":[184],"dimension.":[187],"we":[191,259],"give":[192],"(d":[194],"+":[195],"1)-approximation":[196],"1":[205],"Introduction":[206],"Lenstra":[219],"et.":[220],"al[14]":[221],"Shmoys":[223],"Tardos":[225],"[16]":[226],"provided":[227],"minimizing":[232],"makespan":[234],"(`1":[235],"norm).":[236],"However,":[237],"only":[242],"`(p)-approximation":[243],"was":[245],"known":[246],"(see":[247],"[2]).":[248],"Weprovide":[249],"In":[257],"addition":[258],"show":[260],"p2-approximationalgorithm":[262]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":5}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}