{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,14]],"date-time":"2025-04-14T10:43:16Z","timestamp":1744627396902},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,9,16]],"date-time":"2010-09-16T00:00:00Z","timestamp":1284595200000},"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":[[2012,4]]},"DOI":"10.1007\/s10951-010-0198-5","type":"journal-article","created":{"date-parts":[[2010,9,14]],"date-time":"2010-09-14T21:13:16Z","timestamp":1284498796000},"page":"193-200","source":"Crossref","is-referenced-by-count":6,"title":["Minimizing total tardiness on parallel machines with preemptions"],"prefix":"10.1007","volume":"15","author":[{"given":"Svetlana A.","family":"Kravchenko","sequence":"first","affiliation":[]},{"given":"Frank","family":"Werner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,9,16]]},"reference":[{"key":"198_CR1","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/s10951-006-0006-4","volume":"10","author":"Ph. Baptiste","year":"2007","unstructured":"Baptiste, Ph., Brucker, P., Chrobak, M., D\u00fcrr, C., Kravchenko, S. A., & Sourd, F. (2007). The complexity of mean flow time scheduling problems with release times. Journal of Scheduling, 10, 139\u2013146.","journal-title":"Journal of Scheduling"},{"key":"198_CR2","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1287\/moor.15.3.483","volume":"15","author":"J. Du","year":"1990","unstructured":"Du, J., & Leung, J. Y.-T. (1990). Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research, 15, 483\u2013495.","journal-title":"Mathematics of Operations Research"},{"key":"198_CR3","unstructured":"Kravchenko, S. A., & Werner, F. (2009a). Minimizing a separable convex function on parallel machines with preemptions. Fakult\u00e4t f\u00fcr Mathematik, Otto-von-Guericke Universit\u00e4t Magdeburg. Preprint 22\/09, 20\u00a0p."},{"key":"198_CR4","doi-asserted-by":"crossref","first-page":"848","DOI":"10.1016\/j.dam.2008.09.003","volume":"157","author":"S. A. Kravchenko","year":"2009","unstructured":"Kravchenko, S. A., & Werner, F. (2009b). On a parallel machine scheduling problem with equal processing times. Discrete Applied Mathematics, 157, 848\u2013852.","journal-title":"Discrete Applied Mathematics"},{"key":"198_CR5","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/B978-0-12-566780-7.50020-9","volume-title":"Progress in combinatorial optimization","author":"J. Labetoulle","year":"1984","unstructured":"Labetoulle, J., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A.H.G. (1984). Preemptive scheduling of uniform machines subject to release dates. In H. R. Pulleyblank (Ed.), Progress in combinatorial optimization (pp. 245\u2013261). New York: Academic Press."},{"key":"198_CR6","volume-title":"Combinatorial optimization: networks and matroids","author":"E. L. Lawler","year":"1976","unstructured":"Lawler, E. L. (1976). Combinatorial optimization: networks and matroids. New York: Holt, Rinehart and Winston."},{"key":"198_CR7","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/S0167-5060(08)70742-8","volume":"1","author":"E. L. Lawler","year":"1977","unstructured":"Lawler, E. L. (1977). A \u2018pseudopolynomial\u2019 algorithm for sequencing jobs to minimize total tardiness. Annuals of Discrete Mathematics, 1, 331\u2013342.","journal-title":"Annuals of Discrete Mathematics"},{"key":"198_CR8","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1007\/978-3-642-68874-4_9","volume-title":"Mathematical programming: the state of the art","author":"E. L. Lawler","year":"1983","unstructured":"Lawler, E. L. (1983). Recent results in the theory of machine scheduling. In A. Bachem, M. Gr\u00f6tschel, & B. Korte (Eds.), Mathematical programming: the state of the art (pp. 202\u2013234). Berlin: Springer."},{"key":"198_CR9","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/s10951-006-7039-6","volume":"9","author":"Z. Tian","year":"2006","unstructured":"Tian, Z., Ng, C. T., & Cheng, T. C. E. (2006). An O(n 2) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness. Journal of Scheduling, 9, 343\u2013364.","journal-title":"Journal of Scheduling"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-010-0198-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-010-0198-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-010-0198-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T05:39:45Z","timestamp":1559453985000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-010-0198-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9,16]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,4]]}},"alternative-id":["198"],"URL":"https:\/\/doi.org\/10.1007\/s10951-010-0198-5","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,9,16]]}}}