{"id":"https://openalex.org/W4380669414","doi":"https://doi.org/10.1145/3578338.3593538","title":"Dynamic Bin Packing with Predictions","display_name":"Dynamic Bin Packing with Predictions","publication_year":2023,"publication_date":"2023-06-13","ids":{"openalex":"https://openalex.org/W4380669414","doi":"https://doi.org/10.1145/3578338.3593538"},"language":"en","primary_location":{"id":"doi:10.1145/3578338.3593538","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3578338.3593538","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Abstract Proceedings of the 2023 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems","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/A5075835633","display_name":"Mozhengfu Liu","orcid":"https://orcid.org/0000-0001-6181-9958"},"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":"Mozhengfu Liu","raw_affiliation_strings":["Nanyang Technological University, Singapore, Singapore"],"raw_orcid":"https://orcid.org/0000-0001-6181-9958","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"],"raw_orcid":"https://orcid.org/0000-0002-7404-7595","affiliations":[{"raw_affiliation_string":"Nanyang Technological University, Singapore, Singapore","institution_ids":["https://openalex.org/I172675005"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I172675005"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"57","last_page":"58"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9998000264167786,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9998000264167786,"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.9998000264167786,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.996399998664856,"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/bin-packing-problem","display_name":"Bin packing problem","score":0.8587676286697388},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.8162548542022705},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.7783656120300293},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6891471147537231},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.6763899326324463},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.6665213704109192},{"id":"https://openalex.org/keywords/server","display_name":"Server","score":0.6267260313034058},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.538651704788208},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5204218029975891},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.49400097131729126},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4007369875907898},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.35313427448272705},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.3481311798095703},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3237403631210327},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3152075409889221}],"concepts":[{"id":"https://openalex.org/C87219788","wikidata":"https://www.wikidata.org/wiki/Q814581","display_name":"Bin packing problem","level":3,"score":0.8587676286697388},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.8162548542022705},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.7783656120300293},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6891471147537231},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.6763899326324463},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.6665213704109192},{"id":"https://openalex.org/C93996380","wikidata":"https://www.wikidata.org/wiki/Q44127","display_name":"Server","level":2,"score":0.6267260313034058},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.538651704788208},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5204218029975891},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.49400097131729126},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4007369875907898},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.35313427448272705},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3481311798095703},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3237403631210327},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3152075409889221},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","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},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3578338.3593538","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3578338.3593538","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Abstract Proceedings of the 2023 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.7200000286102295,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W2048348088","https://openalex.org/W2131641675","https://openalex.org/W2505550437","https://openalex.org/W2560689012","https://openalex.org/W2736690157","https://openalex.org/W2981089183","https://openalex.org/W4311079974"],"related_works":["https://openalex.org/W2042512761","https://openalex.org/W2107065500","https://openalex.org/W2070091108","https://openalex.org/W4288363420","https://openalex.org/W3022071589","https://openalex.org/W1783553888","https://openalex.org/W2481908560","https://openalex.org/W2114780236","https://openalex.org/W2794570164","https://openalex.org/W2567853751"],"abstract_inverted_index":{"The":[0],"MinUsageTime":[1,56,108],"Dynamic":[2],"Bin":[3],"Packing":[4],"(DBP)":[5],"problem":[6,110],"aims":[7],"to":[8,27,100],"minimize":[9],"the":[10,33,39,44,53,68,77,86,107,144,168],"accumulated":[11],"bin":[12],"usage":[13],"time":[14,35],"for":[15,31,134],"packing":[16],"a":[17,151,156],"sequence":[18],"of":[19,36,55,61,81,113,159,172,198],"items":[20,40],"into":[21],"bins.":[22],"It":[23,49],"is":[24,50,76,97,167],"often":[25],"used":[26],"model":[28],"job":[29,92],"dispatching":[30],"optimizing":[32],"busy":[34],"servers,":[37],"where":[38,74,186],"and":[41,46,65,70,190],"bins":[42],"match":[43],"jobs":[45],"servers":[47],"respectively.":[48],"known":[51],"that":[52,118],"competitiveness":[54],"DBP":[57,109],"has":[58],"tight":[59],"bounds":[60],"\u0398(\u221a,":[62],"log":[63,122,179],"\u03bc)":[64,180],"\u0398(\u03bc)":[66],"in":[67],"clairvoyant":[69,124],"non-clairvoyant":[71],"settings":[72],"respectively,":[73],"\u03bc":[75],"max/min":[78],"duration":[79],"ratio":[80,158],"all":[82,175],"items.":[83],"In":[84,102],"practice,":[85],"information":[87],"about":[88],"items'":[89,114],"durations":[90,129,133],"(i.e.,":[91],"lengths)":[93],"obtained":[94],"via":[95],"predictions":[96,112,145,185],"usually":[98],"prone":[99],"errors.":[101],"this":[103],"paper,":[104],"we":[105],"study":[106],"with":[111,155],"durations.":[115],"We":[116,149],"find":[117],"an":[119],"existing":[120],"O(\u221a":[121,178],"\u03bc)-competitive":[123],"algorithm,":[125],"if":[126],"using":[127],"predicted":[128],"rather":[130],"than":[131],"real":[132],"packing,":[135],"does":[136],"not":[137],"provide":[138],"any":[139],"bounded":[140],"performance":[141],"guarantee":[142],"when":[143],"are":[146,200],"adversarially":[147],"bad.":[148],"develop":[150],"new":[152],"online":[153],"algorithm":[154],"competitive":[157],"{O(\u22082":[160],"\u221a":[161],"log(\u22082":[162],"\u03bc)},":[163],"O(\u03bc)":[164,191],"(where":[165],"\u03b5":[166],"maximum":[169],"multiplicative":[170],"error":[171],"prediction":[173],"among":[174],"items),":[176],"achieving":[177],"consistency":[181],"(competitiveness":[182,193],"under":[183,194],"perfect":[184],"\u2208":[187],"=":[188],"1)":[189],"robustness":[192],"terrible":[195],"predictions),":[196],"both":[197],"which":[199],"asymptotically":[201],"optimal.":[202]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}