{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T15:07:07Z","timestamp":1767625627856},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,12,28]],"date-time":"2012-12-28T00:00:00Z","timestamp":1356652800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2013,8]]},"DOI":"10.1007\/s10479-012-1288-x","type":"journal-article","created":{"date-parts":[[2012,12,27]],"date-time":"2012-12-27T11:54:51Z","timestamp":1356609291000},"page":"121-136","source":"Crossref","is-referenced-by-count":6,"title":["Single machine total tardiness maximization problems: complexity and algorithms"],"prefix":"10.1007","volume":"207","author":[{"given":"Evgeny R.","family":"Gafarov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander A.","family":"Lazarev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Werner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,12,28]]},"reference":[{"issue":"5","key":"1288_CR1","doi-asserted-by":"crossref","first-page":"890","DOI":"10.1016\/j.cor.2009.03.021","volume":"37","author":"M. A. Aloulou","year":"2010","unstructured":"Aloulou, M. A., & Artigues, C. (2010). Flexible solutions in disjunctive scheduling: general formulation and study of the flow-shop case. Computers & Operations Research, 37(5), 890\u2013898.","journal-title":"Computers & Operations Research"},{"key":"1288_CR2","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1023\/B:ANOR.0000030679.25466.02","volume":"129","author":"M. A. Aloulou","year":"2004","unstructured":"Aloulou, M. A., Kovalyov, M. Y., & Portmann, M.-C. (2004). Maximization problems in single machine scheduling. Annals of Operations Research, 129, 21\u201332.","journal-title":"Annals of Operations Research"},{"key":"1288_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1051\/ro:20070012","volume":"41","author":"M. A. Aloulou","year":"2007","unstructured":"Aloulou, M. A., Kovalyov, M. Y., & Portmann, M.-C. (2007). Evaluation flexible solutions in single machine scheduling via objective function maximization: the study of computational complexity. RAIRO. Recherche Op\u00e9rationnelle, 41, 1\u201318.","journal-title":"RAIRO. Recherche Op\u00e9rationnelle"},{"key":"1288_CR4","volume-title":"Introduction to sequencing and scheduling","author":"K. R. Baker","year":"1974","unstructured":"Baker, K. R. (1974). Introduction to sequencing and scheduling. New York: Wiley."},{"issue":"10","key":"1288_CR5","doi-asserted-by":"crossref","first-page":"2070","DOI":"10.1134\/S0005117910100061","volume":"71","author":"E. R. Gafarov","year":"2010","unstructured":"Gafarov, E. R., Lazarev, A. A., & Werner, F. (2010a). Algorithms for maximizing the number of tardy jobs or total tardiness on a single machine. Automation and Remote Control, 71(10), 2070\u20132084.","journal-title":"Automation and Remote Control"},{"key":"1288_CR6","unstructured":"Gafarov, E. R., Lazarev, A. A., & Werner, F. (2010b). Classical combinatorial and single machine scheduling problems with opposite optimality criteria. Preprint 11\/10, FMA, Otto-von-Guericke-Universit\u00e4t Magdeburg."},{"key":"1288_CR7","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/s10479-011-1055-4","volume":"196(1)","author":"E. R. Gafarov","year":"2012","unstructured":"Gafarov, E. R., Lazarev, A. A., & Werner, F. (2012). Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one. Annals of Operations Research, 196(1), 247\u2013261.","journal-title":"Annals of Operations Research"},{"key":"1288_CR8","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R. L. Graham","year":"1979","unstructured":"Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1979). Optimization and approximation in deterministic machine scheduling: a survey. Annals of Discrete Mathematics, 5, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"key":"1288_CR9","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 pseudopolynomial algorithm for sequencing jobs to minimize total tardiness. Annals of Discrete Mathematics, 1, 331\u2013342.","journal-title":"Annals of Discrete Mathematics"},{"issue":"1","key":"1288_CR10","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1287\/mnsc.16.1.77","volume":"16","author":"E. L. Lawler","year":"1969","unstructured":"Lawler, E. L., & Moore, J. M. (1969). A functional equation and its application to resource allocation and sequencing problems. Management Science, 16(1), 77\u201384.","journal-title":"Management Science"},{"key":"1288_CR11","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"J. K. Lenstra","year":"1977","unstructured":"Lenstra, J. K., Rinnooy Kan, A. H. G., & Brucker, P. (1977). Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1, 343\u2013362.","journal-title":"Annals of Discrete Mathematics"},{"key":"1288_CR12","volume-title":"Handbook of scheduling: algorithms, models and performance analysis","author":"M. Akker van den","year":"2004","unstructured":"van den Akker, M., & Hoogeveen, H. (2004). Minimizing the number of tardy jobs. In Y.-T. Leung (Ed.), Handbook of scheduling: algorithms, models and performance analysis. London: Chapman & Hall."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-012-1288-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-012-1288-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-012-1288-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:09:40Z","timestamp":1559153380000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-012-1288-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12,28]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,8]]}},"alternative-id":["1288"],"URL":"https:\/\/doi.org\/10.1007\/s10479-012-1288-x","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,12,28]]}}}