{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T03:22:19Z","timestamp":1778642539150,"version":"3.51.4"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,7,8]],"date-time":"2023-07-08T00:00:00Z","timestamp":1688774400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,7,8]],"date-time":"2023-07-08T00:00:00Z","timestamp":1688774400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-19-1-0106"],"award-info":[{"award-number":["FA9550-19-1-0106"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1007\/s00186-023-00822-3","type":"journal-article","created":{"date-parts":[[2023,7,8]],"date-time":"2023-07-08T09:02:30Z","timestamp":1688806950000},"page":"43-56","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Approximation algorithms for stochastic online matching with reusable resources"],"prefix":"10.1007","volume":"98","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4890-1302","authenticated-orcid":false,"given":"Meghan","family":"Shanks","sequence":"first","affiliation":[]},{"given":"Ge","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Sheldon H.","family":"Jacobson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,8]]},"reference":[{"issue":"1","key":"822_CR1","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1287\/mnsc.21.1.60","volume":"21","author":"S Albright","year":"1974","unstructured":"Albright S (1974) Optimal sequential assignments with random arrival times. Manage Sci 21(1):60\u201367","journal-title":"Manage Sci"},{"issue":"1","key":"822_CR2","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1002\/nav.3800230114","volume":"23","author":"S Albright","year":"1976","unstructured":"Albright S (1976) A Markov chain version of the secretary problem. Naval Res Logist Q 23(1):151\u2013159","journal-title":"Naval Res Logist Q"},{"key":"822_CR3","unstructured":"Boros E, Elbassioni K, Gurvich V, Makino K (2015) Markov decision processes and stochastic games with total effective payoff. In: LIPIcs-Leibniz International Proceedings in Informatics, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, vol\u00a030"},{"issue":"7","key":"822_CR4","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1287\/mnsc.18.7.349","volume":"18","author":"C Derman","year":"1972","unstructured":"Derman C, Lieberman G, Ross S (1972) A sequential stochastic assignment problem. Manage Sci 18(7):349\u2013355","journal-title":"Manage Sci"},{"issue":"1","key":"822_CR5","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1287\/moor.2019.0993","volume":"45","author":"Y Disser","year":"2020","unstructured":"Disser Y, Fearnley J, Gairing M, G\u00f6bel O, Klimm M, Schmand D, Skopalik A, T\u00f6nnis A (2020) Hiring secretaries over time: The benefit of concurrent employment. Math Oper Res 45(1):323\u2013352. https:\/\/doi.org\/10.1287\/moor.2019.0993","journal-title":"Math Oper Res"},{"key":"822_CR6","unstructured":"Epstein L, Jez L, Sgall J, van Stee R (2012) Online interval scheduling on uniformly related machines"},{"key":"822_CR7","doi-asserted-by":"crossref","unstructured":"Faw M, Papadigenopoulos O, Caramanis C, Shakkottai S (2022) Learning to maximize welfare with a reusable resource. In: Abstract Proceedings of the 2022 ACM SIGMETRICS\/IFIP PERFORMANCE Joint International Conference on Measurement and Modeling of Computer Systems, Association for Computing Machinery, New York, NY, USA, SIGMETRICS\/PERFORMANCE \u201922, p 111-112","DOI":"10.1145\/3489048.3530960"},{"key":"822_CR8","doi-asserted-by":"crossref","unstructured":"Feldman J, Mehta A, Mirrokni V, Muthukrishnan S (2009) Online stochastic matching: Beating 1-1\/e. In: Foundations of Computer Science, 2009. FOCS\u201909. 50th Annual IEEE Symposium on, IEEE, pp 117\u2013126","DOI":"10.1109\/FOCS.2009.72"},{"key":"822_CR9","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1007\/978-3-662-48350-3_53","volume-title":"Algorithms - ESA 2015","author":"A Fiat","year":"2015","unstructured":"Fiat A, Gorelik I, Kaplan H, Novgorodov S (2015) The temp secretary problem. In: Bansal N, Finocchi I (eds) Algorithms - ESA 2015. Springer Berlin Heidelberg, Berlin, Heidelberg, pp 631\u2013642"},{"issue":"3","key":"822_CR10","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/s10878-007-9131-z","volume":"16","author":"SP Fung","year":"2008","unstructured":"Fung SP, Poon CK, Zheng F (2008) Online interval scheduling: randomized and multiprocessor cases. J Comb Optim 16(3):248\u2013262","journal-title":"J Comb Optim"},{"issue":"3","key":"822_CR11","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/S0304-405X(97)00009-3","volume":"44","author":"SR Grenadier","year":"1997","unstructured":"Grenadier SR, Weiss AM (1997) Investment in technological innovations: An option pricing approach. J Financ Econ 44(3):397\u2013416","journal-title":"J Financ Econ"},{"key":"822_CR12","doi-asserted-by":"crossref","unstructured":"Gross D, Shortle JF, Thompson JM, Harris CM (2008) Fundamentals of queueing theory. John Wiley & Sons, Hoboken, new Jersey","DOI":"10.1002\/9781118625651"},{"issue":"1","key":"822_CR13","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.ejor.2017.09.006","volume":"266","author":"N G\u00fclp\u0131nar","year":"2018","unstructured":"G\u00fclp\u0131nar N, \u00c7anako\u011flu E, Branke J (2018) Heuristics for the stochastic dynamic task-resource allocation problem with retry opportunities. Eur J Oper Res 266(1):291\u2013303","journal-title":"Eur J Oper Res"},{"key":"822_CR14","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.ypmed.2016.03.018","volume":"88","author":"SH Jacobson","year":"2016","unstructured":"Jacobson SH, Yu G, Jokela JA (2016) A double-risk monitoring and movement restriction policy for Ebola entry screening at airports in the United States. Prev Med 88:33\u201338","journal-title":"Prev Med"},{"issue":"4","key":"822_CR15","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1287\/moor.11.4.619","volume":"11","author":"D Kennedy","year":"1986","unstructured":"Kennedy D (1986) Optimal sequential assignment. Math Oper Res 11(4):619\u2013626","journal-title":"Math Oper Res"},{"key":"822_CR16","doi-asserted-by":"crossref","unstructured":"Kesselheim T, Radke K, Tonnis A, Vocking B (2013) An optimal online algorithm for weighted bipartite matching and extensions to combinatorial auctions. Algorithms-ESA","DOI":"10.1007\/978-3-642-40450-4_50"},{"issue":"4","key":"822_CR17","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1090\/S0002-9904-1977-14378-4","volume":"83","author":"U Krengel","year":"1977","unstructured":"Krengel U, Sucheston L (1977) Semiamarts and finite values. Bull Am Math Soc 83(4):745\u2013747","journal-title":"Bull Am Math Soc"},{"key":"822_CR18","first-page":"302","volume":"94","author":"RJ Lipton","year":"1994","unstructured":"Lipton RJ, Tomkins A (1994) Online interval scheduling. SODA 94:302\u2013311","journal-title":"SODA"},{"key":"822_CR19","doi-asserted-by":"crossref","unstructured":"Mahdian M, Yan Q (2011) Online bipartite matching with random arrivals: an approach based on strongly factor-revealing lps. In: Proceedings of the forty-third annual ACM symposium on Theory of computing, ACM, pp 597\u2013606","DOI":"10.1145\/1993636.1993716"},{"issue":"4","key":"822_CR20","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1287\/moor.1120.0551","volume":"37","author":"VH Manshadi","year":"2012","unstructured":"Manshadi VH, Gharan SO, Saberi A (2012) Online stochastic matching: Online actions based on offline statistics. Math Oper Res 37(4):559\u2013573","journal-title":"Math Oper Res"},{"issue":"6","key":"822_CR21","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1080\/07408170802510416","volume":"41","author":"LA McLay","year":"2009","unstructured":"McLay LA, Jacobson SH, Nikolaev AG (2009) A sequential stochastic passenger screening problem for aviation security. IIE Trans 41(6):575\u2013591","journal-title":"IIE Trans"},{"issue":"2","key":"822_CR22","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1287\/moor.11.2.230","volume":"11","author":"T Nakai","year":"1986","unstructured":"Nakai T (1986) A sequential stochastic assignment problem in a partially observable markov chain. Math Oper Res 11(2):230\u2013240","journal-title":"Math Oper Res"},{"key":"822_CR23","doi-asserted-by":"publisher","first-page":"1023","DOI":"10.1287\/opre.1090.0778","volume":"58","author":"AG Nikolaev","year":"2010","unstructured":"Nikolaev AG, Jacobson SH (2010) Technical Note-Stochastic Sequential Decision-Making with a Random Number of Jobs. Op Res 58:1023\u20131027","journal-title":"Op Res"},{"key":"822_CR24","doi-asserted-by":"publisher","DOI":"10.1002\/9780470182963","volume-title":"Approximate Dynamic Programming: Solving the curses of dimensionality,","author":"WB Powell","year":"2007","unstructured":"Powell WB (2007) Approximate Dynamic Programming: Solving the curses of dimensionality, vol 703. John Wiley & Sons"},{"key":"822_CR25","volume-title":"Markov decision processes: discrete stochastic dynamic programming","author":"ML Puterman","year":"2014","unstructured":"Puterman ML (2014) Markov decision processes: discrete stochastic dynamic programming. John Wiley & Sons"},{"issue":"4","key":"822_CR26","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/S0167-6377(98)00019-4","volume":"22","author":"SS Seiden","year":"1998","unstructured":"Seiden SS (1998) Randomized online interval scheduling. Oper Res Lett 22(4):171\u2013177","journal-title":"Oper Res Lett"},{"issue":"3","key":"822_CR27","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1287\/opre.1040.0180","volume":"53","author":"X Su","year":"2005","unstructured":"Su X, Zenios SA (2005) Patient choice in kidney allocation: a sequential stochastic assignment model. Oper Res 53(3):443\u2013455","journal-title":"Oper Res"},{"key":"822_CR28","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.pmcj.2015.10.008","volume":"27","author":"MB Terefe","year":"2016","unstructured":"Terefe MB, Lee H, Heo N, Fox GC, Oh S (2016) Energy-efficient multisite offloading policy using markov decision process for mobile cloud computing. Pervasive Mob Comput 27:75\u201389","journal-title":"Pervasive Mob Comput"},{"issue":"1","key":"822_CR29","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0304-3975(94)90150-3","volume":"130","author":"GJ Woeginger","year":"1994","unstructured":"Woeginger GJ (1994) On-line scheduling of jobs with fixed start and end times. Theoret Comput Sci 130(1):5\u201316","journal-title":"Theoret Comput Sci"},{"issue":"1","key":"822_CR30","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1002\/nav.21611","volume":"62","author":"DT Wu","year":"2015","unstructured":"Wu DT, Ross SM (2015) A stochastic assignment problem. Naval Res Logist (NRL) 62(1):23\u201331","journal-title":"Naval Res Logist (NRL)"},{"issue":"2","key":"822_CR31","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s11590-017-1191-0","volume":"12","author":"G Yu","year":"2018","unstructured":"Yu G, Jacobson SH (2018) Online C-benevolent Job Scheduling on Multiple Machines. Optim Lett 12(2):251\u2013263","journal-title":"Optim Lett"},{"issue":"6","key":"822_CR32","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1080\/24725854.2018.1516054","volume":"31","author":"G Yu","year":"2019","unstructured":"Yu G, Jacobson SH, Kiyavash N (2019) A bi-criteria multiple-choice secretary problem. IISE Trans 31(6):577\u2013588","journal-title":"IISE Trans"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-023-00822-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00186-023-00822-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-023-00822-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T14:03:03Z","timestamp":1692712983000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00186-023-00822-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,8]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["822"],"URL":"https:\/\/doi.org\/10.1007\/s00186-023-00822-3","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"value":"1432-2994","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,8]]},"assertion":[{"value":"16 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 May 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 June 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 July 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not Applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}]}}