{"id":"https://openalex.org/W2025565904","doi":"https://doi.org/10.1137/0218022","title":"Minimizing Schedule Length Subject to Minimum Flow Time","display_name":"Minimizing Schedule Length Subject to Minimum Flow Time","publication_year":1989,"publication_date":"1989-04-01","ids":{"openalex":"https://openalex.org/W2025565904","doi":"https://doi.org/10.1137/0218022","mag":"2025565904"},"language":"en","primary_location":{"id":"doi:10.1137/0218022","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0218022","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5108400400","display_name":"Joseph Y.\u2010T. Leung","orcid":null},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Joseph Y-T. Leung","raw_affiliation_strings":["Univ. of Texas at Dallas, Richardson"],"affiliations":[{"raw_affiliation_string":"Univ. of Texas at Dallas, Richardson","institution_ids":["https://openalex.org/I162577319"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111403679","display_name":"Gilbert H. Young","orcid":null},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Gilbert H. Young","raw_affiliation_strings":["Univ. of Texas at Dallas, Richardson"],"affiliations":[{"raw_affiliation_string":"Univ. of Texas at Dallas, Richardson","institution_ids":["https://openalex.org/I162577319"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5108400400"],"corresponding_institution_ids":["https://openalex.org/I162577319"],"apc_list":null,"apc_paid":null,"fwci":2.1707,"has_fulltext":false,"cited_by_count":43,"citation_normalized_percentile":{"value":0.86790373,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"18","issue":"2","first_page":"314","last_page":"326"},"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.9983000159263611,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9947999715805054,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/preemption","display_name":"Preemption","score":0.7833662033081055},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.6964823007583618},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.625289261341095},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5562364459037781},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4971947968006134},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3390328288078308},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29684892296791077}],"concepts":[{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.7833662033081055},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.6964823007583618},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.625289261341095},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5562364459037781},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4971947968006134},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3390328288078308},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29684892296791077},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0218022","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0218022","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1984027871","https://openalex.org/W2003327526","https://openalex.org/W2019133545","https://openalex.org/W2027372432","https://openalex.org/W2058817479","https://openalex.org/W2067297441","https://openalex.org/W2093979815","https://openalex.org/W2104680817","https://openalex.org/W2126734353"],"related_works":["https://openalex.org/W3191866865","https://openalex.org/W840708677","https://openalex.org/W2361541374","https://openalex.org/W1439300391","https://openalex.org/W1970491116","https://openalex.org/W2888133284","https://openalex.org/W601696587","https://openalex.org/W3088661666","https://openalex.org/W2881508932","https://openalex.org/W4387006201"],"abstract_inverted_index":{"The":[0,102],"problem":[1,41,49],"of":[2,16],"scheduling":[3],"n":[4],"independent":[5],"tasks":[6],"on":[7],"$m":[8,78],"\\geqq":[9],"1$":[10,80],"identical":[11],"processors,":[12],"with":[13,75],"the":[14,18,22,40,48,113,117],"objective":[15],"minimizing":[17,112],"schedule":[19,68,90,118],"length":[20],"under":[21],"constraint":[23],"that":[24,39,47,86,105],"it":[25,36],"must":[26],"have":[27],"minimum":[28],"flow":[29,114],"time,":[30],"is":[31,37,42,50,69,83,107],"considered.":[32],"For":[33],"nonpreemptive":[34,89],"scheduling,":[35],"known":[38],"NP-hard.":[43],"This":[44,71],"paper":[45],"shows":[46],"a":[51],"lot":[52],"easier":[53],"for":[54],"preemptive":[55,67,100],"scheduling.":[56],"Specifically,":[57],"an":[58,65,87,98],"$O(n\\log":[59],"n)$":[60],"time":[61,115],"algorithm":[62,72],"to":[63],"find":[64],"optimal":[66,88,99],"given.":[70],"generates":[73],"schedules":[74],"at":[76],"most":[77],"-":[79],"preemptions.":[81],"It":[82],"also":[84],"shown":[85],"can":[91],"be":[92],"almost":[93],"twice":[94],"as":[95,97],"long":[96],"schedule.":[101],"results":[103],"suggest":[104],"preemption":[106],"extremely":[108],"beneficial":[109],"in":[110],"simultaneously":[111],"and":[116],"length.":[119]},"counts_by_year":[{"year":2022,"cited_by_count":5},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}