{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T12:10:21Z","timestamp":1738239021530,"version":"3.34.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540688860"},{"type":"electronic","value":"9783540688914"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68891-4_12","type":"book-chapter","created":{"date-parts":[[2008,5,23]],"date-time":"2008-05-23T13:31:37Z","timestamp":1211549497000},"page":"169-183","source":"Crossref","is-referenced-by-count":1,"title":["The Stochastic Machine Replenishment Problem"],"prefix":"10.1007","author":[{"given":"Kamesh","family":"Munagala","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peng","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","unstructured":"Bar-Noy, A., Bhatia, R., Naor, J., Schieber, B.: Minimizing service and operation costs of periodic scheduling. In: Proc. ACM-SIAM Symp. on Discrete Algorithms, pp. 11\u201320 (1998)"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Bertsekas, D.: Dynamic Programming and Optimal Control. 2nd edn. Athena Scientific (2001)","DOI":"10.1007\/0-306-48332-7_333"},{"issue":"4","key":"12_CR3","first-page":"1384","volume":"11","author":"D. Bertsimas","year":"2002","unstructured":"Bertsimas, D., Gamarnik, D., Tsitsiklis, J.: Performance of multiclass markovian queueing networks via piecewise linear Lyapunov functions. Annals of Applied Probability\u00a011(4), 1384\u20131428 (2002)","journal-title":"Annals of Applied Probability"},{"issue":"1","key":"12_CR4","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/opre.48.1.80.12444","volume":"48","author":"D. Bertsimas","year":"2000","unstructured":"Bertsimas, D., Ni\u00f1o-Mora, J.: Restless bandits, linear programming relaxations, and a primal-dual index heuristic. Oper. Res.\u00a048(1), 80\u201390 (2000)","journal-title":"Oper. Res."},{"key":"12_CR5","unstructured":"Dean, B., Goemans, M., Vondr\u00e1k, J.: Approximating the stochastic knapsack problem: The benefit of adaptivity. In: Proc. of the 2004 Annual Symp. on Foundations of Computer Science (2004)"},{"key":"12_CR6","unstructured":"Dean, B., Goemans, M., Vondr\u00e1k, J.: Adaptivity and approximation for stochastic packing problems. In: Proc. of the 2005 Annual ACM-SIAM Symp. on Discrete Algorithms (2005)"},{"key":"12_CR7","unstructured":"Durrett, R.: Probability: Theory and Examples, 3rd edn. Duxbury Press (2004)"},{"key":"12_CR8","unstructured":"Gittins, J.C., Jones, D.M.: A dynamic allocation index for the sequential design of experiments. Progress in statistics (European Meeting of Statisticians) (1972)"},{"key":"12_CR9","unstructured":"Goemans, M.X., Kleinberg, J.M.: An improved approximation ratio for the minimum latency problem. In: SODA, pp. 152\u2013158 (1996)"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Goseva-Popstojanova, K., Trivedi, K.S.: Stochastic modeling formalisms for dependability, performance and performability. In: Performance Evaluation: Origins and Directions, pp. 403\u2013422 (2000)","DOI":"10.1007\/3-540-46506-5_17"},{"issue":"2","key":"12_CR11","first-page":"370","volume":"23","author":"J.M. Harrison","year":"1975","unstructured":"Harrison, J.M.: Dynamic scheduling of a multiclass queue: Discount optimality. Operations Research\u00a023(2), 370\u2013382 (1975)","journal-title":"Operations Research"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Jain, K., Mahdian, M., Saberi, A.: A new greedy approach for facility location problems. In: Proc. of the 2002 Annual ACM Symp. on Theory of Computing (May 2002)","DOI":"10.1145\/509907.510012"},{"key":"12_CR13","unstructured":"Kenyon, C., Schabanel, N.: The data broadcast problem with non-uniform transmission times. In: Proc. ACM-SIAM Symp. on Discrete Algorithms (1999)"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Mehta, A., Saberi, A., Vazirani, U., Vazirani, V.: Adwords and generalized on-line matching. In: FOCS 2005. Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, pp. 264\u2013273 (2005)","DOI":"10.1109\/SFCS.2005.12"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Munagala, K., Babu, S., Motwani, R., Widom, J.: The pipelined set cover problem. In: Proc. Intl. Conf. Database Theory (2005)","DOI":"10.1007\/978-3-540-30570-5_6"},{"issue":"1","key":"12_CR16","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1239\/aap\/999187898","volume":"33","author":"J. Ni\u00f1o Mora","year":"2001","unstructured":"Ni\u00f1o Mora, J.: Restless bandits, partial conservation laws and indexability. Adv. in Appl. Probab.\u00a033(1), 76\u201398 (2001)","journal-title":"Adv. in Appl. Probab."},{"issue":"2","key":"12_CR17","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1287\/moor.24.2.293","volume":"24","author":"C.H. Papadimitriou","year":"1999","unstructured":"Papadimitriou, C.H., Tsitsiklis, J.N.: The complexity of optimal queuing network control. Math. Oper. Res.\u00a024(2), 293\u2013305 (1999)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"12_CR18","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1214\/aoap\/1177005207","volume":"4","author":"J.N. Tsitsiklis","year":"1994","unstructured":"Tsitsiklis, J.N.: A short proof of the Gittins index theorem. Annals of Applied Probability\u00a04(1), 194\u2013199 (1994)","journal-title":"Annals of Applied Probability"},{"issue":"A","key":"12_CR19","doi-asserted-by":"publisher","first-page":"287","DOI":"10.2307\/3214163","volume":"25","author":"P. Whittle","year":"1988","unstructured":"Whittle, P.: Restless bandits: Activity allocation in a changing world. Appl. Prob.\u00a025(A), 287\u2013298 (1988)","journal-title":"Appl. Prob."}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68891-4_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T11:30:46Z","timestamp":1738236646000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68891-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540688860","9783540688914"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68891-4_12","relation":{},"subject":[]}}