{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T01:02:17Z","timestamp":1725670937808},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642291159"},{"type":"electronic","value":"9783642291166"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29116-6_12","type":"book-chapter","created":{"date-parts":[[2012,3,26]],"date-time":"2012-03-26T05:59:55Z","timestamp":1332741595000},"page":"137-149","source":"Crossref","is-referenced-by-count":1,"title":["Non-clairvoyant Weighted Flow Time Scheduling on Different Multi-processor Models"],"prefix":"10.1007","author":[{"given":"Jianqiao","family":"Zhu","sequence":"first","affiliation":[]},{"given":"Ho-Leung","family":"Chan","sequence":"additional","affiliation":[]},{"given":"Tak-Wah","family":"Lam","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"12_CR1","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s006070170017","volume":"67","author":"E.J. Anderson","year":"2001","unstructured":"Anderson, E.J., Jayram, T.S., Kimbrel, T.: Tighter bounds on preemptive job shop scheduling with two machines. Computing\u00a067(1), 83\u201390 (2001)","journal-title":"Computing"},{"doi-asserted-by":"crossref","unstructured":"Bansal, N., Dhamdhere, K.: Minimizing weighted flow time. ACM Transactions on Algorithms\u00a03(4) (2007)","key":"12_CR2","DOI":"10.1145\/1290672.1290676"},{"unstructured":"Bansal, N., Kimbrel, T., Sviridenko, M.: Job shop scheduling with unit processing times. In: Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 207\u2013214 (2005)","key":"12_CR3"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"1782","DOI":"10.1007\/978-0-387-74759-0_313","volume-title":"Encyclopedia of Optimization","author":"P. Brucker","year":"2009","unstructured":"Brucker, P.: Job-shop scheduling problem. In: Floudas, C.A., Pardalos, P.M. (eds.) Encyclopedia of Optimization, pp. 1782\u20131788. Springer, Heidelberg (2009)"},{"doi-asserted-by":"crossref","unstructured":"Chan, H.-L., Edmonds, J., Pruhs, K.: Speed scaling of processes with arbitrary speedup curves on a multiprocessor. In: SPAA, pp. 1\u201310 (2009)","key":"12_CR5","DOI":"10.1145\/1583991.1583994"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-642-15775-2_3","volume-title":"Algorithms \u2013 ESA 2010","author":"S.-H. Chan","year":"2010","unstructured":"Chan, S.-H., Lam, T.-W., Lee, L.-K.: Non-Clairvoyant Speed Scaling for Weighted Flow Time. In: de Berg, M., Meyer, U. (eds.) ESA 2010, Part I. LNCS, vol.\u00a06346, pp. 23\u201335. Springer, Heidelberg (2010)"},{"issue":"4","key":"12_CR7","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1023\/A:1009786526733","volume":"1","author":"B. Chen","year":"1998","unstructured":"Chen, B., Vestjens, A.P.A., Woeginger, G.J.: On-line scheduling of two-machine open shops where jobs arrive over time. J. Comb. Optim.\u00a01(4), 355\u2013365 (1998)","journal-title":"J. Comb. Optim."},{"issue":"2","key":"12_CR8","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0377-2217(95)00351-7","volume":"90","author":"F. Della Croce","year":"1996","unstructured":"Della Croce, F., Narayan, V., Tadei, R.: The two-machine total completion time flow shop problem. European Journal of Operational Research\u00a090(2), 227\u2013237 (1996)","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"12_CR9","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0304-3975(99)00186-3","volume":"235","author":"J. Edmonds","year":"2000","unstructured":"Edmonds, J.: Scheduling in the dark. Theor. Comput. Sci.\u00a0235(1), 109\u2013141 (2000)","journal-title":"Theor. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Edmonds, J., Pruhs, K.: Scalably scheduling processes with arbitrary speedup curves. In: Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 685\u2013692 (2009)","key":"12_CR10","DOI":"10.1137\/1.9781611973068.75"},{"issue":"4","key":"12_CR11","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1145\/347476.347479","volume":"47","author":"B. Kalyanasundaram","year":"2000","unstructured":"Kalyanasundaram, B., Pruhs, K.: Speed is as powerful as clairvoyance. J. ACM\u00a047(4), 617\u2013643 (2000)","journal-title":"J. ACM"},{"issue":"1","key":"12_CR12","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0304-3975(94)90151-1","volume":"130","author":"R. Motwani","year":"1994","unstructured":"Motwani, R., Phillips, S., Torng, E.: Non-clairvoyant scheduling. Theor. Comput. Sci.\u00a0130(1), 17\u201347 (1994)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29116-6_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:24:33Z","timestamp":1620113073000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29116-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642291159","9783642291166"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29116-6_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}