{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:59:28Z","timestamp":1725515968544},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540688655"},{"type":"electronic","value":"9783540688808"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68880-8_30","type":"book-chapter","created":{"date-parts":[[2008,7,31]],"date-time":"2008-07-31T02:37:59Z","timestamp":1217471879000},"page":"316-327","source":"Crossref","is-referenced-by-count":0,"title":["An Optimal On-Line Algorithm for Preemptive Scheduling on Two Uniform Machines in the \u2113 p Norm"],"prefix":"10.1007","author":[{"given":"Tianping","family":"Shuai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donglei","family":"Du","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoyue","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","unstructured":"Alon, N., Azar, Y., Woeginger, G.J., Yadid, T.: Approximation schemes for scheduling. In: SODA, pp. 493\u2013500 (1997)"},{"key":"30_CR2","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/s004530010051","volume":"29","author":"A. Avidor","year":"2001","unstructured":"Avidor, A., Azar, Y., Sgall, J.: Ancient and new algorithms for load balancing in the \u2113\n                  p\n                 norm. Algorithmica\u00a029, 422\u2013441 (2001)","journal-title":"Algorithmica"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Azar, Y., Epstein, A.: Convex programming for scheduling unrelated parallel machines. In: STOC, pp. 331\u2013337 (2005)","DOI":"10.1145\/1060590.1060639"},{"issue":"2-3","key":"30_CR4","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1016\/j.tcs.2006.05.016","volume":"361","author":"Y. Azar","year":"2006","unstructured":"Azar, Y., Epstein, A., Epstein, L.: Load balancing of temporary tasks in the \u2113\n                  p\n                 norm. Theoretical Computer Science\u00a0361(2-3), 314\u2013328 (2006)","journal-title":"Theoretical Computer Science"},{"key":"30_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/3-540-45471-3_30","volume-title":"Algorithm Theory - SWAT 2002","author":"Y. Azar","year":"2002","unstructured":"Azar, Y., Epstein, L., Richter, Y., Woeginger, G.J.: All-norm approximation algorithms. In: Penttonen, M., Schmidt, E.M. (eds.) SWAT 2002. LNCS, vol.\u00a02368, pp. 288\u2013297. Springer, Heidelberg (2002)"},{"key":"30_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1007\/978-3-540-27810-8_26","volume-title":"Algorithm Theory - SWAT 2004","author":"Y. Azar","year":"2004","unstructured":"Azar, Y., Taub, S.: All-Norm Approximation for Scheduling on Identical Machines. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol.\u00a03111, pp. 298\u2013310. Springer, Heidelberg (2004)"},{"key":"30_CR7","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1137\/0204021","volume":"1","author":"A.K. Chandra","year":"1975","unstructured":"Chandra, A.K., Wong, C.K.: Worst-case analysis of a placement algorithm related to storage allocation. SIAM Journal on Computing\u00a01, 249\u2013263 (1975)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"30_CR8","first-page":"345","volume":"1","author":"D.-L. Du","year":"2005","unstructured":"Du, D.-L., Jiang, X., Zhang, G.: Optimal preemptive online scheduling to minimize lp norm on two processors. Journal of Manufacturing and Management Optimization\u00a01(3), 345\u2013351 (2005)","journal-title":"Journal of Manufacturing and Management Optimization"},{"issue":"2","key":"30_CR9","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1002\/jos.60","volume":"4","author":"L. Epstein","year":"2001","unstructured":"Epstein, L., Noga, J., Seiden, S., Sgall, J., Woeginger, G.J.: Randomized online scheduling on two uniform machines. Journal of Scheduling\u00a04(2), 71\u201392 (2001)","journal-title":"Journal of Scheduling"},{"issue":"1","key":"30_CR10","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.jcss.2005.08.002","volume":"72","author":"L. Epstein","year":"2006","unstructured":"Epstein, L., Tassa, T.: Optimal Preemptive Scheduling for General Target Functions. Journal of Computer and System Sciences\u00a072(1), 132\u2013162 (2006)","journal-title":"Journal of Computer and System Sciences"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"Kumar, V.S.A., Marathe, M.V., Parthasarathy, S., Srinivasan, A.: Approximation Algorithms for Scheduling on Multiple Machines. In: FOCS, pp. 254\u2013263 (2005)","DOI":"10.1109\/SFCS.2005.21"},{"key":"30_CR12","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1016\/S0927-0507(05)80189-6","volume-title":"Logistics of Production and Inventory","author":"E.L. Lawler","year":"1993","unstructured":"Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B.: Sequencing and scheduling: Algorithms and complexity. In: Graves, S.C., Rinnooy Kan, A.H.G., Zipkin, P.H. (eds.) Logistics of Production and Inventory, pp. 445\u2013522. North-Holland, Amsterdam (1993)"},{"issue":"2","key":"30_CR13","first-page":"148","volume":"34","author":"L. Lin","year":"2007","unstructured":"Lin, L.: Semi-online scheduling algorithm under the \u2113\n                  p\n                 norm on two identical machines. Journal of Zhejiang University (Science Edition)\u00a034(2), 148\u2013151 (2007) (in chinese)","journal-title":"Journal of Zhejiang University (Science Edition)"},{"issue":"1","key":"30_CR14","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1631\/jzus.2005.A0020","volume":"6","author":"L. Lin","year":"2005","unstructured":"Lin, L., Tan, Z.Y., He, Y.: Deterministic and randomized scheduling problems under the \u2113\n                  p\n                 norm on two identical machines. Journal of Zhejiang University Science\u00a06(1), 20\u201326 (2005)","journal-title":"Journal of Zhejiang University Science"},{"issue":"1","key":"30_CR15","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.ic.2004.10.002","volume":"196","author":"Z. Tan","year":"2005","unstructured":"Tan, Z., He, Y., Epstein, L.: Optimal On-line Algorithms for the Uniform Machine Scheduling Problem with Ordinal Data. Information and Computation\u00a0196(1), 57\u201370 (2005)","journal-title":"Information and Computation"},{"key":"30_CR16","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/S0167-6377(98)00032-7","volume":"23","author":"J. Wen","year":"1998","unstructured":"Wen, J., Du, D.-L.: Preemptive on-line scheduling for two uniform processors. Operations Research Letters\u00a023, 113\u2013116 (1998)","journal-title":"Operations Research Letters"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68880-8_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T00:17:07Z","timestamp":1620001027000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68880-8_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540688655","9783540688808"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68880-8_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}