{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,10]],"date-time":"2025-04-10T10:12:24Z","timestamp":1744279944237},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,7,5]],"date-time":"2014-07-05T00:00:00Z","timestamp":1404518400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1007\/s10951-014-0387-8","type":"journal-article","created":{"date-parts":[[2014,7,4]],"date-time":"2014-07-04T01:37:25Z","timestamp":1404437845000},"page":"185-194","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On-line preemptive machine scheduling with $$\\ell _p$$ \u2113 p norm on two uniform machines"],"prefix":"10.1007","volume":"18","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","published-online":{"date-parts":[[2014,7,5]]},"reference":[{"key":"387_CR1","unstructured":"Alon, N., Azar, Y., Woeginger, G. J., & Yadid, T. (1997). Approximation schemes for scheduling. In Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (pp. 493\u2013500). ACM\/SIAM."},{"key":"387_CR2","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1007\/s004530010051","volume":"29","author":"A Avidor","year":"2001","unstructured":"Avidor, A., Azar, Y., & Sgall, J. (2001). Ancient and new algorithms for load balancing in the $$\\ell _p$$ \u2113 p norm. Algorithmica, 29, 422\u2013441.","journal-title":"Algorithmica"},{"key":"387_CR3","doi-asserted-by":"crossref","unstructured":"Azar, Y., & Epstein, A. (2005). Convex programming for scheduling unrelated parallel machines. In H. N. Gabow, & R. Fagin (Eds.), Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC) (pp. 331\u2013337).","DOI":"10.1145\/1060590.1060639"},{"key":"387_CR4","unstructured":"Azar, Y., & Taub, S. (2004). All-norm approximation for scheduling on identical machines. In T. Hagerup, & J. Katajainen (Eds.), Scandinavian Workshop on Algorithm Theory (SWAT). Lecture Notes in Computer Science (Vol. 3111, pp. 298\u2013310). Berlin: Springer."},{"issue":"2\u20133","key":"387_CR5","doi-asserted-by":"crossref","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. (2006). Load balancing of temporary tasks in the $$\\ell _p$$ \u2113 p norm. Theoretical Computer Science, 361(2\u20133), 314\u2013328.","journal-title":"Theoretical Computer Science"},{"key":"387_CR6","unstructured":"Azar, Y., Epstein, L., Richter, Y., & Woeginger, G.J. (2002). All-norm approximation algorithms. In M. Penttonen, & M. E. Schmidt (Eds.), Scandinavian Workshop on Algorithm Theory(SWAT). Lecture Notes in Computer Science (Vol. 2368, pp. 288\u2013297). Berlin: Springer."},{"issue":"3","key":"387_CR7","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF01257086","volume":"20","author":"JA Bannister","year":"1983","unstructured":"Bannister, J. A., & Trivedi, K. S. (1983). Task allocation in fault-tolerant distributed systems. Acta Informatica, 20(3), 261\u2013281.","journal-title":"Acta Informatica"},{"issue":"7","key":"387_CR8","doi-asserted-by":"crossref","first-page":"3311","DOI":"10.1137\/090772228","volume":"39","author":"N Bansal","year":"2010","unstructured":"Bansal, N., & Pruhs, K. R. (2010). Server scheduling to balance priorities, fairness and average quality of service. SIAM Journal of Computing, 39(7), 3311\u20133335.","journal-title":"SIAM Journal of Computing"},{"key":"387_CR9","unstructured":"Caragiannis, I. (2008). Better bounds for online load balancing on unrelated machines. In Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 08) (pp. 972\u2013981)."},{"key":"387_CR10","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1137\/0204021","volume":"1","author":"AK Chandra","year":"1975","unstructured":"Chandra, A. K., & Wong, C. K. (1975). Worst-case analysis of a placement algorithm related to storage allocation. SIAM Journal on Computing, 1, 249\u2013263.","journal-title":"SIAM Journal on Computing"},{"key":"387_CR11","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/S0166-218X(00)00268-7","volume":"110","author":"B Chen","year":"2001","unstructured":"Chen, B., Du, D., Han, J., & Wen, J. (2001). On-line scheduling of small open shops. Discrete Applied Mathematics, 110, 133\u2013150.","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"387_CR12","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1145\/321921.321933","volume":"23","author":"RA Cody","year":"1976","unstructured":"Cody, R. A., & Coffman, E. G. (1976). Record allocation for minimizing expected retrieval costs on drum-like storage devices. Journal of the ACM, 23(1), 103\u2013115.","journal-title":"Journal of the ACM"},{"key":"387_CR13","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/j.ipl.2004.09.003","volume":"92","author":"D Du","year":"2004","unstructured":"Du, D. (2004). Optimal preemptive semi-online scheduling on two uniform processors. Information Processing Letters, 92, 219\u2013223.","journal-title":"Information Processing Letters"},{"issue":"3","key":"387_CR14","first-page":"345","volume":"1","author":"D Du","year":"2005","unstructured":"Du, D., Jiang, X., & Zhang, G. (2005). Optimal preemptive online scheduling to minimize $$l_p$$ l p norm on two processors. Journal of Manufacturing and Management Optimization, 1(3), 345\u2013351.","journal-title":"Journal of Manufacturing and Management Optimization"},{"issue":"1","key":"387_CR15","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/j.jcss.2005.08.002","volume":"72","author":"L Epstein","year":"2006","unstructured":"Epstein, L., & Tassa, T. (2006). Optimal Preemptive Scheduling for General Target Functions. Journal of Computer and System Sciences, 72(1), 132\u2013162.","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"387_CR16","doi-asserted-by":"crossref","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. (2001). Randomized online scheduling on two uniform machines. Journal of Scheduling, 4(2), 71\u201392.","journal-title":"Journal of Scheduling"},{"key":"387_CR17","unstructured":"Feigenbaum, I., & Sethuraman, J., Ye, C. (2013). Approximately optimal nechanisms for strategyproof facility location: Minimizing $$L_p$$ L p norm of costs. arXiv:1305.2446 [cs.GT]."},{"key":"387_CR18","unstructured":"Feldman, M., & Wilf, Y. (2011). Randomized strategyproof mechanisms for facility location and the mini-sum-of-squares objective. CoRR, abs\/1108.1762, 2011."},{"key":"387_CR19","unstructured":"Golovin, D., Gupta, A., Kumar, A., Tangwongsan, K., (2007) All-norms and all-Lp-norms approximation algorithms. Computer Science Department, Carnegie Mellon University. Paper 828. http:\/\/repository.cmu.edu\/compsci\/828 ."},{"issue":"1","key":"387_CR20","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1006\/jcss.2001.1752","volume":"63","author":"J Kleinberg","year":"2001","unstructured":"Kleinberg, J., Rabani, Y., & Tardos, E. (2001). Fairness in routing and load balancing. Journal of Computer and System Sciences, 63(1), 2\u201320.","journal-title":"Journal of Computer and System Sciences"},{"key":"387_CR21","doi-asserted-by":"crossref","unstructured":"Kumar, V. S. A., Marathe, M. V., Parthasarathy, S., & Srinivasan, A. (2005). Approximation algorithms for scheduling on multiple machines. In 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS) (pp. 254\u2013263).","DOI":"10.1109\/SFCS.2005.21"},{"issue":"2","key":"387_CR22","first-page":"148","volume":"34","author":"L Lin","year":"2007","unstructured":"Lin, L. (2007). Semi-online scheduling algorithm under the $$\\ell _p$$ \u2113 p norm on two identical machines. Journal of Zhejiang University (Science Edition), 34(2), 148\u2013151. (In Chinese).","journal-title":"Journal of Zhejiang University (Science Edition)"},{"issue":"1","key":"387_CR23","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1631\/jzus.2005.A0020","volume":"6","author":"L Lin","year":"2005","unstructured":"Lin, L., Tan, Z. Y., & He, Y. (2005). Deterministic and randomized scheduling problems under the $$\\ell _p$$ \u2113 p norm on two identical machines. Journal of Zhejiang University Science, 6(1), 20\u201326.","journal-title":"Journal of Zhejiang University Science"},{"key":"387_CR24","unstructured":"Munagala, K., Babu, S., Motwani, R., Widom, J. (2005). The pipelined set cover problem. Database Theory\u2014ICDT 2005, 10th International Conference (pp. 83\u201398)."},{"key":"387_CR25","doi-asserted-by":"crossref","unstructured":"Tan, Z., He, Y., & Epstein, L. (2005). Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data. Information and Computation, 196(1), 57\u201370.","DOI":"10.1016\/j.ic.2004.10.002"},{"key":"387_CR26","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/S0167-6377(98)00032-7","volume":"23","author":"J Wen","year":"1998","unstructured":"Wen, J., & Du, D. (1998). Preemptive on-line scheduling for two uniform processors. Operations Research Letters, 23, 113\u2013116.","journal-title":"Operations Research Letters"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-014-0387-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-014-0387-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-014-0387-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,12]],"date-time":"2019-08-12T07:37:43Z","timestamp":1565595463000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-014-0387-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,5]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["387"],"URL":"https:\/\/doi.org\/10.1007\/s10951-014-0387-8","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,7,5]]}}}