{"id":"https://openalex.org/W2584754195","doi":"https://doi.org/10.4086/toc.2016.v012a014","title":"","display_name":"","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2584754195","doi":"https://doi.org/10.4086/toc.2016.v012a014","mag":"2584754195"},"language":"en","primary_location":{"id":"doi:10.4086/toc.2016.v012a014","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2016.v012a014","pdf_url":"http://www.theoryofcomputing.org/articles/v012a014/v012a014.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"http://www.theoryofcomputing.org/articles/v012a014/v012a014.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008689083","display_name":"Nikhil Bansal","orcid":"https://orcid.org/0000-0002-6290-0894"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nikhil Bansal","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5068876628","display_name":"Bouke Cloostermans","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bouke Cloostermans","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2833,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.671201,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"12","issue":"1","first_page":"1","last_page":"14"},"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.9955999851226807,"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/T11182","display_name":"Auction Theory and Applications","score":0.9922000169754028,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.7287825345993042},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.6462783813476562},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.6278010606765747},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.612204372882843},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5863422155380249},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5605564117431641},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5364625453948975},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5170333981513977},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.44837838411331177},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34788385033607483},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.29404765367507935},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.13895884156227112}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.7287825345993042},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.6462783813476562},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.6278010606765747},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.612204372882843},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5863422155380249},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5605564117431641},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5364625453948975},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5170333981513977},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.44837838411331177},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34788385033607483},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.29404765367507935},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.13895884156227112},{"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":3,"locations":[{"id":"doi:10.4086/toc.2016.v012a014","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2016.v012a014","pdf_url":"http://www.theoryofcomputing.org/articles/v012a014/v012a014.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:publications/3782bebb-f0bb-4e49-8d32-d7864f12901a","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/3782bebb-f0bb-4e49-8d32-d7864f12901a","pdf_url":"https://pure.tue.nl/ws/files/91578497/bansmini2016.pdf","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Bansal, N 2016, 'Minimizing maximum flow-time on related machines.', Theory of Computing, vol. 12, no. 1, pp. 1-14. https://doi.org/10.4086/toc.2016.v012a014","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:tue:oai:pure.tue.nl:publications/3782bebb-f0bb-4e49-8d32-d7864f12901a","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/3782bebb-f0bb-4e49-8d32-d7864f12901a","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Theory of Computing, 12(1), 1 - 14. University of Chicago","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.4086/toc.2016.v012a014","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2016.v012a014","pdf_url":"http://www.theoryofcomputing.org/articles/v012a014/v012a014.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.5199999809265137}],"awards":[{"id":"https://openalex.org/G1664046972","display_name":null,"funder_award_id":"639.022.211","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"}],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2584754195.pdf","grobid_xml":"https://content.openalex.org/works/W2584754195.grobid-xml"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W1572148396","https://openalex.org/W1972257233","https://openalex.org/W1972868674","https://openalex.org/W1981135899","https://openalex.org/W1998136934","https://openalex.org/W2023605411","https://openalex.org/W2101867823","https://openalex.org/W2112288559","https://openalex.org/W2295822836","https://openalex.org/W2296769330","https://openalex.org/W4206478994","https://openalex.org/W4226347946","https://openalex.org/W4235684105","https://openalex.org/W4238474291","https://openalex.org/W4243390741","https://openalex.org/W4251714866"],"related_works":["https://openalex.org/W2564742953","https://openalex.org/W4213299358","https://openalex.org/W2793095688","https://openalex.org/W1623410360","https://openalex.org/W3115340459","https://openalex.org/W2950803469","https://openalex.org/W2797898895","https://openalex.org/W2131569046","https://openalex.org/W2045215405","https://openalex.org/W2098754607"],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,7,19,26,44,68,88],"online":[3],"problem":[4,24],"of":[5,18],"minimizing":[6],"maximum":[8],"flow-time":[9],"on":[10,53],"related":[11,54],"machines.":[12],"This":[13],"is":[14,62],"a":[15,63],"natural":[16,34],"generalization":[17],"extensively":[20],"studied":[21],"makespan":[22,51],"minimization":[23,52],"to":[25],"setting":[27],"where":[28],"jobs":[29],"arrive":[30],"over":[31],"time.":[32],"Interestingly,":[33],"algorithms":[35,72],"such":[36],"as":[37],"Greedy":[38],"or":[39,49],"Slow-fit":[40],"that":[41],"work":[42],"for":[43,50,67],"simpler":[45],"identical":[46],"machines":[47],"case":[48],"machines,":[55],"are":[56],"not":[57],"O(1)-competitive.":[58],"Our":[59],"main":[60],"result":[61],"new":[64],"O(1)-competitive":[65,71],"algorithm":[66],"problem.":[69],"Previously,":[70],"were":[73],"known":[74,85],"only":[75],"with":[76],"resource":[77],"augmentation,":[78],"and":[79],"in":[80,87],"fact":[81],"no":[82],"O(1)-approximation":[83],"was":[84],"even":[86],"offline":[89],"model.":[90]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2025-12-17T22:08:43.090829","created_date":"2017-02-10T00:00:00"}