{"id":"https://openalex.org/W1998136934","doi":"https://doi.org/10.1145/2746539.2746601","title":"Minimizing Flow-Time on Unrelated Machines","display_name":"Minimizing Flow-Time on Unrelated Machines","publication_year":2015,"publication_date":"2015-06-03","ids":{"openalex":"https://openalex.org/W1998136934","doi":"https://doi.org/10.1145/2746539.2746601","mag":"1998136934"},"language":"en","primary_location":{"id":"doi:10.1145/2746539.2746601","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2746539.2746601","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-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/A5008689083","display_name":"Nikhil Bansal","orcid":"https://orcid.org/0000-0002-6290-0894"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Nikhil Bansal","raw_affiliation_strings":["Eindhoven University of Technology, Eindhoven, Netherlands"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, Eindhoven, Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"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/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Janardhan Kulkarni","raw_affiliation_strings":["Duke University, Durham, NC, USA"],"affiliations":[{"raw_affiliation_string":"Duke University, Durham, NC, USA","institution_ids":["https://openalex.org/I170897317"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5008689083"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":null,"apc_paid":null,"fwci":3.1604,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.92357968,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"851","last_page":"860"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"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.9998999834060669,"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.9998000264167786,"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/T12176","display_name":"Optimization and Packing Problems","score":0.996999979019165,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.7294541001319885},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.5915543437004089},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.53017258644104},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5287591814994812},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.5013742446899414},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.49912309646606445},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.48287370800971985},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4794810712337494},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.45370808243751526},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.43406134843826294},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.41044124960899353},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40413719415664673},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3861224055290222},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.32406094670295715},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.09031593799591064},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06486871838569641}],"concepts":[{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.7294541001319885},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.5915543437004089},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.53017258644104},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5287591814994812},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.5013742446899414},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.49912309646606445},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.48287370800971985},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4794810712337494},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.45370808243751526},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.43406134843826294},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41044124960899353},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40413719415664673},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3861224055290222},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.32406094670295715},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.09031593799591064},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06486871838569641},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/2746539.2746601","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2746539.2746601","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-seventh annual ACM symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.tue.nl:publications/5facf20f-55f2-4f9c-9002-9005f61591fb","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/5facf20f-55f2-4f9c-9002-9005f61591fb","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bansal, N & Kulkarni, J 2015, Minimizing flow-time on unrelated machines. in R A Servedio & R Rubinfeld (eds), STOC 2015 : 47th Annual ACM Symposium on the Theory of Computing, Portland OR, USA, June 14-17, 2015. Association for Computing Machinery, Inc., New York NY, pp. 851-860, 47th ACM Symposium on the Theory of Computing (STOC 2015), June 14-17, 2015, Portland, OR, USA, Portland, OR, United States, 14/06/15. https://doi.org/10.1145/2746539.2746601","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.tue.nl:publications/e89eef1d-b618-43fb-8b60-8d2c6082743b","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/e89eef1d-b618-43fb-8b60-8d2c6082743b","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:tue:oai:pure.tue.nl:publications/5facf20f-55f2-4f9c-9002-9005f61591fb","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/5facf20f-55f2-4f9c-9002-9005f61591fb","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"STOC 2015 : 47th Annual ACM Symposium on the Theory of Computing, Portland OR, USA, June 14-17, 2015, 851 - 860","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.7099999785423279,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W165387623","https://openalex.org/W1501066815","https://openalex.org/W1559482660","https://openalex.org/W1559868135","https://openalex.org/W1572148396","https://openalex.org/W1603330095","https://openalex.org/W1978593916","https://openalex.org/W1981135899","https://openalex.org/W1994553105","https://openalex.org/W1998382156","https://openalex.org/W2009844010","https://openalex.org/W2037502715","https://openalex.org/W2072626473","https://openalex.org/W2086365412","https://openalex.org/W2100283019","https://openalex.org/W2101867823","https://openalex.org/W2102201348","https://openalex.org/W2102252987","https://openalex.org/W2102588682","https://openalex.org/W2112288559","https://openalex.org/W2123976299","https://openalex.org/W2129851433","https://openalex.org/W2134553994","https://openalex.org/W2135932424","https://openalex.org/W2147877827","https://openalex.org/W2166867051","https://openalex.org/W2170045213","https://openalex.org/W2552451242","https://openalex.org/W2570727021","https://openalex.org/W6633564611"],"related_works":["https://openalex.org/W4367665025","https://openalex.org/W4377371889","https://openalex.org/W2962917430","https://openalex.org/W4389362338","https://openalex.org/W2028468530","https://openalex.org/W2113623403","https://openalex.org/W2055932080","https://openalex.org/W2039086323","https://openalex.org/W1968512104","https://openalex.org/W2096589954"],"abstract_inverted_index":{"We":[0,78],"consider":[1],"some":[2],"classical":[3],"flow-time":[4,44],"minimization":[5],"problems":[6],"in":[7,56],"the":[8,49,53,70,80,95,105,111,121,128],"unrelated":[9],"machines":[10,21],"setting.":[11],"In":[12],"this":[13],"setting,":[14],"there":[15],"is":[16,48,67,110],"a":[17,23,33,46,57],"set":[18,24],"of":[19,25,38,45,51,69,74,76,113],"m":[20],"and":[22,28,66,98],"n":[26,88],"jobs,":[27],"each":[29],"job":[30,47,54,117],"j":[31],"has":[32],"machine":[34,41],"dependent":[35],"processing":[36],"time":[37,52,61],"pij":[39],"on":[40],"i.":[42],"The":[43],"amount":[50],"spends":[55],"system":[58],"(its":[59],"completion":[60],"minus":[62],"its":[63],"arrival":[64],"time),":[65],"one":[68],"most":[71],"natural":[72],"measure":[73],"quality":[75],"service.":[77],"show":[79],"following":[81],"two":[82],"results:":[83],"an":[84,99],"$O(min(log2":[85],"n,":[86],"log":[87,89],"P))":[90],"approximation":[91,102],"algorithm":[92],"for":[93,103,126],"minimizing":[94,104],"total":[96],"flow-time,":[97],"O(log":[100],"n)":[101],"maximum":[106,114],"flow-time.":[107],"Here":[108],"P":[109],"ratio":[112],"to":[115],"minimum":[116],"size.":[118],"These":[119],"are":[120],"first":[122],"known":[123],"poly-logarithmic":[124],"guarantees":[125],"both":[127],"problems.":[129]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2026-03-25T14:56:36.534964","created_date":"2025-10-10T00:00:00"}