{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T21:02:29Z","timestamp":1648933349270},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2009,5,12]],"date-time":"2009-05-12T00:00:00Z","timestamp":1242086400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2009,7]]},"DOI":"10.1007\/s00236-009-0096-5","type":"journal-article","created":{"date-parts":[[2009,5,11]],"date-time":"2009-05-11T05:06:54Z","timestamp":1242018414000},"page":"285-295","source":"Crossref","is-referenced-by-count":6,"title":["The maximum gain of increasing the number of preemptions in multiprocessor scheduling"],"prefix":"10.1007","volume":"46","author":[{"given":"Kamilla","family":"Klonowska","sequence":"first","affiliation":[]},{"given":"Lars","family":"Lundberg","sequence":"additional","affiliation":[]},{"given":"H\u00e5kan","family":"Lennerstad","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,5,12]]},"reference":[{"issue":"3","key":"96_CR1","doi-asserted-by":"crossref","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 J. Comput. 32(3), 671\u2013680 (2003)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"96_CR2","doi-asserted-by":"crossref","first-page":"991","DOI":"10.1145\/174147.174148","volume":"40","author":"E.G. Coffman","year":"1993","unstructured":"Coffman E.G., Garey M.R.: Proof of the 4\/3 conjecture for preemptive vs. nonpreemptive two-processor scheduling. J. ACM 40(5), 991\u20131018 (1993) ISSN:0004-5411","journal-title":"J. ACM"},{"issue":"2","key":"96_CR3","doi-asserted-by":"crossref","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 J. Appl. Math. 17(2), 416\u2013429 (1969)","journal-title":"SIAM J. Appl. Math."},{"key":"96_CR4","unstructured":"Graham, R.L., Knuth, D., Patashnik, O.: Concrete Mathematics. Addison-Wesley, Reading (1994). ISBN 0-201-14236-8"},{"key":"96_CR5","doi-asserted-by":"crossref","unstructured":"Lennerstad, H., Lundberg, L.: Optimal Scheduling Combinatorics. Electronic Notes in Discrete Mathematics, vol. 14. Elsevier, Amsterdam (2003)","DOI":"10.1016\/S1571-0653(04)80599-7"},{"key":"96_CR6","unstructured":"Lennerstad, H., Lundberg, L.: Generalizations of the floor an ceiling functions by the Stern\u2013Brocot tree, Technical report, Blekinge Institute of Technology (2006)"},{"key":"96_CR7","doi-asserted-by":"crossref","unstructured":"Liu, C.L.: Optimal scheduling on multiprocessor computing systems. In: Proceedings of the 13th Annual Symposium on Switching and Automata Theory, pp. 155\u2013160. IEEE Computer Society, Los Alamitos (1972)","DOI":"10.1109\/SWAT.1972.16"},{"key":"96_CR8","doi-asserted-by":"crossref","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. Manag. Sci. 6, 1\u201312 (1959)","journal-title":"Manag. Sci."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-009-0096-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-009-0096-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-009-0096-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T13:41:55Z","timestamp":1558705315000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-009-0096-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5,12]]},"references-count":8,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,7]]}},"alternative-id":["96"],"URL":"https:\/\/doi.org\/10.1007\/s00236-009-0096-5","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,5,12]]}}}