{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T02:51:21Z","timestamp":1725677481915},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642296994"},{"type":"electronic","value":"9783642297007"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29700-7_9","type":"book-chapter","created":{"date-parts":[[2012,4,28]],"date-time":"2012-04-28T12:25:56Z","timestamp":1335615956000},"page":"93-104","source":"Crossref","is-referenced-by-count":0,"title":["Algorithms with Limited Number of Preemptions for Scheduling on Parallel Machines"],"prefix":"10.1007","author":[{"given":"Yiwei","family":"Jiang","sequence":"first","affiliation":[]},{"given":"Zewei","family":"Weng","sequence":"additional","affiliation":[]},{"given":"Jueliang","family":"Hu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"9_CR1","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1137\/S0097539702410697","volume":"32","author":"O. Braun","year":"2003","unstructured":"Braun, O., Schmidt, G.: Parallel processor scheduling with limited number of preemptions. SIAM Journal on Computing\u00a032(3), 671\u2013680 (2003)","journal-title":"SIAM Journal on Computing"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"991","DOI":"10.1145\/174147.174148","volume":"20","author":"E.G. Coffman Jr.","year":"1993","unstructured":"Coffman Jr., E.G., Garey, M.R.: Proof of the 4\/3 conjecture for preemptive vs. nonpreemptive two-processor scheduling. Journal of the Association for Computing Machinery\u00a020, 991\u20131018 (1993)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1145\/322047.322055","volume":"25","author":"T. Gonzalez","year":"1978","unstructured":"Gonzalez, T., Sahni, S.: Preemptive scheduling of uniform processor systems. Journal of the Association for Computing Machinery\u00a025, 92\u2013101 (1978)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"R.L. Graham","year":"1969","unstructured":"Graham, R.L.: Bounds on multiprocessing timing anomalies. SIAM Journal on Applied Mathematics\u00a017, 416\u2013429 (1969)","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1145\/321992.321995","volume":"24","author":"E.C. Horvath","year":"1977","unstructured":"Horvath, E.C., Lam, S., Sethi, R.: A level algorithm for preemptive scheduling. Journal of the Association for Computing Machinery\u00a024, 32\u201343 (1977)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1137\/0405041","volume":"5","author":"K.S. Hong","year":"1992","unstructured":"Hong, K.S., Leung, J.Y.-T.: Some results on Lius conjecture. SIAM Journal on Discrete Mathematics\u00a05, 500\u2013523 (1992)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1109\/SWAT.1972.16","volume-title":"Proceedings of the 13th Annual Symposium on Switching and Automata Theory","author":"C.L. Liu","year":"1972","unstructured":"Liu, C.L.: Optimal scheduling on multi-processor computing systems. In: Proceedings of the 13th Annual Symposium on Switching and Automata Theory, pp. 155\u2013160. IEEE Computer Society, Los Alamitos (1972)"},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/mnsc.6.1.1","volume":"6","author":"R. McNaughton","year":"1959","unstructured":"McNaughton, R.: Scheduling with deadlines and loss functions. Management Science\u00a06, 1\u201312 (1959)","journal-title":"Management Science"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s00236-009-0096-5","volume":"46","author":"K. Klonowska","year":"2009","unstructured":"Klonowska, K., Lundberg, L., Lennerstad, H.: The maximum gain of increasing the number of preemptions in multiprocessor scheduling. Acta Informatica\u00a046, 285\u2013295 (2009)","journal-title":"Acta Informatica"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Liu, J.W.S., Yang, A.: Optimal scheduing of independent tasks on heterogeneous computing systems. In: Proceedings of ACM Annual Conference, San Diego, Cahf, pp. 38\u201345 (1974)","DOI":"10.1145\/800182.810377"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29700-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T00:34:47Z","timestamp":1558312487000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29700-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642296994","9783642297007"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29700-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}