{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,14]],"date-time":"2025-04-14T10:43:20Z","timestamp":1744627400213},"reference-count":4,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,1,26]],"date-time":"2013-01-26T00:00:00Z","timestamp":1359158400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2013,8]]},"DOI":"10.1007\/s10951-013-0313-5","type":"journal-article","created":{"date-parts":[[2013,1,25]],"date-time":"2013-01-25T04:57:12Z","timestamp":1359089832000},"page":"439-441","source":"Crossref","is-referenced-by-count":3,"title":["Erratum to: Minimizing total tardiness on parallel machines with preemptions"],"prefix":"10.1007","volume":"16","author":[{"given":"Svetlana A.","family":"Kravchenko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Werner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,1,26]]},"reference":[{"key":"313_CR1","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1002\/nav.3800210113","volume":"21","author":"WA Horn","year":"1974","unstructured":"Horn, W. A. (1974). Some simple scheduling algorithms. Naval Research Logistics Quarterly, 21, 177\u2013185.","journal-title":"Naval Research Logistics Quarterly"},{"key":"313_CR2","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of computer computations","author":"RM Karp","year":"1972","unstructured":"Karp, R. M. (1972). Reducibility among combinatorial problems. In R. E. Miller & J. W. Thatcher (Eds.), Complexity of computer computations (pp. 85\u2013103). New York: Plenum Press."},{"key":"313_CR3","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/s10951-010-0198-5","volume":"15","author":"SA Kravchenko","year":"2012","unstructured":"Kravchenko, S. A., & Werner, F. (2012). Minimizing total tardiness on parallel machines with preemptions. Journal of Scheduling, 15, 193\u2013200.","journal-title":"Journal of Scheduling"},{"key":"313_CR4","doi-asserted-by":"crossref","unstructured":"Prot, D., Bellenguez-Morineau, O., & Lahlou, C. (2012). A note on the paper \u201cMinimizing total tardiness on parallel machines with preemptions\u201d by Kravchenko and Werner (2012). Journal of Scheduling doi: 10.1007\/s10951-012-0283-z .","DOI":"10.1007\/s10951-012-0283-z"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-013-0313-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-013-0313-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-013-0313-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:48Z","timestamp":1559468388000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-013-0313-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,26]]},"references-count":4,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,8]]}},"alternative-id":["313"],"URL":"https:\/\/doi.org\/10.1007\/s10951-013-0313-5","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,1,26]]}}}