{"id":"https://openalex.org/W2190420042","doi":"https://doi.org/10.1007/s00453-015-0082-y","title":"Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines","display_name":"Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines","publication_year":2015,"publication_date":"2015-10-26","ids":{"openalex":"https://openalex.org/W2190420042","doi":"https://doi.org/10.1007/s00453-015-0082-y","mag":"2190420042"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-015-0082-y","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-015-0082-y","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-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/A5041750815","display_name":"S. Anand","orcid":"https://orcid.org/0000-0002-4378-2941"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"S. Anand","raw_affiliation_strings":["Max Planck Institute for Informatics, Campus E1 4, 66123, Saarbr\u00fccken, Germany"],"affiliations":[{"raw_affiliation_string":"Max Planck Institute for Informatics, Campus E1 4, 66123, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044394587","display_name":"Karl Bringmann","orcid":"https://orcid.org/0000-0003-1356-5177"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Karl Bringmann","raw_affiliation_strings":["ETH Z\u00fcrich, Universit\u00e4tstrasse 6, 8092, Zurich, Switzerland"],"affiliations":[{"raw_affiliation_string":"ETH Z\u00fcrich, Universit\u00e4tstrasse 6, 8092, Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077389210","display_name":"Tobias Friedrich","orcid":"https://orcid.org/0000-0003-0076-6308"},"institutions":[{"id":"https://openalex.org/I143288331","display_name":"Hasso Plattner Institute","ror":"https://ror.org/058rn5r42","country_code":"DE","type":"facility","lineage":["https://openalex.org/I143288331","https://openalex.org/I176453806"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Tobias Friedrich","raw_affiliation_strings":["Hasso Plattner Institute, Prof.-Dr.-Helmert-Str. 2-3, 14482, Potsdam, Germany"],"affiliations":[{"raw_affiliation_string":"Hasso Plattner Institute, Prof.-Dr.-Helmert-Str. 2-3, 14482, Potsdam, Germany","institution_ids":["https://openalex.org/I143288331"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045952512","display_name":"Naveen Garg","orcid":"https://orcid.org/0000-0001-7923-4464"},"institutions":[{"id":"https://openalex.org/I68891433","display_name":"Indian Institute of Technology Delhi","ror":"https://ror.org/049tgcd06","country_code":"IN","type":"education","lineage":["https://openalex.org/I68891433"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Naveen Garg","raw_affiliation_strings":["Computer Science and Engineering, Indian Institute of Technology Delhi, Hauz Khas, New Delhi, 110016, India"],"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering, Indian Institute of Technology Delhi, Hauz Khas, New Delhi, 110016, India","institution_ids":["https://openalex.org/I68891433"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029407896","display_name":"Amit Kumar","orcid":"https://orcid.org/0000-0002-3965-6627"},"institutions":[{"id":"https://openalex.org/I68891433","display_name":"Indian Institute of Technology Delhi","ror":"https://ror.org/049tgcd06","country_code":"IN","type":"education","lineage":["https://openalex.org/I68891433"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Amit Kumar","raw_affiliation_strings":["Computer Science and Engineering, Indian Institute of Technology Delhi, Hauz Khas, New Delhi, 110016, India"],"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering, Indian Institute of Technology Delhi, Hauz Khas, New Delhi, 110016, India","institution_ids":["https://openalex.org/I68891433"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5077389210"],"corresponding_institution_ids":["https://openalex.org/I143288331"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.5743,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.73983949,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"77","issue":"2","first_page":"515","last_page":"536"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9993000030517578,"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.9993000030517578,"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/T12288","display_name":"Optimization and Search Problems","score":0.9993000030517578,"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/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9922999739646912,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6779103875160217},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.5244053602218628},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.459194540977478},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4470597207546234},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43632790446281433},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.39884334802627563},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36166632175445557},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3610338270664215},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.138005793094635}],"concepts":[{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6779103875160217},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.5244053602218628},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.459194540977478},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4470597207546234},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43632790446281433},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.39884334802627563},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36166632175445557},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3610338270664215},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.138005793094635}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00453-015-0082-y","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-015-0082-y","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W165387623","https://openalex.org/W204261080","https://openalex.org/W1517616038","https://openalex.org/W1572148396","https://openalex.org/W1574209077","https://openalex.org/W1911636809","https://openalex.org/W1972257233","https://openalex.org/W1981135899","https://openalex.org/W2004165818","https://openalex.org/W2020082371","https://openalex.org/W2051216594","https://openalex.org/W2064467943","https://openalex.org/W2071404693","https://openalex.org/W2128722354","https://openalex.org/W2133663637","https://openalex.org/W4206828242","https://openalex.org/W4235684105","https://openalex.org/W4255789017"],"related_works":["https://openalex.org/W2003930232","https://openalex.org/W2263167076","https://openalex.org/W2085049270","https://openalex.org/W4311255633","https://openalex.org/W2368007657","https://openalex.org/W2391191500","https://openalex.org/W4297894118","https://openalex.org/W2365398175","https://openalex.org/W1979748118","https://openalex.org/W2018732369"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
