{"id":"https://openalex.org/W2469847610","doi":"https://doi.org/10.1145/2935764.2935775","title":"Clairvoyant Dynamic Bin Packing for Job Scheduling with Minimum Server Usage Time","display_name":"Clairvoyant Dynamic Bin Packing for Job Scheduling with Minimum Server Usage Time","publication_year":2016,"publication_date":"2016-07-08","ids":{"openalex":"https://openalex.org/W2469847610","doi":"https://doi.org/10.1145/2935764.2935775","mag":"2469847610"},"language":"en","primary_location":{"id":"doi:10.1145/2935764.2935775","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2935764.2935775","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 28th 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/A5047511868","display_name":"Runtian Ren","orcid":"https://orcid.org/0000-0002-8640-0421"},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":true,"raw_author_name":"Runtian Ren","raw_affiliation_strings":["Nanyang Technological University, Singapore, Singapore"],"affiliations":[{"raw_affiliation_string":"Nanyang Technological University, Singapore, Singapore","institution_ids":["https://openalex.org/I172675005"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015527156","display_name":"Xueyan Tang","orcid":"https://orcid.org/0000-0002-7404-7595"},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Xueyan Tang","raw_affiliation_strings":["Nanyang Technological University, Singapore, Singapore"],"affiliations":[{"raw_affiliation_string":"Nanyang Technological University, Singapore, Singapore","institution_ids":["https://openalex.org/I172675005"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5047511868"],"corresponding_institution_ids":["https://openalex.org/I172675005"],"apc_list":null,"apc_paid":null,"fwci":4.0798,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":{"value":0.94247069,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"227","last_page":"237"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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.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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/bin-packing-problem","display_name":"Bin packing problem","score":0.9258251190185547},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.7871071100234985},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.6974706649780273},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.6840694546699524},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6624521017074585},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.57501620054245},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5029651522636414},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4982268810272217},{"id":"https://openalex.org/keywords/packing-problems","display_name":"Packing problems","score":0.45789864659309387},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4521102011203766},{"id":"https://openalex.org/keywords/due-date","display_name":"Due date","score":0.4103724956512451},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3844376504421234},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.36046573519706726},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23021221160888672},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.06559032201766968}],"concepts":[{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.9258251190185547},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.7871071100234985},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.6974706649780273},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.6840694546699524},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6624521017074585},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.57501620054245},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5029651522636414},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4982268810272217},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.45789864659309387},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4521102011203766},{"id":"https://openalex.org/C3019208289","wikidata":"https://www.wikidata.org/wiki/Q56612115","display_name":"Due date","level":3,"score":0.4103724956512451},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3844376504421234},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.36046573519706726},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23021221160888672},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.06559032201766968},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2935764.2935775","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2935764.2935775","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6700000166893005,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1526652389","https://openalex.org/W1552828154","https://openalex.org/W1590696547","https://openalex.org/W1734979789","https://openalex.org/W1770425921","https://openalex.org/W1779195044","https://openalex.org/W1969299781","https://openalex.org/W1975216035","https://openalex.org/W2015054838","https://openalex.org/W2027120277","https://openalex.org/W2048348088","https://openalex.org/W2074988668","https://openalex.org/W2122882715","https://openalex.org/W2131641675","https://openalex.org/W2139090343","https://openalex.org/W2140320442","https://openalex.org/W2171119981","https://openalex.org/W2176549387","https://openalex.org/W2181516744","https://openalex.org/W2246750081","https://openalex.org/W2505550437","https://openalex.org/W2611804663","https://openalex.org/W2959792658"],"related_works":["https://openalex.org/W4213299358","https://openalex.org/W2564742953","https://openalex.org/W2042512761","https://openalex.org/W2070091108","https://openalex.org/W1830700568","https://openalex.org/W3022071589","https://openalex.org/W2481908560","https://openalex.org/W2114780236","https://openalex.org/W2794570164","https://openalex.org/W2109595574"],"abstract_inverted_index":{"The":[0],"MinUsageTime":[1,39,66,94,189],"Dynamic":[2],"Bin":[3],"Packing":[4],"(DBP)":[5],"problem":[6],"targets":[7],"at":[8,55],"minimizing":[9],"the":[10,16,19,24,42,46,56,69,73,87,102,120,131,159,169,184,193],"accumulated":[11],"usage":[12],"time":[13,48,57,75],"of":[14,49,58,76,92,128,134,143,161],"all":[15],"bins":[17],"in":[18,31,41,68],"packing":[20,82,137,173],"process.":[21],"It":[22,175],"models":[23],"server":[25],"acquisition":[26],"and":[27,89,113,153],"job":[28],"scheduling":[29],"issues":[30],"many":[32],"cloud-based":[33],"systems.":[34],"Earlier":[35],"work":[36],"has":[37],"studied":[38],"DBP":[40,67,190],"non-clairvoyant":[43],"setting":[44,71],"where":[45,72],"departure":[47,74],"each":[50,77],"item":[51,78,144],"is":[52,79,176],"not":[53],"known":[54,80],"its":[59],"arrival.":[60],"In":[61],"this":[62],"paper,":[63],"we":[64,123],"investigate":[65],"clairvoyant":[70],"for":[81,101,146,187],"purposes.":[83],"We":[84,96,139,157],"study":[85],"both":[86,179],"offline":[88,103],"online":[90,121,136,147],"versions":[91],"Clairvoyant":[93,188],"DBP.":[95],"present":[97],"two":[98,141],"approximation":[99],"algorithms":[100],"problem,":[104,122],"including":[105,149],"a":[106,114,125,150,154],"5-approximation":[107],"Duration":[108],"Descending":[109],"First":[110,171,195],"Fit":[111,172,196],"algorithm":[112],"4-approximation":[115],"Dual":[116],"Coloring":[117],"algorithm.":[118,138,174,197],"For":[119],"establish":[124],"lower":[126],"bound":[127],"1+\u221a5/2":[129],"on":[130],"competitive":[132,185],"ratio":[133,186],"any":[135],"propose":[140],"strategies":[142,163,180],"classification":[145],"packing,":[148],"classify-by-departure-time":[151],"strategy":[152],"classify-by-duration":[155],"strategy.":[156],"analyze":[158],"competitiveness":[160],"these":[162],"when":[164],"they":[165],"are":[166],"applied":[167],"to":[168,192],"classical":[170],"shown":[177],"that":[178],"can":[181],"substantially":[182],"reduce":[183],"compared":[191],"original":[194]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}