A Rolling Recruitment Process Under Applicant Stochastic Departures

References

• Ahn HS, Wang DD, Wu OQ (2021) Asset selling under debt obligations. Oper. Res. 69(4):1305–1323.Link, Google Scholar
• Akbarpour M, Li S, Gharan SO (2020) Thickness and information in dynamic matching markets. J. Political Econom. 128(3):783–815.Crossref, Google Scholar
• Arlotto A, Gurvich I (2019) Uniformly bounded regret in the multisecretary problem. Stoch. Syst. 9(3):231–260.Link, Google Scholar
• Arnosti N, Ma W (2023) Tight guarantees for static threshold policies in the prophet secretary problem. Oper. Res. 71(5):1777–1788.Link, Google Scholar
• Ashlagi I, Nikzad A, Strack P (2023) Matching in dynamic imbalanced markets. Rev. Econom. Stud. 90(3):1084–1124.Crossref, Google Scholar
• DeGroot MH (2004) Optimal Statistical Decision (Wiley, Hoboken, NJ).Crossref, Google Scholar
• Du L, Li Q (2020) A data-driven approach to high-volume recruitment: Application to student admission. Manufacturing Service Oper. Management 22(5):942–957.Link, Google Scholar
• Du L, Li Q, Yu P (2024) A sequential model for high-volume recruitment under random yields. Oper. Res. 72(1):60–90.Link, Google Scholar
• Epstein B, Ma W (2024) Selection and ordering policies for hiring pipelines via linear programming. Oper. Res. 72(5):2000–2013.Link, Google Scholar
• Feizi A, Carson A, Jaeker JB, Baker WE (2023) To batch or not to batch? Impact of admission batching on emergency department boarding time and physician productivity. Oper. Res. 71(3):939–957.Link, Google Scholar
• Ferguson TS (1989) Who solved the secretary problem? Statist. Sci. 4(3):282–289.Crossref, Google Scholar
• Freeman P (1983) The secretary problem and its extensions: A review. Internat. Statist. Rev. 51(2):189–206.Crossref, Google Scholar
• Gans N, Koole G, Mandelbaum A (2003) Telephone call centers: Tutorial, review, and research prospects. Manufacturing Service Oper. Management 5(2):79–141.Link, Google Scholar
• Gardner M (1960) Mathematical games. Sci. Amer. 202(152):178–179.Google Scholar
• Gilbert JP, Mosteller F (1966) Recognizing the maximum of a sequence. J. Amer. Statist. Assoc. 61(313):35–73.Crossref, Google Scholar
• Goldys B (1978) The secretary problem: The case with memory for one step. Demonstratio Math. 11(3):789–800.Google Scholar
• Ho S, Krishnan A (2015) A secretary problem with a sliding window for recalling applicants. Preprint, submitted August 31, https://doi.org/10.48550/arXiv.1508.07931.Google Scholar
• Karni E, Schwartz A (1977) Search theory: The case of search with uncertain recall. J. Econom. Theory 16(1):38–52.Crossref, Google Scholar
• Kesselheim T, Psomas A, Vardi S (2024) On hiring secretaries with stochastic departures. Oper. Res. 72(5):2076–2081.Link, Google Scholar
• Levi R, Magnanti T, Shaposhnik Y (2024) Scheduling with testing of heterogeneous jobs. Management Sci. 70(5):2934–2953.Link, Google Scholar
• Li Q, Yu P (2021) The secretary problem with multiple job vacancies and batch candidate arrivals. Oper. Res. Lett. 49(4):535–542.Crossref, Google Scholar
• Li Q, Yu P, Wu X (2016) Managing perishable inventories in retailing: Replenishment, clearance sales, and segregation. Oper. Res. 64(6):1270–1284.Link, Google Scholar
• Lindley D (1961) Dynamic programming and decision theory. J. Roy. Statist. Soc. Ser. C Appl. Statist. 10(1):39–51.Google Scholar
• Lu Y, Song JS, Yao D (2003) Order fill rate, leadtime variability, and advance demand information in an assemble-to-order system. Oper. Res. 51(2):292–308.Link, Google Scholar
• Powell WB (2007) Approximate Dynamic Programming: Solving the Curses of Dimensionality (Wiley, Hoboken, NJ).Crossref, Google Scholar
• Prastacos GP (1983) Optimal sequential investment decisions under conditions of uncertainty. Management Sci. 29(1):118–134.Link, Google Scholar
• Purohit M, Gollapudi S, Raghavan M (2019) Hiring under uncertainty. Chaudhuri K, Salakhutdinov R, eds. Proc. Internat. Conf. Machine Learn. (PMLR, New York), 5181–5189.Google Scholar
• Salem J, Gupta S (2023) Secretary problems with biased evaluations using partial ordinal information. Management Sci. 70(8):5337–5366.Link, Google Scholar
• Shirani S, Abouee-Mehrizi H, Shirani Faradonbeh MK (2024) Asymptotic analysis of multiclass advance patient scheduling. Preprint, submitted May 29, https://doi.org/10.2139/ssrn.4055715.Google Scholar
• Vera A, Banerjee S (2021) The Bayesian prophet: A low-regret framework for online decision making. Management Sci. 67(3):1368–1391.Link, Google Scholar
• Vulcano G, van Ryzin G, Maglaras C (2002) Optimal dynamic auctions for revenue management. Management Sci. 48(11):1388–1407.Link, Google Scholar
• Xie Y, Ma W, Xin L (2025) The benefits of delay to online decision-making. Management Sci., ePub ahead of print August 6, https://doi.org/10.1287/mnsc.2023.00549.Google Scholar
• Xu PJ, Allgor R, Graves SC (2009) Benefits of reevaluating real-time order fulfillment decisions. Manufacturing Service Oper. Management 11(2):340–355.Link, Google Scholar
• Zhang Y, Swaminathan JM (2020) Improved crop productivity through optimized planting schedules. Manufacturing Service Oper. Management 22(6):1165–1180.Link, Google Scholar