{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T23:25:20Z","timestamp":1773617120771,"version":"3.50.1"},"reference-count":11,"publisher":"Pleiades Publishing Ltd","issue":"5","license":[{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Autom Remote Control"],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1134\/s0005117920050069","type":"journal-article","created":{"date-parts":[[2020,5,10]],"date-time":"2020-05-10T06:02:27Z","timestamp":1589090547000},"page":"853-868","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Minimizing Total Weighted Tardiness for Scheduling Equal-Length Jobs on a Single Machine"],"prefix":"10.1134","volume":"81","author":[{"given":"E. R.","family":"Gafarov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. A.","family":"Lazarev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"Werner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"137","published-online":{"date-parts":[[2020,5,10]]},"reference":[{"key":"1130_CR1","first-page":"561","volume-title":"J. Scheduling","author":"JM van den Akker","year":"2010","unstructured":"van den Akker, J.M., Diepen, G., and Hoogeveen, J.A., Minimizing Total Weighted Tardiness on a Single Machine with Release Dates and Equal-Length Jobs, J. Scheduling, 2010, no. 13, pp. 561\u2013576."},{"key":"1130_CR2","first-page":"1","volume-title":"RAIRO Oper. Res.","author":"MA Aloulou","year":"2007","unstructured":"Aloulou, M.A., Kovalyov, M.Y., and Portmann, M.-C., Evaluation Flexible Solutions in Single Machine Scheduling via Objective Function Maximization: the Study of Computational Complexity, RAIRO Oper. Res., 2007, no. 41, pp. 1\u201318."},{"key":"1130_CR3","first-page":"21","volume-title":"Discr. Appl. Math.","author":"P Baptiste","year":"2003","unstructured":"Baptiste, P., Scheduling Equal-Length Jobs on Identical Parallel Machines, Discr. Appl. Math., 2003, no. 103(1\u20133), pp. 21\u201332."},{"key":"1130_CR4","first-page":"247","volume-title":"Ann. Oper. Res.","author":"ER Gafarov","year":"2012","unstructured":"Gafarov, E.R., Lazarev, A.A., and Werner, F., Transforming a Pseudo-Polynomial Algorithm for the Single Machine Total Tardiness Maximization Problem into a Polynomial One, Ann. Oper. Res., 2012, no. 196(1), pp. 247\u2013261."},{"key":"1130_CR5","first-page":"121","volume-title":"Ann. Oper. Res.","author":"ER Gafarov","year":"2013","unstructured":"Gafarov, E.R., Lazarev, A.A., and Werner, F., Single Machine Total Tardiness Maximization Problems: Complexity and Algorithms, Ann. Oper. Res., 2013, no. 207, pp. 121\u2013136."},{"key":"1130_CR6","first-page":"287","volume-title":"Ann. Discr. Math.","author":"RL Graham","year":"1979","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K., and Rinnooy Kan, A.H.G., Optimization and Approximation in Deterministic Machine Scheduling: A Survey, Ann. Discr. Math., 1979, no. 5, pp. 287\u2013326."},{"key":"1130_CR7","first-page":"483","volume-title":"Math. Oper. Res.","author":"J Du","year":"1990","unstructured":"Du, J. and Leung, J.Y.-T., Minimizing Total Tardiness on One Processor is NP-hard, Math. Oper. Res., 1990, no. 15, pp. 483\u2013495."},{"key":"1130_CR8","first-page":"196","volume-title":"J. Soc. Ind. Appl. Math.","author":"M Held","year":"1962","unstructured":"Held, M. and Karp, R.M., A Dynamic Programming Approach to Sequencing Problems, J. Soc. Ind. Appl. Math., 1962, no. 10, pp. 196\u2013210."},{"key":"1130_CR9","first-page":"435","volume-title":"J. Scheduling","author":"SA Kravchenko","year":"2011","unstructured":"Kravchenko, S.A. and Werner, F., Parallel Machine Problems with Equal Processing Times: A Survey, J. Scheduling, 2011, no. 14, pp. 435\u2013444."},{"key":"1130_CR10","doi-asserted-by":"crossref","DOI":"10.1201\/9780203489802","volume-title":"Handbook of Scheduling","author":"JY-T Leung","year":"2004","unstructured":"Leung, J.Y.-T., Handbook of Scheduling, New York: Chapmann and Hall\/CRC, 2004."},{"key":"1130_CR11","first-page":"930","volume-title":"Math. Oper. Res.","author":"S Verma","year":"1998","unstructured":"Verma, S. and Dessouky, M., Single-Machine Scheduling of Unit-Time Jobs with Earliness and Tardiness Penalties, Math. Oper. Res., 1998, no. 23(4), pp. 930\u2013943."}],"container-title":["Automation and Remote Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0005117920050069.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0005117920050069","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0005117920050069.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T22:34:42Z","timestamp":1773614082000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0005117920050069"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5]]},"references-count":11,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2020,5]]}},"alternative-id":["1130"],"URL":"https:\/\/doi.org\/10.1134\/s0005117920050069","relation":{},"ISSN":["0005-1179","1608-3032"],"issn-type":[{"value":"0005-1179","type":"print"},{"value":"1608-3032","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5]]},"assertion":[{"value":"7 July 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 November 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 November 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 May 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}