{"id":"https://openalex.org/W2083337785","doi":"https://doi.org/10.1145/2312005.2312050","title":"Non-clairvoyant weighted flow time scheduling with rejection penalty","display_name":"Non-clairvoyant weighted flow time scheduling with rejection penalty","publication_year":2012,"publication_date":"2012-06-25","ids":{"openalex":"https://openalex.org/W2083337785","doi":"https://doi.org/10.1145/2312005.2312050","mag":"2083337785"},"language":"en","primary_location":{"id":"doi:10.1145/2312005.2312050","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2312005.2312050","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-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/A5109857068","display_name":"Ho-Leung Chan","orcid":null},"institutions":[{"id":"https://openalex.org/I889458895","display_name":"University of Hong Kong","ror":"https://ror.org/02zhqgq86","country_code":"HK","type":"education","lineage":["https://openalex.org/I889458895"]}],"countries":["HK"],"is_corresponding":true,"raw_author_name":"Ho-Leung Chan","raw_affiliation_strings":["University of Hong Kong, Hong Kong, Hong Kong"],"affiliations":[{"raw_affiliation_string":"University of Hong Kong, Hong Kong, Hong Kong","institution_ids":["https://openalex.org/I889458895"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111962182","display_name":"Sze-Hang Chan","orcid":null},"institutions":[{"id":"https://openalex.org/I889458895","display_name":"University of Hong Kong","ror":"https://ror.org/02zhqgq86","country_code":"HK","type":"education","lineage":["https://openalex.org/I889458895"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Sze-Hang Chan","raw_affiliation_strings":["University of Hong Kong, Hong Kong, Hong Kong"],"affiliations":[{"raw_affiliation_string":"University of Hong Kong, Hong Kong, Hong Kong","institution_ids":["https://openalex.org/I889458895"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077116003","display_name":"Tak\u2010Wah Lam","orcid":"https://orcid.org/0000-0003-4676-8587"},"institutions":[{"id":"https://openalex.org/I889458895","display_name":"University of Hong Kong","ror":"https://ror.org/02zhqgq86","country_code":"HK","type":"education","lineage":["https://openalex.org/I889458895"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Tak-Wah Lam","raw_affiliation_strings":["University of Hong Kong, Hong Kong, Hong Kong"],"affiliations":[{"raw_affiliation_string":"University of Hong Kong, Hong Kong, Hong Kong","institution_ids":["https://openalex.org/I889458895"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060707834","display_name":"Lap\u2013Kei Lee","orcid":"https://orcid.org/0000-0001-9619-6041"},"institutions":[{"id":"https://openalex.org/I889458895","display_name":"University of Hong Kong","ror":"https://ror.org/02zhqgq86","country_code":"HK","type":"education","lineage":["https://openalex.org/I889458895"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Lap-Kei Lee","raw_affiliation_strings":["University of Hong Kong, Hong Kong, Hong Kong"],"affiliations":[{"raw_affiliation_string":"University of Hong Kong, Hong Kong, Hong Kong","institution_ids":["https://openalex.org/I889458895"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018060667","display_name":"Jian-Qiao Zhu","orcid":null},"institutions":[{"id":"https://openalex.org/I889458895","display_name":"University of Hong Kong","ror":"https://ror.org/02zhqgq86","country_code":"HK","type":"education","lineage":["https://openalex.org/I889458895"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Jianqiao Zhu","raw_affiliation_strings":["University of Hong Kong, Hong Kong, Hong Kong"],"affiliations":[{"raw_affiliation_string":"University of Hong Kong, Hong Kong, Hong Kong","institution_ids":["https://openalex.org/I889458895"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5109857068"],"corresponding_institution_ids":["https://openalex.org/I889458895"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.17283917,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"246","last_page":"254"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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":1.0,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9948999881744385,"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"}},{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.987500011920929,"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/competitive-analysis","display_name":"Competitive analysis","score":0.8096354603767395},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7635526061058044},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.7005605697631836},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.6668617129325867},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.48718708753585815},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.482552707195282},{"id":"https://openalex.org/keywords/penalty-method","display_name":"Penalty method","score":0.4577781558036804},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.4180186092853546},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.401981920003891},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3416273593902588},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.32679617404937744},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1212243139743805},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.11901265382766724},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.08491453528404236}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.8096354603767395},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7635526061058044},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.7005605697631836},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.6668617129325867},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.48718708753585815},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.482552707195282},{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.4577781558036804},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.4180186092853546},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.401981920003891},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3416273593902588},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.32679617404937744},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1212243139743805},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.11901265382766724},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.08491453528404236},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"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":3,"locations":[{"id":"doi:10.1145/2312005.2312050","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2312005.2312050","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"},{"id":"pmh:oai:hub.hku.hk:10722/164910","is_oa":false,"landing_page_url":"http://hdl.handle.net/10722/164910","pdf_url":null,"source":{"id":"https://openalex.org/S4377196271","display_name":"The HKU Scholars Hub (University of Hong Kong)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I889458895","host_organization_name":"University of Hong Kong","host_organization_lineage":["https://openalex.org/I889458895"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference_Paper"},{"id":"pmh:oai:pure.atira.dk:publications/faa89bef-c211-40d8-ab37-590e953d961b","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/faa89bef-c211-40d8-ab37-590e953d961b","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Chan, H-L, Chan, S-H, Lam, T-W, Lee, L K & Zhu, J 2012, Non-clairvoyant weighted flow time scheduling with rejection penalty. in Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA. Association for Computing Machinery, pp. 246-254 , Symposium on Parallelism in Algorithms and Architectures , Montreal, Canada, 23/07/2012. https://doi.org/10.1145/2312005.2312050","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.8399999737739563,"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1788468678","https://openalex.org/W1972868674","https://openalex.org/W1980488765","https://openalex.org/W2014008637","https://openalex.org/W2026347217","https://openalex.org/W2053806044","https://openalex.org/W2089060965","https://openalex.org/W2099961254","https://openalex.org/W2109827459","https://openalex.org/W2111339397","https://openalex.org/W2131490632","https://openalex.org/W2134553994","https://openalex.org/W2148612335","https://openalex.org/W2152025418","https://openalex.org/W2912168264"],"related_works":["https://openalex.org/W4213299358","https://openalex.org/W2564742953","https://openalex.org/W2793095688","https://openalex.org/W1623410360","https://openalex.org/W3115340459","https://openalex.org/W2950803469","https://openalex.org/W2583614279","https://openalex.org/W2004975914","https://openalex.org/W2109659895","https://openalex.org/W1930615501"],"abstract_inverted_index":{"This":[0,99,197,266],"paper":[1,100,198,267],"initiates":[2],"the":[3,12,16,34,46,55,60,63,75,81,102,111,205,209,215,219,223,245,257,260,275],"study":[4,207,256],"of":[5,20,49,59,166,225,233,249],"online":[6,90,142],"scheduling":[7,236],"with":[8,42,94],"rejection":[9,35,242],"penalty":[10,36,64],"in":[11],"non-clairvoyant":[13,104,168,271],"setting,":[14],"i.e.,":[15],"size":[17],"(processing":[18],"time)":[19],"a":[21,43,50,116,164,179,190,194,281],"job":[22,51,61,241,250],"is":[23,52,67,139,228,253],"not":[24],"assumed":[25],"to":[26,208,239,255],"be":[27,40,145,161],"known":[28],"at":[29,193],"its":[30],"release":[31],"time.":[32],"In":[33],"model,":[37,213],"jobs":[38,93],"can":[39,144,159,217],"rejected":[41,68],"penalty,":[44],"and":[45,86,97,119,222,243,247,264,284],"user":[47,77,113,156,262,276],"cost":[48,78,114,157,263,277],"defined":[53],"as":[54,163],"weighted":[56,172],"flow":[57,151,173],"time":[58,152,174],"plus":[62,278],"if":[65,135],"it":[66],"before":[69],"completion.":[70],"Previous":[71],"work":[72],"on":[73,80,115,170,203,280],"minimizing":[74,110,149,171,274],"total":[76,112],"focused":[79],"clairvoyant":[82],"single-processor":[83],"setting":[84],"[BBC+03,CLL11]":[85],"has":[87,238],"produced":[88],"O(1)-competitive":[89,108,146,270],"algorithm":[91,143,237],"for":[92,109,127,148,178,184,273],"arbitrary":[95,230],"weights":[96],"penalties.":[98],"gives":[101,268],"first":[103],"algorithms":[105,272],"that":[106,134],"are":[107],"single":[117,180,282],"processor":[118,191,216,283],"multi-processors,":[120,285],"when":[121],"using":[122],"slightly":[123],"faster":[124],"(i.e.,":[125],"(1+\u03b5)-speed":[126],"any":[128],"\u03b5":[129],">":[130],"0)":[131],"processors.":[132],"Note":[133],"no":[136,141],"extra":[137],"speed":[138,211,220,248],"allowed,":[140],"even":[147],"(unweighted)":[150],"alone.":[153],"The":[154,186],"new":[155],"results":[158,169,188,202],"also":[160],"regarded":[162],"generalization":[165],"previous":[167],"alone":[175],"(WSETF":[176],"[BaD07]":[177],"processor;":[181],"WLAPS":[182],"[ZCL11]":[183],"multi-processors).":[185],"above":[187,206],"assume":[189],"running":[192],"fixed":[195],"speed.":[196,234],"shows":[199],"more":[200],"interesting":[201,254],"extending":[204],"dynamic":[210],"scaling":[212],"where":[214],"vary":[218],"dynamically":[221],"rate":[224],"energy":[226,279],"consumption":[227],"an":[229],"increasing":[231],"function":[232],"A":[235],"decide":[240],"determine":[244],"order":[246],"execution.":[251],"It":[252],"tradeoff":[258],"between":[259],"above-mentioned":[261],"energy.":[265],"two":[269],"respectively.":[286]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}