{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,14]],"date-time":"2023-01-14T22:13:47Z","timestamp":1673734427786},"reference-count":17,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2012,11,1]],"date-time":"2012-11-01T00:00:00Z","timestamp":1351728000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[2012,11]]},"DOI":"10.1109\/tc.2011.168","type":"journal-article","created":{"date-parts":[[2011,9,12]],"date-time":"2011-09-12T20:23:12Z","timestamp":1315858992000},"page":"1601-1610","source":"Crossref","is-referenced-by-count":5,"title":["Online Bounds on Balancing Two Independent Criteria with Replication and Reallocation"],"prefix":"10.1109","volume":"61","author":[{"given":"Savio S.H.","family":"Tse","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"bibttc201211160114","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2008.4536292"},{"key":"bibttc201211160115","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2005.63"},{"key":"bibttc201211160116","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2008.79"},{"key":"bibttc201211160117","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jagm.2000.1074","article-title":"Load Balancing for Response Time","volume":"35","author":"westbrook","year":"2000","journal-title":"J Algorithms"},{"key":"bibttc20121116019","doi-asserted-by":"publisher","DOI":"10.1109\/WPDRTS.1995.470510"},{"key":"bibttc20121116016","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322226"},{"key":"bibttc20121116015","doi-asserted-by":"publisher","DOI":"10.1145\/564875.564878"},{"key":"bibttc20121116018","author":"garey","year":"1979","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"},{"key":"bibttc20121116017","doi-asserted-by":"publisher","DOI":"10.1002\/1099-1425(200011\/12)3:6<343::AID-JOS54>3.0.CO;2-2"},{"key":"bibttc20121116012","first-page":"137","author":"amita","year":"2002","journal-title":"Data Warehousing and Web Engineering"},{"key":"bibttc20121116011","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.10.002"},{"key":"bibttc20121116014","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2005.07.006"},{"key":"bibttc20121116013","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009263"},{"key":"bibttc201211160111","author":"knuth","year":"1973","journal-title":"The art of computer programming"},{"key":"bibttc201211160110","doi-asserted-by":"publisher","DOI":"10.1109\/HPC.2000.846539"},{"key":"bibttc201211160113","author":"rudin","year":"2001","journal-title":"?Improved Bounds for the Online Scheduling Problem ?"},{"key":"bibttc201211160112","doi-asserted-by":"publisher","DOI":"10.1109\/RELDIS.1997.632803"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/12\/6311380\/06007129.pdf?arnumber=6007129","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:39:26Z","timestamp":1638218366000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6007129\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11]]},"references-count":17,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tc.2011.168","relation":{},"ISSN":["0018-9340"],"issn-type":[{"value":"0018-9340","type":"print"}],"subject":[],"published":{"date-parts":[[2012,11]]}}}