{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:12:15Z","timestamp":1774415535105,"version":"3.50.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2010,2,5]],"date-time":"2010-02-05T00:00:00Z","timestamp":1265328000000},"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":[[2010,12]]},"DOI":"10.1007\/s10951-009-0160-6","type":"journal-article","created":{"date-parts":[[2010,2,4]],"date-time":"2010-02-04T15:15:30Z","timestamp":1265296530000},"page":"597-607","source":"Crossref","is-referenced-by-count":29,"title":["Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming"],"prefix":"10.1007","volume":"13","author":[{"given":"D\u00e9bora P.","family":"Ronconi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Warren B.","family":"Powell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,2,5]]},"reference":[{"key":"160_CR1","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0272-6963(82)90020-1","volume":"3","author":"K. R. Baker","year":"1982","unstructured":"Baker, K. R., & Bertrand, J. W. M. (1982). A dynamic priority rule for scheduling against due-dates. Journal of Operations Management, 3, 37\u201342.","journal-title":"Journal of Operations Management"},{"key":"160_CR2","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1080\/002075497195821","volume":"35","author":"D. Bergamaschi","year":"1997","unstructured":"Bergamaschi, D., Cigolini, R., Perona, M., & Portioli, A. (1997). Order review and release strategies in a job shop environment: a\u00a0review and a classification. International Journal of Production Research, 35, 399\u2013420.","journal-title":"International Journal of Production Research"},{"key":"160_CR3","volume-title":"Neuro-dynamic programming","author":"D. P. Bertsekas","year":"1996","unstructured":"Bertsekas, D. P., & Tsitsiklis, J. N. (1996). Neuro-dynamic programming. Belmont: Athena Scientific."},{"key":"160_CR4","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1287\/moor.15.3.483","volume":"15","author":"J. Du","year":"1990","unstructured":"Du, J., & Leung, J. Y.-T. (1990). Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research, 15, 483\u2013495.","journal-title":"Mathematics of Operations Research"},{"key":"160_CR5","doi-asserted-by":"crossref","first-page":"850","DOI":"10.1287\/opre.51.6.850.24925","volume":"51","author":"D. P. Farias de","year":"2003","unstructured":"de Farias, D. P., & Van Roy, B. (2003). The linear programming approach to approximate dynamic programming. Operations Research, 51, 850\u2013865.","journal-title":"Operations Research"},{"key":"160_CR6","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/s10994-006-8365-9","volume":"65","author":"A. George","year":"2006","unstructured":"George, A., & Powell, W. B. (2006). Adaptive stepsizes for recursive estimation with applications in approximate dynamic programming. Machine Learning, 65, 167\u2013198.","journal-title":"Machine Learning"},{"key":"160_CR7","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0377-2217(86)90015-9","volume":"24","author":"J. J. Kanet","year":"1986","unstructured":"Kanet, J. J. (1986). Tactically delayed versus non-delay scheduling: an experimental investigation. European Journal of Operational Research, 24, 99\u2013115.","journal-title":"European Journal of Operational Research"},{"key":"160_CR8","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1023\/B:JOSH.0000031421.64487.95","volume":"7","author":"J. J. Kanet","year":"2004","unstructured":"Kanet, J. J., & Li, X. (2004). A weighted modified due date rule for sequencing to minimize weighted tardiness. Journal of Scheduling, 7, 261\u2013276.","journal-title":"Journal of Scheduling"},{"key":"160_CR9","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1287\/opre.48.1.99.12447","volume":"48","author":"J. J. Kanet","year":"2000","unstructured":"Kanet, J. J., & Sridharan, V. (2000). Scheduling with inserted idle time: problem taxonomy and literature review. Operations Research, 48, 99\u2013110.","journal-title":"Operations Research"},{"key":"160_CR10","doi-asserted-by":"crossref","first-page":"1603","DOI":"10.1016\/j.compchemeng.2006.05.043","volume":"30","author":"J. H. Lee","year":"2006","unstructured":"Lee, J. H., & Lee, J. M. (2006). Approximate dynamic programming based approach to process control and scheduling. Computer and Chemical Engineering, 30, 1603\u20131618.","journal-title":"Computer and Chemical Engineering"},{"key":"160_CR11","volume-title":"Handbook of learning and approximate dynamic programming","author":"W. B. Powell","year":"2004","unstructured":"Powell, W. B., & Van Roy, B. (2004). Approximate dynamic programming for high dimensional resource allocation problems. In J. Si, A. G. Barto, & W. B. Powell II (Eds.), Handbook of learning and approximate dynamic programming. New York: IEEE Press."},{"key":"160_CR12","doi-asserted-by":"crossref","DOI":"10.1002\/9780470182963","volume-title":"Approximate dynamic programming: solving the curses of dimensionality","author":"W. B. Powell","year":"2007","unstructured":"Powell, W. B. (2007). Approximate dynamic programming: solving the curses of dimensionality. Hoboken: Wiley."},{"key":"160_CR13","volume-title":"Scheduling: theory, algorithms, and systems","author":"M. Pinedo","year":"2002","unstructured":"Pinedo, M. (2002). Scheduling: theory, algorithms, and systems. Upper Saddle River: Prentice-Hall."},{"key":"160_CR14","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0305-0483(84)90011-2","volume":"12","author":"T. Sen","year":"1984","unstructured":"Sen, T., & Gupta, S. K. (1984). State-of-art survey of static scheduling research involving due dates. OMEGA, 12, 63\u201376.","journal-title":"OMEGA"},{"key":"160_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0925-5273(02)00265-7","volume":"83","author":"T. Sen","year":"2003","unstructured":"Sen, T., Sulek, J. M., & Dileepan, P. (2003). Static scheduling research to minimize weighted and unweighted tardiness: a state-of-the-art survey. International Journal of Production Economics, 83, 1\u201312.","journal-title":"International Journal of Production Economics"},{"key":"160_CR16","doi-asserted-by":"crossref","first-page":"1183","DOI":"10.1016\/S0305-0548(96)00025-1","volume":"23","author":"V. Sridharan","year":"1996","unstructured":"Sridharan, V., & Zhou, Z. (1996). Dynamic non-preemptive single machine scheduling. Computers and Operations Research, 23, 1183\u20131190.","journal-title":"Computers and Operations Research"},{"key":"160_CR17","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1287\/trsc.1030.0073","volume":"38","author":"M. Z. Spivey","year":"2004","unstructured":"Spivey, M. Z., & Powell, W. B. (2004). The dynamic assignment problem. Transportation Science, 38, 339\u2013419.","journal-title":"Transportation Science"},{"key":"160_CR18","volume-title":"Reinforcement learning","author":"R. Sutton","year":"1998","unstructured":"Sutton, R., & Barto, A. (1998). Reinforcement learning. Cambridge: MIT Press."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-009-0160-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-009-0160-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-009-0160-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T05:39:44Z","timestamp":1559453984000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-009-0160-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,2,5]]},"references-count":18,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2010,12]]}},"alternative-id":["160"],"URL":"https:\/\/doi.org\/10.1007\/s10951-009-0160-6","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,2,5]]}}}