{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T17:11:28Z","timestamp":1676826688017},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,7,12]],"date-time":"2008-07-12T00:00:00Z","timestamp":1215820800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2009,2]]},"DOI":"10.1007\/s10951-008-0075-7","type":"journal-article","created":{"date-parts":[[2008,7,11]],"date-time":"2008-07-11T17:13:56Z","timestamp":1215796436000},"page":"31-43","source":"Crossref","is-referenced-by-count":5,"title":["On-line service scheduling"],"prefix":"10.1007","volume":"12","author":[{"given":"Zhenbo","family":"Wang","sequence":"first","affiliation":[]},{"given":"Wenxun","family":"Xing","sequence":"additional","affiliation":[]},{"given":"Bo","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,7,12]]},"reference":[{"key":"75_CR1","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1016\/j.orl.2004.10.006","volume":"33","author":"C. Ambhl","year":"2005","unstructured":"Ambhl, C., & Mastrolilli, M. (2005). On-line scheduling to minimize max flowtime: an optimal preemptive algorithm. Operations Research Letters, 33, 597\u2013602.","journal-title":"Operations Research Letters"},{"key":"75_CR2","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. Journal of the Association for Computing Machinery, 44, 486\u2013504.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"75_CR3","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1006\/jagm.1995.1008","volume":"18","author":"Y. Azar","year":"1995","unstructured":"Azar, Y., Naor, J., & Rom, R. (1995). The competitiveness of on-line assingments. Journal of Algorithms, 18, 221\u2013237.","journal-title":"Journal of Algorithms"},{"key":"75_CR4","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1214\/aoap\/1015345343","volume":"11","author":"S. L. Bell","year":"2001","unstructured":"Bell, S. L., & Williams, R. J. (2001). Dynamic Scheduling of a system with two parallel servers in heavy traffic with resource pooling: asymptotic optimality of a threshold policy. Annals of Applied Probability, 11, 608\u2013649.","journal-title":"Annals of Applied Probability"},{"key":"75_CR5","first-page":"21","volume-title":"Handbook of combinatorial optimization","author":"B. Chen","year":"1998","unstructured":"Chen, B., Potts, C. N., & Woeiginger, G. J. (1998). A review of machine scheduling: Complexity, algorithm and approximability. In D.-Z. Du & P. Pardalos (Eds.), Handbook of combinatorial optimization (Vol.\u00a03, pp. 21\u2013169). Dordrecht: Kluwer Academic."},{"key":"75_CR6","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1145\/322276.322284","volume":"28","author":"E. Davis","year":"1981","unstructured":"Davis, E., & Jaffe, J. M. (1981). Algorithm for scheduling tasks on unrelated processors. Journal of the Association for Computing Machinery, 28, 721\u2013736.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"75_CR7","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"R. L. Graham","year":"1966","unstructured":"Graham, R. L. (1966). Bounds for certain multiprocessing anomalies. Bell System Technical Journal, 45, 1563\u20131581.","journal-title":"Bell System Technical Journal"},{"key":"75_CR8","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1109\/SFCS.1989.63468","volume-title":"Proceedings of the 30th IEEE symposium on foundations of computer science","author":"L. A. Hall","year":"1989","unstructured":"Hall, L. A., & Shmoys, D. B. (1989). Approximation schemes for constrained scheduling problems. In Proceedings of the 30th IEEE symposium on foundations of computer science (pp. 134\u2013139). Los Alamitos: IEEE Computer Society Press."},{"key":"75_CR9","doi-asserted-by":"crossref","first-page":"822","DOI":"10.1214\/aoap\/1028903452","volume":"8","author":"J. M. Harrison","year":"1998","unstructured":"Harrison, J. M. (1998). Heavy traffic analysis of a system with parallel servers: asymptotic optimality of discrete-review policies. Annals of Applied Probability, 8, 822\u2013848.","journal-title":"Annals of Applied Probability"},{"key":"75_CR10","first-page":"15.1","volume-title":"Handbook of scheduling: algorithms, models, and performance analysis","author":"K. Pruhs","year":"2004","unstructured":"Pruhs, K., Sgall, J., & Torng, E. (2004). Online scheduling. In J.Y.-T.\u00a0Leung (Ed.), Handbook of scheduling: algorithms, models, and performance analysis (pp. 15.1\u201315.43). Boca Raton: CRC Press."},{"key":"75_CR11","doi-asserted-by":"crossref","first-page":"1313","DOI":"10.1137\/S0097539793248317","volume":"24","author":"D. B. Shmoys","year":"1995","unstructured":"Shmoys, D. B., Wein, J., & Williamson, D. P. (1995). Scheduling parallel machines on-line. SIAM Journal on Computing, 24, 1313\u20131331.","journal-title":"SIAM Journal on Computing"},{"key":"75_CR12","unstructured":"Wang, Z. (2006). Research on on-line service scheduling. PhD dissertation, Department of Mathematical Sciences, Tsinghua University, Beijing, China (in Chinese)."},{"key":"75_CR13","doi-asserted-by":"crossref","unstructured":"Wang, Z., & Xing, W. (2008, in press). Worst-case analysis for on-line service policies. Journal of Combinatorial Optimization.","DOI":"10.1007\/s10878-008-9170-0"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-008-0075-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-008-0075-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-008-0075-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:41Z","timestamp":1559468381000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-008-0075-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7,12]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,2]]}},"alternative-id":["75"],"URL":"https:\/\/doi.org\/10.1007\/s10951-008-0075-7","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,7,12]]}}}