{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T21:15:50Z","timestamp":1770498950843,"version":"3.49.0"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Heuristics"],"published-print":{"date-parts":[[2002,7]]},"DOI":"10.1023\/a:1015487829051","type":"journal-article","created":{"date-parts":[[2002,12,28]],"date-time":"2002-12-28T23:44:51Z","timestamp":1041119091000},"page":"415-428","source":"Crossref","is-referenced-by-count":21,"title":["Approximation Schemes for Scheduling Jobs with Common Due Date on Parallel Machines to Minimize Total Tardiness"],"prefix":"10.1007","volume":"8","author":[{"given":"Mikhail Y.","family":"Kovalyov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Werner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"407837_CR1","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R. and D.J. Johnson. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: Freeman."},{"key":"407837_CR2","first-page":"41","volume-title":"Algorithms and Complexity. New Directions and Recent Results.\u2013Proc. Symp.","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R. and D.S. Johnson. (1976). \u201cApproximation Algorithms for Combinatorial Problems: An Annotated Bibliography.\u201d In Algorithms and Complexity. New Directions and Recent Results.\u2013Proc. Symp. Cornegie-Mellon University, New York, pp. 41\u201352."},{"key":"407837_CR3","volume-title":"\u201cEfficient Approximate Algorithms for Combinatorial Problems","author":"G.V. Gens","year":"1981","unstructured":"Gens, G.V. and E.V. Levner. (1981). \u201cEfficient Approximate Algorithms for Combinatorial Problems.\u201d Preprint, Central Economical and Mathematical Institute of the USSR Academy of Sciences, Moscow (in Russian)."},{"key":"407837_CR4","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., E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan. (1979). \u201cOptimization and Approximation in Deterministic Sequencing and Scheduling: A Survey.\u201d Annals of Discrete Mathematics 5, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"key":"407837_CR5","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1145\/321941.321951","volume":"23","author":"E. Horowitz","year":"1976","unstructured":"Horowitz, E. and S. Sahni. (1976). \u201cExact and Approximate Algorithms for Scheduling Nonidentical Processors.\u201d Journal of the ACM 23, 317\u2013327.","journal-title":"Journal of the ACM"},{"key":"407837_CR6","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/321906.321909","volume":"22","author":"O. Ibarra","year":"1975","unstructured":"Ibarra, O. and C.E. Kim. (1975). \u201cFast Approximation Algorithms for the Knapsack and Sum of Subset Problems.\u201d Journal of the ACM 22, 463\u2013468.","journal-title":"Journal of the ACM"},{"key":"407837_CR7","doi-asserted-by":"crossref","unstructured":"Korte, B. and R. Schrader. (1981). \u201cOn the Existence of Fast Approximation Schemes.\u201d In Nonlinear Programming, Vol. 4. Proc. 4th Symp., Madison, Wisc., July 14\u201316, 1980. New York, pp. 415\u2013437.","DOI":"10.1016\/B978-0-12-468662-5.50020-3"},{"key":"407837_CR8","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1023\/A:1009626427432","volume":"3","author":"M.Y. Kovalyov","year":"1998","unstructured":"Kovalyov, M.Y. and W. Kubiak. (1998). \u201cA Fully Polynomial Approximation Scheme for Minimizing Makespan of Deteriorating Jobs.\u201d Journal of Heuristics 3, 287\u2013297.","journal-title":"Journal of Heuristics"},{"key":"407837_CR9","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/0041-5553(86)90072-8","volume":"26","author":"M.Y. Kovalyov","year":"1986","unstructured":"Kovalyov, M.Y. and Y.M. Shafransky. (1986). \u201cThe Construction of \u03b5-Approximate Algorithms in Successively Constructed Sets.\u201d U.S.S.R. Comput. Maths. Math. Phys. 26, 30\u201338.","journal-title":"U.S.S.R. Comput. Maths. Math. Phys"},{"key":"407837_CR10","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1287\/mnsc.11.3.460","volume":"11","author":"J.G. Root","year":"1965","unstructured":"Root, J.G. (1965). \u201cScheduling with Deadlines and Loss Functions on \u03ba Parallel Machines.\u201d Management Science 11, 460\u2013475.","journal-title":"Management Science"},{"key":"407837_CR11","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/321921.321934","volume":"23","author":"S. Sahni","year":"1976","unstructured":"Sahni, S. (1976). \u201cAlgorithms for Scheduling Independent Tasks.\u201d Journal ACM 23, 116\u2013127.","journal-title":"Journal ACM"},{"key":"407837_CR12","doi-asserted-by":"crossref","first-page":"920","DOI":"10.1287\/opre.25.6.920","volume":"25","author":"S. Sahni","year":"1977","unstructured":"Sahni, S. (1977). \u201cGeneral Techniques for Combinatorial Approximation.\u201d Operations Research 25, 920\u2013936.","journal-title":"Operations Research"},{"key":"407837_CR13","unstructured":"Woeginger, G.J. (1998). \u201cWhen Does a Dynamic Programming Formulation Guarantee the Existence of an FPTAS?\u201d Report Woe-27, TU Graz, Austria."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1015487829051.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1015487829051\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1015487829051.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T10:56:45Z","timestamp":1747652205000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1015487829051"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,7]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2002,7]]}},"alternative-id":["407837"],"URL":"https:\/\/doi.org\/10.1023\/a:1015487829051","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,7]]}}}