{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T22:58:08Z","timestamp":1762297088089},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2006,8,1]],"date-time":"2006-08-01T00:00:00Z","timestamp":1154390400000},"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":[[2006,8]]},"DOI":"10.1007\/s10951-006-7039-6","type":"journal-article","created":{"date-parts":[[2006,5,11]],"date-time":"2006-05-11T09:45:07Z","timestamp":1147340707000},"page":"343-364","source":"Crossref","is-referenced-by-count":19,"title":["An O(n2) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness"],"prefix":"10.1007","volume":"9","author":[{"given":"Zhongjun","family":"Tian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. T.","family":"Ng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T. C. E.","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7039_CR1","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1287\/opre.31.2.381","volume":"31","author":"K. R. Baker","year":"1983","unstructured":"Baker, K. R., E. L. Lawler, J. K. Lenstra and A. H. G. Rinnooy Kan, \u201cPreemptive Scheduling of a Single Machine to Minimize Maximum Cost Subject to Release Dates and Precedence Constraints,\u201d Operations Research, 31, 381\u2013386 (1983).","journal-title":"Operations Research"},{"key":"7039_CR2","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/S0166-218X(99)00238-3","volume":"103","author":"P. Baptiste","year":"2000","unstructured":"Baptiste, P., \u201cScheduling Equal-Length Jobs on Identical Parallel Machines,\u201d Discrete Applied Mathematics, 103, 21\u201332 (2000).","journal-title":"Discrete Applied Mathematics"},{"key":"7039_CR3","unstructured":"Brucker, P. and S. Knust, \u201cComplexity Results for Scheduling Problems,\u201d URL: http:\/\/waw.mathematik.uni-osnabrueck.de\/research\/OR\/class."},{"key":"7039_CR4","first-page":"21","volume-title":"Handbook of Combinatorial Optimization","author":"B. Chen","year":"1998","unstructured":"Chen, B., C. Potts and G. Woeginger, \u201cA Review of Machine Scheduling: Complexity, algorithms and approximability,\u201d Handbook of Combinatorial Optimization, Kluwer Academic Publishers, Boston, 1998, pp. 21\u2013169."},{"issue":"2","key":"7039_CR5","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0895-7177(94)90204-6","volume":"20","author":"T. C. E. Cheng","year":"1994","unstructured":"Cheng, T. C. E. and V. S. Gordon, \u201cOptimal Assignment of Due-dates for Preemptive Single-machine Scheduling,\u201d Mathematical & Computer Modeling, 20(2), 33\u201340 (1994).","journal-title":"Mathematical & Computer Modeling"},{"key":"7039_CR6","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1002\/1520-6750(199203)39:2<265::AID-NAV3220390209>3.0.CO;2-L","volume":"39","author":"C. Chu","year":"1992","unstructured":"Chu, C., \u201cA Branch-And-Bound Algorithm to Minimize Total Tardiness with Different Release Dates,\u201d Naval Research Logistics, 39, 265\u2013283 (1992).","journal-title":"Naval Research Logistics"},{"key":"7039_CR7","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1287\/opre.17.4.701","volume":"17","author":"H. Emmons","year":"1969","unstructured":"Emmons, H., \u201cOne-machine Sequencing to Minimize Certain Functions of Job Tardiness,\u201d Operations Research, 17, 701\u2013715 (1969).","journal-title":"Operations Research"},{"key":"7039_CR8","unstructured":"Gordon, V. S. and V. S. Tanaev, \u201cOn minimax problems of scheduling theory for a single machine (in Russian),\u201d Vetsi Akadeii Navuk BSSR. Ser. fizika-matematychnykh navuk, 1983, pp. 3\u20139."},{"key":"7039_CR9","first-page":"287","volume":"5","author":"R. L. Graham","year":"1979","unstructured":"Graham, R. L., E. L. Lawler, J. K. Lenstra and A. H. G. Rinnooy Kan, \u201cOptimization and approximation in Deterministic Sequencing and Scheduling: A Survey,\u201d Annals of Operations Research, 5, 287\u2013326 (1979).","journal-title":"Annals of Operations Research"},{"key":"7039_CR10","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., E. L. Lawler, J. K. Lenstra and A. H. G. Rinnooy Kan, \u201cPreemptive Scheduling of Uniform Machines Subject to Release Dates,\u201d Progress in Combinatorial Optimization, Academic Press, New York, 1984, pp. 245\u2013261."},{"key":"7039_CR11","volume-title":"Scheduling: Theory, Algorithms, and Aystems","author":"M. Pinedo","year":"1995","unstructured":"Pinedo, M., Scheduling: Theory, Algorithms, and Aystems. Prentice Hall, New Jersey, 1995."},{"key":"7039_CR12","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1002\/(SICI)1099-1425(199903\/04)2:2<55::AID-JOS14>3.0.CO;2-5","volume":"2","author":"W Szwarc","year":"1999","unstructured":"Szwarc, W, F. Della Croce and A. Grosso, \u201cSolution of the single machine total tardiness problem,\u201d Journal of Scheduling, 2, 55\u201371 (1999).","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-006-7039-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-006-7039-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-006-7039-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T05:39:38Z","timestamp":1559453978000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-006-7039-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,8]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2006,8]]}},"alternative-id":["7039"],"URL":"https:\/\/doi.org\/10.1007\/s10951-006-7039-6","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,8]]}}}