{"id":"https://openalex.org/W2072626473","doi":"https://doi.org/10.1145/1132516.1132618","title":"Minimizing average flow time on related machines","display_name":"Minimizing average flow time on related machines","publication_year":2006,"publication_date":"2006-05-21","ids":{"openalex":"https://openalex.org/W2072626473","doi":"https://doi.org/10.1145/1132516.1132618","mag":"2072626473"},"language":"en","primary_location":{"id":"doi:10.1145/1132516.1132618","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1132516.1132618","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-eighth annual ACM symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","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/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":["Indian Institute of Technology Delhi, Hauz Khas, New Delhi"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology Delhi, Hauz Khas, New Delhi","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":["Indian Institute of Technology Delhi, Hauz Khas, New Delhi"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology Delhi, Hauz Khas, New Delhi","institution_ids":["https://openalex.org/I68891433"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I68891433"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"730","last_page":"738"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998999834060669,"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.9998999834060669,"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.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/T12176","display_name":"Optimization and Packing Problems","score":0.9904999732971191,"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.773323655128479},{"id":"https://openalex.org/keywords/preemption","display_name":"Preemption","score":0.7120051980018616},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6657705307006836},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.6463741064071655},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5723402500152588},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5585243105888367},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.4537234604358673},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4525472819805145},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.4437028169631958},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.430111825466156},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.41039371490478516},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3567216992378235},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32835400104522705},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.2217743694782257},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.10302591323852539},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.07514920830726624}],"concepts":[{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.773323655128479},{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.7120051980018616},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6657705307006836},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.6463741064071655},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5723402500152588},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5585243105888367},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.4537234604358673},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4525472819805145},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.4437028169631958},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.430111825466156},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.41039371490478516},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3567216992378235},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32835400104522705},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2217743694782257},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.10302591323852539},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.07514920830726624},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1132516.1132618","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1132516.1132618","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-eighth annual ACM symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.113.6282","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.113.6282","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cse.iitd.ernet.in/~amitk/amitk-34957.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.699999988079071}],"awards":[],"funders":[{"id":"https://openalex.org/F4320315434","display_name":"Sarepta Therapeutics","ror":"https://ror.org/054f2wp19"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W276536446","https://openalex.org/W1488422606","https://openalex.org/W1584243868","https://openalex.org/W1747987134","https://openalex.org/W1847477019","https://openalex.org/W1984034567","https://openalex.org/W1994553105","https://openalex.org/W2009844010","https://openalex.org/W2047150311","https://openalex.org/W2074109829","https://openalex.org/W2086365412","https://openalex.org/W2133663637","https://openalex.org/W2170045213","https://openalex.org/W6610148939"],"related_works":["https://openalex.org/W2092031801","https://openalex.org/W1908901187","https://openalex.org/W2064017604","https://openalex.org/W2889114784","https://openalex.org/W2094578294","https://openalex.org/W2063910010","https://openalex.org/W2163017071","https://openalex.org/W3183786176","https://openalex.org/W2369015275","https://openalex.org/W2072626473"],"abstract_inverted_index":{"We":[0],"give":[1,40],"the":[2,28,51,54,57,67,70,73,83,96],"first":[3,29],"on-line":[4],"poly-logarithmic":[5,30],"competitve":[6],"algorithm":[7,34,80,92],"for":[8,35,102],"minimizing":[9],"average":[10],"flow":[11],"time":[12,32,60,106],"with":[13],"preemption":[14],"on":[15,95,110],"related":[16],"machines,":[17],"i.e.,":[18],"when":[19],"machines":[20],"can":[21],"have":[22],"different":[23],"speeds.":[24],"This":[25],"also":[26,81],"yields":[27],"polynomial":[31],"approximation":[33],"this":[36],"problem.More":[37],"specifically,":[38],"we":[39],"an":[41],"O(log2":[42],"P":[43,49],"\u2022":[44],"log":[45],"S)-competitive":[46],"algorithm,":[47],"where":[48],"is":[50,66,88,93],"ratio":[52,68],"of":[53,61,69,76,98],"biggest":[55],"and":[56,64,72],"smallest":[58,74],"processing":[59],"a":[62,77,103],"job,":[63],"S":[65],"highest":[71],"speed":[75],"machine.":[78],"Our":[79],"has":[82],"nice":[84],"property":[85],"that":[86],"it":[87],"non-migratory.":[89],"The":[90],"scheduling":[91,108],"based":[94],"concept":[97],"making":[99],"jobs":[100],"wait":[101],"long":[104],"enough":[105],"before":[107],"them":[109],"slow":[111],"machines.":[112]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}