{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:29:55Z","timestamp":1725564595179},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212362"},{"type":"electronic","value":"9783540247494"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24749-4_16","type":"book-chapter","created":{"date-parts":[[2010,9,8]],"date-time":"2010-09-08T15:01:54Z","timestamp":1283958114000},"page":"176-186","source":"Crossref","is-referenced-by-count":1,"title":["On Minimizing the Total Weighted Tardiness on a Single Machine"],"prefix":"10.1007","author":[{"given":"Stavros G.","family":"Kolliopoulos","sequence":"first","affiliation":[]},{"given":"George","family":"Steiner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"16_CR1","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1287\/ijoc.14.1.52.7712","volume":"14","author":"R.K. Congram","year":"2002","unstructured":"Congram, R.K., Potts, C.N., van de Velde, S.L.: An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem. INFORMS Journal on Computing\u00a014(1), 52\u201367 (2002)","journal-title":"INFORMS Journal on Computing"},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1287\/moor.15.3.483","volume":"15","author":"J. Du","year":"1990","unstructured":"Du, J., Leung, J.Y.T.: Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research\u00a015, 483\u2013495 (1990)","journal-title":"Mathematics of Operations Research"},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/S0167-5060(08)70742-8","volume":"1","author":"E.L. Lawler","year":"1977","unstructured":"Lawler, E.L.: A \u201dpseudopolynomial\u201d algorithm for sequencing jobs to minimize total tardiness. Annals of Discrete Mathematics\u00a01, 331\u2013342 (1977)","journal-title":"Annals of Discrete Mathematics"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0167-6377(82)90022-0","volume":"1","author":"E.L. Lawler","year":"1982","unstructured":"Lawler, E.L.: A fully polynomial approximation scheme for the total tardiness problem. Operations Research Letters\u00a01, 207\u2013208 (1982)","journal-title":"Operations Research Letters"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1287\/mnsc.16.1.77","volume":"16","author":"E.L. Lawler","year":"1969","unstructured":"Lawler, E.L., Moore, J.M.: A functional equation and its application to resource allocation and sequencing problems. Management Science\u00a016, 77\u201384 (1969)","journal-title":"Management Science"},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"J.K. Lenstra","year":"1977","unstructured":"Lenstra, J.K., Rinnooy Kan, A.H.G., Brucker, P.: Complexity of machine scheduling problems. Annals of Discrete Mathematics\u00a01, 343\u2013362 (1977)","journal-title":"Annals of Discrete Mathematics"},{"key":"16_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/mnsc.6.1.1","volume":"6","author":"R. McNaughton","year":"1959","unstructured":"McNaughton, R.: Scheduling with deadlines and loss functions. Management Science\u00a06, 1\u201312 (1959)","journal-title":"Management Science"}],"container-title":["Lecture Notes in Computer Science","STACS 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24749-4_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T01:05:33Z","timestamp":1553043933000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24749-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212362","9783540247494"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24749-4_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}