乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,25]],"date-time":"2024-06-25T09:15:35Z","timestamp":1719306935755},"reference-count":17,"publisher":"Elsevier BV","issue":"8-10","license":[{"start":{"date-parts":[[2011,3,1]],"date-time":"2011-03-01T00:00:00Z","timestamp":1298937600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2015,3,4]],"date-time":"2015-03-04T00:00:00Z","timestamp":1425427200000},"content-version":"vor","delay-in-days":1464,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2011,3]]},"DOI":"10.1016\/j.tcs.2010.10.019","type":"journal-article","created":{"date-parts":[[2010,10,31]],"date-time":"2010-10-31T08:16:43Z","timestamp":1288513003000},"page":"642-653","source":"Crossref","is-referenced-by-count":18,"title":["Online scheduling with rearrangement on two related machines"],"prefix":"10.1016","volume":"412","author":[{"given":"Gy\u00f6rgy","family":"D\u00f3sa","sequence":"first","affiliation":[]},{"given":"Yuxin","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Xin","family":"Han","sequence":"additional","affiliation":[]},{"given":"He","family":"Guo","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.tcs.2010.10.019_br000005","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1137\/S0097539797324874","article-title":"Better bounds for online scheduling","volume":"29","author":"Albers","year":"1999","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/j.tcs.2010.10.019_br000010","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1006\/jcss.1995.1074","article-title":"New algorithms for an ancient scheduling problem","volume":"51","author":"Bartal","year":"1995","journal-title":"J. Comput. Syst. Sci."},{"issue":"31\u201333","key":"10.1016\/j.tcs.2010.10.019_br000015","doi-asserted-by":"crossref","first-page":"2890","DOI":"10.1016\/j.tcs.2010.04.020","article-title":"Online scheduling with reassignment on two uniform machines","volume":"411","author":"Cao","year":"2010","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"10.1016\/j.tcs.2010.10.019_br000020","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s10878-008-9200-y","article-title":"Online scheduling with a buffer on related machines","volume":"20","author":"D\u00f3sa","year":"2010","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.tcs.2010.10.019_br000025","doi-asserted-by":"crossref","unstructured":"G. D\u00f3sa, L. Epstein, Preemptive online scheduling with reordering, In: ESA, pp. 456\u2013467, 2009.","DOI":"10.1007\/978-3-642-04128-0_41"},{"key":"10.1016\/j.tcs.2010.10.019_br000030","doi-asserted-by":"crossref","unstructured":"M. Englert, D. \u00f6zmen, M. Westermann, The power of reordering for online minimum makespan scheduling. In: Proc. 48th Symp. Foundations of Computer Science, FOCS, 2008, pp. 603\u2013612.","DOI":"10.1109\/FOCS.2008.46"},{"key":"10.1016\/j.tcs.2010.10.019_br000035","unstructured":"M.R. Garey, D.S. Johnson, Strong np-completeness results: motivation, examples and implications, 25 (1978) 499\u2013508."},{"key":"10.1016\/j.tcs.2010.10.019_br000040","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","article-title":"Optimization and approximation in deterministic sequencing and scheduling: a survey","volume":"5","author":"Graham","year":"1979","journal-title":"Annals of Discrete Mathematics"},{"issue":"3","key":"10.1016\/j.tcs.2010.10.019_br000045","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1137\/S0097539702403438","article-title":"Improved bounds for the online scheduling problem","volume":"32","author":"Rudin","year":"2003","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/j.tcs.2010.10.019_br000050","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1006\/jagm.1996.0019","article-title":"A better algorithm for an ancient scheduling problem","volume":"20","author":"Karger","year":"1996","journal-title":"J. Algorithms"},{"issue":"5","key":"10.1016\/j.tcs.2010.10.019_br000055","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/S0167-6377(98)00005-4","article-title":"Semi on-line algorithms for the partition problem","volume":"21","author":"Kellerer","year":"1997","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/j.tcs.2010.10.019_br000060","doi-asserted-by":"crossref","unstructured":"S. Li, Y. Zhou, G. Sun, G. Chen, Study on parallel machine scheduling problem with buffer, in: Proc. of the 2nd International Multisymposium on Computer and Computational Sciences, IMSCCS 2007, 2007, pp. 278\u2013281.","DOI":"10.1109\/IMSCCS.2007.32"},{"issue":"21\u201323","key":"10.1016\/j.tcs.2010.10.019_br000065","doi-asserted-by":"crossref","first-page":"2099","DOI":"10.1016\/j.tcs.2009.01.007","article-title":"Online scheduling on two uniform machines to minimize the makespan","volume":"410","author":"Liu","year":"2009","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"10.1016\/j.tcs.2010.10.019_br000070","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1287\/moor.1090.0381","article-title":"Online scheduling with bounded migration","volume":"34","author":"Sivadasan","year":"2009","journal-title":"Math. Oper. Res."},{"key":"10.1016\/j.tcs.2010.10.019_br000075","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1002\/1099-1425(200011\/12)3:6<343::AID-JOS54>3.0.CO;2-2","article-title":"Online scheduling revisited","volume":"3","author":"Fleischer","year":"2000","journal-title":"J. Sched."},{"issue":"2","key":"10.1016\/j.tcs.2010.10.019_br000080","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1016\/j.orl.2007.06.004","article-title":"Online scheduling with reassignment","volume":"36","author":"Tan","year":"2008","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/j.tcs.2010.10.019_br000085","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/S0020-0190(97)00006-9","article-title":"A simple semi on-line algorithm for p2\/\/cmax with a buffer","volume":"61","author":"Zhang","year":"1997","journal-title":"Inform. Process. Lett."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397510005815?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397510005815?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T00:16:45Z","timestamp":1559780205000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397510005815"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3]]},"references-count":17,"journal-issue":{"issue":"8-10","published-print":{"date-parts":[[2011,3]]}},"alternative-id":["S0304397510005815"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2010.10.019","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2011,3]]}}}