{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T17:08:44Z","timestamp":1676826524000},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,5,31]],"date-time":"2008-05-31T00:00:00Z","timestamp":1212192000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2010,1]]},"DOI":"10.1007\/s10878-008-9170-0","type":"journal-article","created":{"date-parts":[[2008,5,30]],"date-time":"2008-05-30T15:56:41Z","timestamp":1212163001000},"page":"107-122","source":"Crossref","is-referenced-by-count":7,"title":["Worst-case analysis for on-line service policies"],"prefix":"10.1007","volume":"19","author":[{"given":"Zhenbo","family":"Wang","sequence":"first","affiliation":[]},{"given":"Wenxun","family":"Xing","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,5,31]]},"reference":[{"key":"9170_CR1","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1145\/258128.258201","volume":"44","author":"J Aspnes","year":"1997","unstructured":"Aspnes J, Azar Y, Fiat A, Plotkin S, Waarts O (1997) On-line load balancing with applications to machine scheduling and virtual circuit routing. J ACM 44:486\u2013504","journal-title":"J ACM"},{"key":"9170_CR2","unstructured":"Azar Y, Naor J, Rom R (1992) The competitiveness of on-line assignments. In: Proceedings of 3rd annual ACM-SIAM symp. on discrete algorithms, pp 203\u2013210"},{"key":"9170_CR3","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0167-6377(94)90071-X","volume":"16","author":"B Chen","year":"1994","unstructured":"Chen B, Vliet AV, Woeginger GJ (1994) New lower and upper bounds for on-line scheduling. Oper Res Lett 16:221\u2013230","journal-title":"Oper Res Lett"},{"key":"9170_CR4","first-page":"107","volume":"9","author":"U Faigle","year":"1989","unstructured":"Faigle U, Kern W, Turan G (1989) On the performance of on-line algorithms for partition problems. Acta Cybern 9:107\u2013119","journal-title":"Acta Cybern"},{"key":"9170_CR5","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1145\/322077.322090","volume":"25","author":"MR Garey","year":"1978","unstructured":"Garey MR, Johnson DS (1978) Strongly NP-completeness results: motivation, examples and implications. J\u00a0ACM 25:499\u2013508","journal-title":"J\u00a0ACM"},{"key":"9170_CR6","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco"},{"key":"9170_CR7","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"RL Graham","year":"1966","unstructured":"Graham RL (1966) Bounds for certain multiprocessing anomalies. Bell Syst Tech J 45:1563\u20131581","journal-title":"Bell Syst Tech J"},{"key":"9170_CR8","volume-title":"Approximation algorithms for NP-hard problems","author":"DS Hochbaum","year":"1997","unstructured":"Hochbaum DS (1997) Approximation algorithms for NP-hard problems. PWS, Boston"},{"key":"9170_CR9","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1145\/321941.321951","volume":"23","author":"E Horowitz","year":"1976","unstructured":"Horowitz E, Sahni S (1976) Exact and approximate algorithms for scheduling nonidentical processors. J\u00a0ACM 23:317\u2013327","journal-title":"J\u00a0ACM"},{"key":"9170_CR10","doi-asserted-by":"crossref","first-page":"2055","DOI":"10.1016\/S0305-0548(03)00164-3","volume":"31","author":"H Hwang","year":"2004","unstructured":"Hwang H, Chang S, Lee K (2004) Parallel machine scheduling under a grade of service provision. Comput Oper Res 31:2055\u20132061","journal-title":"Comput Oper Res"},{"key":"9170_CR11","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1007\/s10878-007-9095-z","volume":"16","author":"Y Jiang","year":"2008","unstructured":"Jiang Y (2008) Online scheduling on parallel machines with two GoS levels. J Comb Optim 16:28\u201338","journal-title":"J Comb Optim"},{"key":"9170_CR12","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/BF01585745","volume":"46","author":"JK Lenstra","year":"1990","unstructured":"Lenstra JK, Shmoys DB, Tardos E (1990) Approximation algorithms for scheduling unrelated parallel machines. Math Program 46:259\u2013271","journal-title":"Math Program"},{"key":"9170_CR13","first-page":"193","volume":"18","author":"E Mokotoff","year":"2001","unstructured":"Mokotoff E (2001) Parallel machine scheduling problems: a survey. Asia-Pac J Oper Res 18:193\u2013242","journal-title":"Asia-Pac J Oper Res"},{"key":"9170_CR14","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/321921.321934","volume":"23","author":"S Sahni","year":"1976","unstructured":"Sahni S (1976) Algorithms for scheduling independent tasks. J\u00a0ACM 23:116\u2013127","journal-title":"J\u00a0ACM"},{"key":"9170_CR15","unstructured":"Wang Z, Xing W (2002) Parallel machine scheduling with two kinds of jobs. In: Proceedings of the international conference on mathematical programming, Shanghai, China, pp 379\u2013385"},{"key":"9170_CR16","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S1007-0214(06)70162-6","volume":"11","author":"Z Wang","year":"2006","unstructured":"Wang Z, Xing W (2006) Parallel machine scheduling with special jobs. Tsinghua Sci Technol 11:107\u2013110","journal-title":"Tsinghua Sci Technol"},{"key":"9170_CR17","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/s10479-007-0264-3","volume":"159","author":"Z Wang","year":"2008","unstructured":"Wang Z, Xing W (2008) Performance of service policies in a specialized service system with parallel servers. Ann Oper Res 159:451\u2013460, 2008","journal-title":"Ann Oper Res"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-008-9170-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-008-9170-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-008-9170-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:13Z","timestamp":1559276293000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-008-9170-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,5,31]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,1]]}},"alternative-id":["9170"],"URL":"https:\/\/doi.org\/10.1007\/s10878-008-9170-0","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,5,31]]}}}