{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T16:51:30Z","timestamp":1744217490417},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,5,15]],"date-time":"2013-05-15T00:00:00Z","timestamp":1368576000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1007\/s00224-013-9475-y","type":"journal-article","created":{"date-parts":[[2013,5,14]],"date-time":"2013-05-14T04:29:46Z","timestamp":1368505786000},"page":"82-95","source":"Crossref","is-referenced-by-count":1,"title":["Non-clairvoyant Weighted Flow Time Scheduling on Different Multi-processor Models"],"prefix":"10.1007","volume":"56","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","published-online":{"date-parts":[[2013,5,15]]},"reference":[{"issue":"1","key":"9475_CR1","doi-asserted-by":"crossref","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 67(1), 83\u201390 (2001)","journal-title":"Computing"},{"key":"9475_CR2","doi-asserted-by":"crossref","unstructured":"Bansal, N., Dhamdhere, K.: Minimizing weighted flow time. ACM Trans. Algorithms 3(4) (2007)","DOI":"10.1145\/1290672.1290676"},{"key":"9475_CR3","first-page":"207","volume-title":"Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"N. Bansal","year":"2005","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":"9475_CR4","doi-asserted-by":"crossref","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, Berlin (2009)"},{"key":"9475_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1583991.1583994","volume-title":"SPAA","author":"H.-L. Chan","year":"2009","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":"9475_CR6","first-page":"23","volume-title":"ESA (1)","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: ESA (1), pp. 23\u201335 (2010)"},{"issue":"4","key":"9475_CR7","doi-asserted-by":"crossref","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. 1(4), 355\u2013365 (1998)","journal-title":"J. Comb. Optim."},{"issue":"2","key":"9475_CR8","doi-asserted-by":"crossref","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. Eur. J. Oper. Res. 90(2), 227\u2013237 (1996)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9475_CR9","doi-asserted-by":"crossref","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. 235(1), 109\u2013141 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"9475_CR10","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1137\/1.9781611973068.75","volume-title":"Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"J. Edmonds","year":"2009","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)"},{"issue":"4","key":"9475_CR11","doi-asserted-by":"crossref","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 47(4), 617\u2013643 (2000)","journal-title":"J. ACM"},{"issue":"1","key":"9475_CR12","doi-asserted-by":"crossref","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. 130(1), 17\u201347 (1994)","journal-title":"Theor. Comput. Sci."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-013-9475-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-013-9475-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-013-9475-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T11:54:25Z","timestamp":1558698865000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-013-9475-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5,15]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["9475"],"URL":"https:\/\/doi.org\/10.1007\/s00224-013-9475-y","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,5,15]]}}}