{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T22:13:39Z","timestamp":1649024019377},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,9,18]],"date-time":"2015-09-18T00:00:00Z","timestamp":1442534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s10479-015-2023-1","type":"journal-article","created":{"date-parts":[[2015,9,18]],"date-time":"2015-09-18T14:32:38Z","timestamp":1442586758000},"page":"815-819","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Maximizing total tardiness on a single machine in $$O(n^2)$$ O ( n 2 ) time via a reduction to half-product minimization"],"prefix":"10.1007","volume":"235","author":[{"given":"Sergey","family":"Kovalev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,9,18]]},"reference":[{"issue":"1\u20134","key":"2023_CR1","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1023\/B:ANOR.0000030679.25466.02","volume":"129","author":"MA 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(1\u20134), 21\u201332.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"2023_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1051\/ro:20070012","volume":"41","author":"MA Aloulou","year":"2007","unstructured":"Aloulou, M. A., Kovalyov, M. Y., & Portmann, M.-C. (2007). Evaluating flexible solutions in single machine scheduling via objective function maximization: The study of computational complexity. RAIRO Operations Research, 41(1), 1\u201318.","journal-title":"RAIRO Operations Research"},{"issue":"3","key":"2023_CR3","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1287\/moor.23.3.649","volume":"23","author":"T Badics","year":"1998","unstructured":"Badics, T., & Boros, E. (1998). Minimization of half-products. Mathematics of Operations Research, 23(3), 649\u2013660.","journal-title":"Mathematics of Operations Research"},{"issue":"1","key":"2023_CR4","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/s10479-014-1555-0","volume":"217","author":"A Can","year":"2014","unstructured":"Can, A., & Ulusoy, G. (2014). Multi-project scheduling with two-stage decomposition. Annals of Operations Research, 217(1), 95\u2013116.","journal-title":"Annals of Operations Research"},{"issue":"15","key":"2023_CR5","doi-asserted-by":"crossref","first-page":"3046","DOI":"10.1016\/j.dam.2008.01.018","volume":"156","author":"E Erel","year":"2008","unstructured":"Erel, E., & Ghosh, J. B. (2008). FPTAS for half-products minimization with scheduling applications. Discrete Applied Mathematics, 156(15), 3046\u20133056.","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"2023_CR6","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/s10479-011-1055-4","volume":"196","author":"ER 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"},{"issue":"1","key":"2023_CR7","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/s10479-012-1288-x","volume":"207","author":"ER Gafarov","year":"2013","unstructured":"Gafarov, E. R., Lazarev, A. A., & Werner, F. (2013). Single machine total tardiness maximization problems: Complexity and algorithms. Annals of Operations Research, 207(1), 121\u2013136.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"2023_CR8","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/s10479-012-1222-2","volume":"213","author":"S Gawiejnowicz","year":"2014","unstructured":"Gawiejnowicz, S., & Kononov, A. (2014). Isomorphic scheduling problems. Annals of Operations Research, 213(1), 131\u2013145.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"2023_CR9","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/s10479-012-1059-8","volume":"213","author":"N Hashemian","year":"2014","unstructured":"Hashemian, N., Diallo, C., & Vizv\u00e1ri, B. (2014). Makespan minimization for parallel machines scheduling with multiple availability constraints. Annals of Operations Research, 213(1), 173\u2013186.","journal-title":"Annals of Operations Research"},{"issue":"2","key":"2023_CR10","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1016\/j.ejor.2004.04.012","volume":"165","author":"A Janiak","year":"2005","unstructured":"Janiak, A., Kovalyov, M. Y., Kubiak, W., & Werner, F. (2005). Positive half-products and scheduling with controllable processing times. European Journal of Operational Research, 165(2), 416\u2013422.","journal-title":"European Journal of Operational Research"},{"issue":"1\u20132","key":"2023_CR11","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/S0166-218X(96)00040-6","volume":"72","author":"B Jurisch","year":"1997","unstructured":"Jurisch, B., Kubiak, W., & Jozefowska, J. (1997). Algorithms for minclique scheduling problems. Discrete Applied Mathematics, 72(1\u20132), 115\u2013139.","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"2023_CR12","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/s10288-011-0180-x","volume":"10","author":"H Kellerer","year":"2012","unstructured":"Kellerer, H., & Strusevich, V. (2012). The symmetric quadratic knapsack problem: Approximation and scheduling applications. 4OR\u2014A Quarterly Journal of Operations Research, 10(2), 111\u2013161.","journal-title":"4OR\u2014A Quarterly Journal of Operations Research"},{"issue":"1","key":"2023_CR13","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/j.ejor.2012.12.028","volume":"228","author":"H Kellerer","year":"2013","unstructured":"Kellerer, H., & Strusevich, V. (2013). Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product. European Journal of Operational Research, 228(1), 24\u201332.","journal-title":"European Journal of Operational Research"},{"key":"2023_CR14","doi-asserted-by":"crossref","unstructured":"Keshavarz, T., Salmasi, N., & Varmazyar, M. (2014). Minimizing total completion time in the flexible flowshop sequence-dependent group scheduling problem. Annals of Operations Research, 226(1), 351\u2013377.","DOI":"10.1007\/s10479-014-1667-6"},{"issue":"3","key":"2023_CR15","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1504\/IJPS.2012.050127","volume":"1","author":"MY Kovalyov","year":"2012","unstructured":"Kovalyov, M. Y., & Kubiak, W. (2012). A generic FPTAS for partition type optimization problems. International Journal of Planning and Scheduling, 1(3), 209\u2013233.","journal-title":"International Journal of Planning and Scheduling"},{"issue":"2","key":"2023_CR16","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0166-218X(93)E0125-I","volume":"58","author":"W Kubiak","year":"1995","unstructured":"Kubiak, W. (1995). New results on the completion time variance minimization. Discrete Applied Mathematics, 58(2), 157\u2013168.","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"2023_CR17","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/j.dam.2004.07.007","volume":"146","author":"W Kubiak","year":"2005","unstructured":"Kubiak, W. (2005). Minimization of ordered, symmetric half-products. Discrete Applied Mathematics, 146(3), 287\u2013300.","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"2023_CR18","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1287\/mnsc.16.1.77","volume":"16","author":"EL 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":"2023_CR19","unstructured":"St. John, R., & T\u00f3th, S. F. (2014). Spatially explicit forest harvest scheduling with difference equations. Annals of Operations Research, 232(1), 235\u2013257."},{"issue":"2","key":"2023_CR20","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/j.ejor.2011.10.049","volume":"218","author":"Z Xu","year":"2012","unstructured":"Xu, Z. (2012). A strongly polynomial FPTAS for the symmetric quadratic knapsack problem. European Journal of Operational Research, 218(2), 377\u2013381.","journal-title":"European Journal of Operational Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-2023-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-015-2023-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-2023-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:10:04Z","timestamp":1559153404000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-015-2023-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,18]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["2023"],"URL":"https:\/\/doi.org\/10.1007\/s10479-015-2023-1","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,9,18]]}}}