{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,26]],"date-time":"2024-01-26T11:22:29Z","timestamp":1706268149418},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,2,6]],"date-time":"2013-02-06T00:00:00Z","timestamp":1360108800000},"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":[[2013,8]]},"DOI":"10.1007\/s10951-013-0314-4","type":"journal-article","created":{"date-parts":[[2013,2,5]],"date-time":"2013-02-05T02:15:28Z","timestamp":1360030528000},"page":"417-422","source":"Crossref","is-referenced-by-count":7,"title":["A note on reverse scheduling with maximum lateness objective"],"prefix":"10.1007","volume":"16","author":[{"given":"S. S.","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Brucker","sequence":"additional","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"}]},{"given":"N. V.","family":"Shakhlevich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. J.","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,2,6]]},"reference":[{"key":"314_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24804-0","volume-title":"Scheduling algorithms","author":"P Brucker","year":"2004","unstructured":"Brucker, P. (2004). Scheduling algorithms. Berlin: Springer."},{"key":"314_CR2","doi-asserted-by":"crossref","unstructured":"Brucker, P., & Shakhlevich, N. V. (2009). Inverse scheduling with maximum lateness objective. Journal of Scheduling, 12, 475\u2013488.","DOI":"10.1007\/s10951-009-0117-9"},{"key":"314_CR3","doi-asserted-by":"crossref","unstructured":"Du, J., & Leung, J. Y.-T. (1990). Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research, 15, 483\u2013495.","DOI":"10.1287\/moor.15.3.483"},{"key":"314_CR4","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0020-0190(90)90184-Y","volume":"36","author":"MC Fields","year":"1990","unstructured":"Fields, M. C., & Frederickson, G. N. (1990). A faster algorithm for the maximum weighted tardiness problem. Information Processing Letters, 36, 39\u201344.","journal-title":"Information Processing Letters"},{"key":"314_CR5","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. San Francisco: Freeman."},{"key":"314_CR6","unstructured":"Karp, R.M. (1972). Reducibility among combinatorial problems. In R.E. Miller & J.W. Thatcher (Eds.) Complexity of computer computations (pp. 85\u2013103) New York: Plenum Press."},{"key":"314_CR7","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1287\/mnsc.19.5.544","volume":"19","author":"EL Lawler","year":"1973","unstructured":"Lawler, E. L. (1973). Optimal sequencing of a single machine subject to precedence constraints. Management Science, 19, 544\u2013546.","journal-title":"Management Science"},{"key":"314_CR8","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/S0167-5060(08)70742-8","volume":"1","author":"EL Lawler","year":"1977","unstructured":"Lawler, E. L. (1977). A \u201cpseudopolynomial\u201d algorithm for sequencing jobs to minimize total tardiness. Annals of Discrete Mathematics, 1, 331\u2013342.","journal-title":"Annals of Discrete Mathematics"},{"key":"314_CR9","unstructured":"Lawler, E. L. (1982). Scheduling a single machine to minimize the number of late jobs. Preprint: Computer science division, Berkeley: University of California."},{"key":"314_CR10","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"JK 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":"314_CR11","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1287\/mnsc.15.1.102","volume":"15","author":"JM Moore","year":"1968","unstructured":"Moore, J. M. (1968). An n job, one machine sequencing algorithm for minimizing the number of late jobs. Management Science, 15, 102\u2013109.","journal-title":"Management Science"},{"key":"314_CR12","doi-asserted-by":"crossref","first-page":"2223","DOI":"10.1016\/j.cor.2011.11.005","volume":"39","author":"JMS Valente","year":"2012","unstructured":"Valente, J. M. S., & Schaller, J. E. (2012). Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem. Computers and Operations Research, 39, 2223\u20132231.","journal-title":"Computers and Operations Research"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-013-0314-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-013-0314-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-013-0314-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:48Z","timestamp":1559468388000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-013-0314-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,6]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,8]]}},"alternative-id":["314"],"URL":"https:\/\/doi.org\/10.1007\/s10951-013-0314-4","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2,6]]}}}