{"id":"https://openalex.org/W2086519761","doi":"https://doi.org/10.1145/1150334.1150340","title":"Minimizing mean flow time for UET tasks","display_name":"Minimizing mean flow time for UET tasks","publication_year":2006,"publication_date":"2006-04-01","ids":{"openalex":"https://openalex.org/W2086519761","doi":"https://doi.org/10.1145/1150334.1150340","mag":"2086519761"},"language":"en","primary_location":{"id":"doi:10.1145/1150334.1150340","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1150334.1150340","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","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/A5055734882","display_name":"Yumei Huo","orcid":"https://orcid.org/0000-0003-3550-8843"},"institutions":[{"id":"https://openalex.org/I118118575","display_name":"New Jersey Institute of Technology","ror":"https://ror.org/05e74xb87","country_code":"US","type":"education","lineage":["https://openalex.org/I118118575"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yumei Huo","raw_affiliation_strings":["New Jersey Institute of Technology, Newark, NJ","[New Jersey Institute of Technology, Newark, NJ]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"New Jersey Institute of Technology, Newark, NJ","institution_ids":["https://openalex.org/I118118575"]},{"raw_affiliation_string":"[New Jersey Institute of Technology, Newark, NJ]","institution_ids":["https://openalex.org/I118118575"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108400400","display_name":"Joseph Y.\u2010T. Leung","orcid":null},"institutions":[{"id":"https://openalex.org/I118118575","display_name":"New Jersey Institute of Technology","ror":"https://ror.org/05e74xb87","country_code":"US","type":"education","lineage":["https://openalex.org/I118118575"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Joseph Y.-T. Leung","raw_affiliation_strings":["New Jersey Institute of Technology, Newark, NJ","[New Jersey Institute of Technology, Newark, NJ]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"New Jersey Institute of Technology, Newark, NJ","institution_ids":["https://openalex.org/I118118575"]},{"raw_affiliation_string":"[New Jersey Institute of Technology, Newark, NJ]","institution_ids":["https://openalex.org/I118118575"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I118118575"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.18552793,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"2","issue":"2","first_page":"244","last_page":"262"},"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.9976999759674072,"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.9921000003814697,"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/job-shop-scheduling","display_name":"Job shop scheduling","score":0.8186195492744446},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6552203297615051},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.6418863534927368},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6183139681816101},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5470120310783386},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5194170475006104},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.492575466632843},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4887380599975586},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4476524591445923},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37899765372276306},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33506715297698975}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.8186195492744446},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6552203297615051},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.6418863534927368},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6183139681816101},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5470120310783386},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5194170475006104},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.492575466632843},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4887380599975586},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4476524591445923},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37899765372276306},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33506715297698975},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1150334.1150340","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1150334.1150340","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5099999904632568,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W272982077","https://openalex.org/W1488422606","https://openalex.org/W1569458199","https://openalex.org/W2002473393","https://openalex.org/W2011039300","https://openalex.org/W2025235423","https://openalex.org/W2027077493","https://openalex.org/W2040558879","https://openalex.org/W2049994136","https://openalex.org/W2058817479","https://openalex.org/W2090947986","https://openalex.org/W2092333800"],"related_works":["https://openalex.org/W3172150420","https://openalex.org/W2107725657","https://openalex.org/W2112121444","https://openalex.org/W2509452605","https://openalex.org/W2148608945","https://openalex.org/W3112689649","https://openalex.org/W2998357381","https://openalex.org/W1966261337","https://openalex.org/W1589381382","https://openalex.org/W961142965"],"abstract_inverted_index":{"We":[0,133],"consider":[1],"the":[2,28,35,44,49,63,81,101,107,122,142,162],"problem":[3,52,108],"of":[4,8,60,131],"scheduling":[5],"a":[6,39,85,88,146,149],"set":[7],"n":[9],"unit-execution-time":[10],"(UET)":[11],"tasks,":[12],"with":[13,87,148],"precedence":[14,76],"constraints,":[15,77],"on":[16],"m":[17,71,118],"\u2265":[18,72,119],"1":[19],"parallel":[20],"and":[21,48,95,156],"identical":[22],"processors":[23],"so":[24],"as":[25],"to":[26],"minimize":[27],"mean":[29,45],"flow":[30,46],"time.":[31],"For":[32,74,105],"two":[33],"processors,":[34,61],"Coffman--Graham":[36,82],"algorithm":[37,83,137],"gives":[38,84],"schedule":[40,86,147],"that":[41,80,100,135,161],"simultaneously":[42],"minimizes":[43],"time":[47,114],"makespan.":[50],"The":[51],"becomes":[53],"strongly":[54],"NP-hard":[55],"for":[56,68,115,127,141],"an":[57,128],"arbitrary":[58,75,129],"number":[59,130],"although":[62,121],"complexity":[64,123],"is":[65,103,124,139],"not":[66,125],"known":[67,126],"each":[69,116],"fixed":[70,117],"3.":[73],"we":[78,96,157],"show":[79,134],"worst-case":[89,150],"bound":[90,102,151],"no":[91,152],"more":[92,153],"than":[93,154],"2,":[94],"give":[97,158],"examples":[98,159],"showing":[99,160],"tight.":[104],"intrees,":[106],"can":[109,164],"be":[110],"solved":[111],"in":[112],"polynomial":[113],"1,":[120],"processors.":[132],"Hu's":[136],"(which":[138],"optimal":[140],"makespan":[143],"objective)":[144],"yields":[145],"1.5,":[155],"ratio":[163],"approach":[165],"1.308999.":[166]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}