{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T13:57:36Z","timestamp":1766066256538},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,9,19]],"date-time":"2012-09-19T00:00:00Z","timestamp":1348012800000},"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":[[2014,5]]},"DOI":"10.1007\/s10878-012-9545-0","type":"journal-article","created":{"date-parts":[[2012,9,18]],"date-time":"2012-09-18T16:46:44Z","timestamp":1347986804000},"page":"711-723","source":"Crossref","is-referenced-by-count":10,"title":["Algorithms with limited number of preemptions for scheduling on parallel machines"],"prefix":"10.1007","volume":"27","author":[{"given":"Yiwei","family":"Jiang","sequence":"first","affiliation":[]},{"given":"Zewei","family":"Weng","sequence":"additional","affiliation":[]},{"given":"Jueliang","family":"Hu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,9,19]]},"reference":[{"issue":"3","key":"9545_CR1","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1137\/S0097539702410697","volume":"32","author":"O Braun","year":"2003","unstructured":"Braun O, Schmidt G (2003) Parallel processor scheduling with limited number of preemptions. SIAM J Comput 32(3):671\u2013680","journal-title":"SIAM J Comput"},{"key":"9545_CR2","doi-asserted-by":"crossref","first-page":"991","DOI":"10.1145\/174147.174148","volume":"20","author":"EG Coffman Jr","year":"1993","unstructured":"Coffman Jr EG, Garey MR (1993) Proof of the 4\/3 conjecture for preemptive vs. nonpreemptive two-processor scheduling. J Assoc Comput Mach 20:991\u20131018","journal-title":"J Assoc Comput Mach"},{"issue":"2","key":"9545_CR3","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1287\/moor.1110.0520","volume":"37","author":"JR Correa","year":"2012","unstructured":"Correa JR, Skutella M, Verschae J (2012) The power of preemption in unrelated machines and applications to scheduling orders. Math Oper Res 37(2):379\u2013398","journal-title":"Math Oper Res"},{"issue":"5","key":"9545_CR4","first-page":"517","volume":"12","author":"T Ebenlendr","year":"2009","unstructured":"Ebenlendr T, Sgall J (2009) Optimal and online preemptive scheduling on uniformly related machines. J\u00a0Sched 12(5):517\u2013527","journal-title":"J\u00a0Sched"},{"key":"9545_CR5","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1145\/322047.322055","volume":"25","author":"T Gonzalez","year":"1978","unstructured":"Gonzalez T, Sahni S (1978) Preemptive scheduling of uniform processor systems. J Assoc Comput Mach 25:92\u2013101","journal-title":"J Assoc Comput Mach"},{"key":"9545_CR6","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"RL Graham","year":"1969","unstructured":"Graham RL (1969) Bounds on multiprocessing timing anomalies. SIAM J Appl Math 17:416\u2013429","journal-title":"SIAM J Appl Math"},{"key":"9545_CR7","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1145\/321992.321995","volume":"24","author":"EC Horvath","year":"1977","unstructured":"Horvath EC, Lam S, Sethi R (1977) A level algorithm for preemptive scheduling. J Assoc Comput Mach 24:32\u201343","journal-title":"J Assoc Comput Mach"},{"key":"9545_CR8","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1137\/0405041","volume":"5","author":"KS Hong","year":"1992","unstructured":"Hong KS, Leung JYT (1992) Some results on Liu\u2019s conjecture. SIAM J Discrete Math 5:500\u2013523","journal-title":"SIAM J Discrete Math"},{"key":"9545_CR9","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/s00236-009-0096-5","volume":"46","author":"K Klonowska","year":"2009","unstructured":"Klonowska K, Lundberg L, Lennerstad H (2009) The maximum gain of increasing the number of preemptions in multiprocessor scheduling. Acta Inform 46:285\u2013295","journal-title":"Acta Inform"},{"key":"9545_CR10","first-page":"155","volume-title":"Proceedings of the 13th annual symposium on switching and automata theory","author":"CL Liu","year":"1972","unstructured":"Liu CL (1972) Optimal scheduling on multi-processor computing systems. In: Proceedings of the 13th annual symposium on switching and automata theory. IEEE Computer Society, Los Alamitos, pp\u00a0155\u2013160"},{"key":"9545_CR11","first-page":"38","volume-title":"Proceedings of ACM annual conference","author":"JWS Liu","year":"1974","unstructured":"Liu JWS, Yang A (1974) Optimal scheduling of independent tasks on heterogeneous computing systems. In: Proceedings of ACM annual conference, San Diego, California, pp\u00a038\u201345."},{"key":"9545_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.6.1.1","volume":"6","author":"R McNaughton","year":"1959","unstructured":"McNaughton R (1959) Scheduling with deadlines and loss functions. Manag Sci 6:1\u201312","journal-title":"Manag Sci"},{"issue":"3\u20134","key":"9545_CR13","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/s00453-005-1171-0","volume":"42","author":"H Shachnai","year":"2005","unstructured":"Shachnai H, Tamir T, Woeginger GJ (2005) Minimizing makespan and preemption costs on a system of uniform machines. Algorithmica 42(3\u20134):309\u2013334","journal-title":"Algorithmica"},{"issue":"3","key":"9545_CR14","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0167-6377(99)00076-0","volume":"26","author":"GJ Woeginger","year":"2000","unstructured":"Woeginger GJ (2000) A comment on scheduling on uniform machines under chain-type precedence constraints. Oper Res Lett 26(3):107\u2013109","journal-title":"Oper Res Lett"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9545-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-012-9545-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9545-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:23:19Z","timestamp":1559262199000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-012-9545-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,19]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,5]]}},"alternative-id":["9545"],"URL":"https:\/\/doi.org\/10.1007\/s10878-012-9545-0","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,9,19]]}}}