{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:34:10Z","timestamp":1725492850963},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540672609"},{"type":"electronic","value":"9783540464297"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46429-8_11","type":"book-chapter","created":{"date-parts":[[2007,10,20]],"date-time":"2007-10-20T14:52:33Z","timestamp":1192891953000},"page":"145-155","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Allocation Policies for Mobile Agents"],"prefix":"10.1007","author":[{"given":"M. D.","family":"Hamilton","sequence":"first","affiliation":[]},{"given":"I.","family":"Mitrani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,12,20]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1214\/aoms\/1177700285","volume":"26","author":"D. Blackwell","year":"1965","unstructured":"D. Blackwell, \u201cDiscounted dynamic programming\u201d, Ann. Math. Stat., 26, 226\u2013235, 1965.","journal-title":"Ann. Math. Stat."},{"key":"11_CR2","volume-title":"Finite State Markovian Decision Processes","author":"C. Derman","year":"1970","unstructured":"C. Derman, Finite State Markovian Decision Processes, Acedemic Press, New York, 1970."},{"key":"11_CR3","volume-title":"The Art and Theory of Dynamic Programming","author":"S.E. Dreyfus","year":"1977","unstructured":"S.E. Dreyfus and A.M. Law, The Art and Theory of Dynamic Programming, Acedemic Press, New York, 1977."},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"979","DOI":"10.2307\/1427802","volume":"25","author":"A. Hordijk","year":"1993","unstructured":"A. Hordijk and G. Koole, \u201cOn the optimality of LEPT and \u03bcc rules for parallel processors and dependent arrival processes\u201d, Advances in Applied Probability, 25, 979\u2013996, 1993.","journal-title":"Advances in Applied Probability"},{"volume-title":"Probability, Statistics and Optimization","year":"1994","key":"11_CR5","unstructured":"F.P. Kelly (editor), Probability, Statistics and Optimization, J. Wiley, Chichester, 1994."},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1023\/A:1019136231100","volume":"29","author":"E. Kim","year":"1998","unstructured":"E. Kim and M.P. Van Oyen, \u201cDynamic scheduling to minimize lost sales subject to set-up costs\u201d, Queueing Systems, 29, 193\u2013229, 1998.","journal-title":"Queueing Systems"},{"key":"11_CR7","volume-title":"Introduction to Stochastic Dynamic Programming","author":"S.M. Ross","year":"1983","unstructured":"S.M. Ross, Introduction to Stochastic Dynamic Programming, Acedemic Press, New York, 1983."},{"key":"11_CR8","volume-title":"Optimization Over Time. Dynamic Programming and Stochastic Control","author":"P. Whittle","year":"1983","unstructured":"P. Whittle, Optimization Over Time. Dynamic Programming and Stochastic Control, Vols. I and II, J. Wiley, New York, 1983."}],"container-title":["Lecture Notes in Computer Science","Computer Performance Evaluation.Modelling Techniques and Tools"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46429-8_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T09:47:23Z","timestamp":1551001643000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46429-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540672609","9783540464297"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-46429-8_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}