{"id":"https://openalex.org/W3019022150","doi":"https://doi.org/10.1109/focs46700.2020.00082","title":"Scheduling Precedence-Constrained Jobs on Related Machines with Communication Delay","display_name":"Scheduling Precedence-Constrained Jobs on Related Machines with Communication Delay","publication_year":2020,"publication_date":"2020-11-01","ids":{"openalex":"https://openalex.org/W3019022150","doi":"https://doi.org/10.1109/focs46700.2020.00082","mag":"3019022150"},"language":"en","primary_location":{"id":"doi:10.1109/focs46700.2020.00082","doi":"https://doi.org/10.1109/focs46700.2020.00082","is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs46700.2020.00082","pdf_url":null,"source":{"id":"https://openalex.org/S4210175768","display_name":"Annual Symposium on Foundations of Computer Science","issn_l":"0272-5428","issn":["0272-5428"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2004.10776","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5001500121","display_name":"Biswaroop Maiti","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Biswaroop Maiti","raw_affiliation_strings":["Northeastern University, Boston, Massachusetts"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Northeastern University, Boston, Massachusetts","institution_ids":["https://openalex.org/I12912129"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103525476","display_name":"Rajmohan Rajaraman","orcid":"https://orcid.org/0009-0005-3610-9918","observed_orcids":["https://orcid.org/0009-0005-3610-9918"]},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rajmohan Rajaraman","raw_affiliation_strings":["Northeastern University, Boston, Massachusetts","Northeastern University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Northeastern University, Boston, Massachusetts","institution_ids":["https://openalex.org/I12912129"]},{"raw_affiliation_string":"Northeastern University","institution_ids":["https://openalex.org/I12912129"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083011247","display_name":"David Stalfa","orcid":"https://orcid.org/0000-0003-2101-8675","observed_orcids":["https://orcid.org/0000-0003-2101-8675"]},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David Stalfa","raw_affiliation_strings":["Northeastern University, Boston, Massachusetts","Northeastern University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Northeastern University, Boston, Massachusetts","institution_ids":["https://openalex.org/I12912129"]},{"raw_affiliation_string":"Northeastern University","institution_ids":["https://openalex.org/I12912129"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025880780","display_name":"Zoya Svitkina","orcid":"https://orcid.org/0009-0009-0977-6618","observed_orcids":["https://orcid.org/0009-0009-0977-6618"]},"institutions":[{"id":"https://openalex.org/I1291425158","display_name":"Google (United States)","ror":"https://ror.org/00njsd438","country_code":"US","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210128969"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zoya Svitkina","raw_affiliation_strings":["Google Research, Mountain View, California","Google,,,,,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Google Research, Mountain View, California","institution_ids":["https://openalex.org/I1291425158"]},{"raw_affiliation_string":"Google,,,,,","institution_ids":["https://openalex.org/I1291425158"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081431077","display_name":"Aravindan Vijayaraghavan","orcid":"https://orcid.org/0000-0001-9734-3779","observed_orcids":["https://orcid.org/0000-0001-9734-3779"]},"institutions":[{"id":"https://openalex.org/I111979921","display_name":"Northwestern University","ror":"https://ror.org/000e0be47","country_code":"US","type":"education","lineage":["https://openalex.org/I111979921"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aravindan Vijayaraghavan","raw_affiliation_strings":["Northwestern University, Evanston, Illinois","Northwestern University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Northwestern University, Evanston, Illinois","institution_ids":["https://openalex.org/I111979921"]},{"raw_affiliation_string":"Northwestern University","institution_ids":["https://openalex.org/I111979921"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.9785,"has_fulltext":true,"cited_by_count":17,"citation_normalized_percentile":{"value":0.9111546,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"834","last_page":"845"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.836899995803833,"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.836899995803833,"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.12700000405311584,"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.0034000000450760126,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/precedence-constrained-scheduling","display_name":"precedence-constrained scheduling","score":0.7990000247955322},{"id":"https://openalex.org/keywords/related-machines","display_name":"related machines","score":0.7059999704360962},{"id":"https://openalex.org/keywords/communication-delay","display_name":"communication delay","score":0.9729999899864197},{"id":"https://openalex.org/keywords/makespan-minimization","display_name":"makespan minimization","score":0.9340000152587891},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.8420000076293945},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"linear programming relaxation","score":0.8970000147819519},{"id":"https://openalex.org/keywords/integrality-gap","display_name":"integrality gap","score":0.9430000185966492},{"id":"https://openalex.org/keywords/expander-graphs","display_name":"expander graphs","score":0.9610000252723694},{"id":"https://openalex.org/keywords/polylogarithmic-approximation","display_name":"polylogarithmic approximation","score":0.6790000200271606}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.7796761989593506},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6790978312492371},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.6658931970596313},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.613106906414032},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.6051926016807556},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.5786532759666443},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5104881525039673},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4806203246116638},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.45931509137153625},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.42388907074928284},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3962951898574829},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38295307755470276},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3659522235393524},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3235184848308563},{"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/focs46700.2020.00082","doi":"https://doi.org/10.1109/focs46700.2020.00082","is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs46700.2020.00082","pdf_url":null,"source":{"id":"https://openalex.org/S4210175768","display_name":"Annual Symposium on Foundations of Computer Science","issn_l":"0272-5428","issn":["0272-5428"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2004.10776","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/2004.10776","pdf_url":"https://arxiv.org/pdf/2004.10776","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},{"id":"mag:3019022150","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/pdf/2004.10776.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.2004.10776","doi":"https://doi.org/10.48550/arxiv.2004.10776","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2004.10776","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2004.10776","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/2004.10776","pdf_url":"https://arxiv.org/pdf/2004.10776","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3019022150.pdf","grobid_xml":"https://content.openalex.org/works/W3019022150.grobid-xml"},"referenced_works_count":37,"referenced_works":["https://openalex.org/W129679006","https://openalex.org/W1495318531","https://openalex.org/W1568961751","https://openalex.org/W1966418564","https://openalex.org/W1978018278","https://openalex.org/W1985059007","https://openalex.org/W1989582918","https://openalex.org/W1998544343","https://openalex.org/W2006905044","https://openalex.org/W2038551582","https://openalex.org/W2065689629","https://openalex.org/W2067753820","https://openalex.org/W2078031780","https://openalex.org/W2086370835","https://openalex.org/W2104680817","https://openalex.org/W2117341722","https://openalex.org/W2130418601","https://openalex.org/W2140168147","https://openalex.org/W2148204686","https://openalex.org/W2150446509","https://openalex.org/W2152490496","https://openalex.org/W2155951254","https://openalex.org/W2159644278","https://openalex.org/W2169560887","https://openalex.org/W2169878774","https://openalex.org/W2170050590","https://openalex.org/W2223186009","https://openalex.org/W2293001982","https://openalex.org/W2581172100","https://openalex.org/W2607875432","https://openalex.org/W2617411258","https://openalex.org/W2789114636","https://openalex.org/W2945473427","https://openalex.org/W2964321035","https://openalex.org/W2993364236","https://openalex.org/W2998282597","https://openalex.org/W3127756288"],"related_works":["https://openalex.org/W4396884787","https://openalex.org/W4288728412","https://openalex.org/W3187456175","https://openalex.org/W3127756288","https://openalex.org/W4388639974","https://openalex.org/W3116926108","https://openalex.org/W7095093427","https://openalex.org/W2998282597","https://openalex.org/W2005955982","https://openalex.org/W2079953091"],"abstract_inverted_index":{"We":[0,52,214,270],"consider":[1,53],"the":[2,12,23,31,40,63,75,101,106,109,113,119,132,140,160,165,202,218,228,261,273,284,309,318,341],"problem":[3],"of":[4,14,25,33,42,45,62,77,103,108,167,189,221,241,249,255,263,311,320],"scheduling":[5,266],"precedence-constrained":[6],"jobs":[7,321],"on":[8,36,48,66,125,185],"uniformly-related":[9,205],"machines":[10,104,197,206],"in":[11,100,169,177,227,265,314,317],"presence":[13],"an":[15,91,312],"arbitrary,":[16],"fixed":[17],"communication":[18,110,143,193,209,229,268],"delay.":[19,120,230,269],"Communication":[20],"delay":[21,194,210],"is":[22,90,116,123,225,345],"amount":[24],"time":[26,297],"that":[27,46,56,217,272],"must":[28],"pass":[29],"between":[30],"completion":[32],"a":[34,49,54,78,84,127,154,157,239,280,289,295,304,337],"job":[35,47,58,65,150],"one":[37,191],"machine":[38],"and":[39,105,149,201,237,244,322],"start":[41],"any":[43,301],"successor":[44],"different":[50],"machine.":[51],"model":[55],"allows":[57],"duplication,":[59,333],"i.e.":[60],"processing":[61],"same":[64],"multiple":[67],"machines,":[68],"which,":[69],"as":[70],"we":[71,163,259,293],"show,":[72],"can":[73,278],"reduce":[74],"length":[76,107],"schedule":[79,155,275,302,305],"(i.e.,":[80],"its":[81,175,245],"makespan)":[82],"by":[83,288],"logarithmic":[85,290],"factor.":[86,291],"Our":[87,121,182,231],"main":[88],"result":[89,183],"approximation":[92,97,328],"algorithm":[93,122,298,329,339],"for":[94,131,330,340],"makespan":[95,115,282,315,327],"with":[96,192,204,267,286,325],"ratio":[98],"polylogarithmic":[99,226,316],"number":[102,319],"delay,":[111,144],"assuming":[112],"minimum":[114],"at":[117,308],"least":[118],"based":[124],"rounding":[126],"linear":[128,161],"programming":[129],"relaxation":[130],"problem,":[133],"which":[134,252],"includes":[135],"carefully":[136],"designed":[137],"constraints":[138,172],"capturing":[139],"interaction":[141],"among":[142],"precedence":[145,171],"requirements,":[146],"varying":[147],"speeds,":[148],"duplication.":[151],"To":[152],"derive":[153],"from":[156],"solution":[158],"to":[159,247,299,303],"program,":[162],"balance":[164],"benefits":[166],"duplication":[168,264,277,287,307,344],"satisfying":[170],"early":[173],"against":[174],"drawbacks":[176],"increasing":[178],"overall":[179],"system":[180],"load.":[181],"builds":[184],"two":[186],"previous":[187],"lines":[188],"work,":[190],"but":[195,207],"identical":[196],"(Lepere,":[198],"Rapine":[199],"2002),":[200],"other":[203],"no":[208],"(Chudak,":[211],"Shmoys":[212],"1999).":[213],"next":[215],"show":[216,271],"integrality":[219],"gap":[220,232],"our":[222,326],"mathematical":[223],"program":[224],"construction":[233],"employs":[234],"expander":[235],"graphs":[236],"exploits":[238],"property":[240],"robust":[242],"expansion":[243],"generalization":[246],"paths":[248],"longer":[250],"length,":[251],"may":[253],"be":[254],"independent":[256],"interest.":[257],"Finally,":[258],"quantify":[260],"advantage":[262],"best":[274],"without":[276,306],"have":[279],"larger":[281],"than":[283],"optimal":[285],"Nevertheless,":[292],"present":[294],"polynomial":[296],"transform":[300],"cost":[310],"increase":[313],"machines.":[323],"Together":[324],"schedules":[331],"allowing":[332],"this":[334],"also":[335],"yields":[336],"polylogarithmic-approximation":[338],"setting":[342],"where":[343],"not":[346],"allowed.":[347]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2020-05-01T00:00:00"}
