307
Views
0
CrossRef citations to date
0
Altmetric
Design & Manufacturing

A convergent algorithm for ranking and selection with censored observations

ORCID Icon, , &
Pages 523-535 | Received 23 Nov 2020, Accepted 02 Mar 2022, Published online: 29 Apr 2022

References

  • Ban, G.-Y. (2020) Confidence intervals for data-driven inventory policies with demand censoring. Operations Research , 68 (2), 309–326.
  • Besbes, O. and Muharremoglu, A. (2013) On implications of demand censoring in the newsvendor problem. Management Science , 59 (6), 1407–1424.
  • Chen, C.-H. , He, D. , Fu, M. and Lee, L.H. (2008) Efficient simulation budget allocation for selecting an optimal subset. INFORMS Journal on Computing , 20 (4), 579–595.
  • Chen, C.-H. and Lee, L.H. (2011) Stochastic Simulation Optimization: An Optimal Computing Budget Allocation , Volume 1. World Scientific, Singapore.
  • Chen, C.-H. , Lin, J. , Yücesan, E. and Chick, S.E. (2000) Simulation budget allocation for further enhancing the efficiency of ordinal optimization. Discrete Event Dynamic Systems , 10 (3), 251–270.
  • Chen, H.-C. , Chen, C.-H. and Yucesan, E. (2000) Computing efforts allocation for ordinal optimization and discrete event simulation. IEEE Transactions on Automatic Control , 45 (5), 960–964.
  • Chen, L. , Mersereau, A.J. and Wang, Z. (2017). Optimal merchandise testing with limited inventory. Operations Research , 65 (4), 968–991.
  • Chen, Y. and Ryzhov, I.O. (2019) Balancing optimal large deviations in sequential selection. Technical Report. University of Maryland, College Park, MD.
  • Chick, S. , Forster, M. and Pertile, P. (2017) A Bayesian decision theoretic model of sequential experimentation with delayed response. Journal of the Royal Statistical Society: Series B (Statistical Methodology) , 79 (5), 1439–1462.
  • Fan, W. , Hong, L.J. and Nelson, B.L. (2016) Indifference-zone-free selection of the best. Operations Research , 64 (6), 1499–1514.
  • Fu, M.C. , Hu, J.-Q. , Chen, C.-H. and Xiong, X. (2007) Simulation allocation for determining the best design in the presence of correlated sampling. INFORMS Journal on Computing , 19 (1), 101–111.
  • Gans, N. , Koole, G. and Mandelbaum, A. (2003) Telephone call centers: Tutorial, review, and research prospects. Manufacturing & Service Operations Management , 5 (2), 79–141.
  • Gao, S. , Chen, W. and Shi, L. (2017) A new budget allocation framework for the expected opportunity cost. Operations Research , 65 (3), 787–803.
  • Gao, S. , Lee, L.H. , Chen, C.-H. and Shi, L. (2015) A sequential budget allocation framework for simulation optimization. IEEE Transactions on Automation Science and Engineering , 14 (2), 1185–1194.
  • Gao, S. , Xiao, H. , Zhou, E. and Chen, W. (2017) Robust ranking and selection with optimal computing budget allocation. Automatica , 81 , 30–36.
  • Glynn, P. and Juneja, S. (2004) A large deviations perspective on ordinal optimization, in Proceedings of the 2004 Winter Simulation Conference, 2004 , Volume 1. IEEE Press, Piscataway, NJ, pp. 577–585.
  • Hong, L.J. , Fan, W. and Luo, J. (2021) Review on ranking and selection: A new perspective. Frontiers of Engineering Management , 8 (3), 321–343.
  • Krantz, S.G. and Parks, H.R. (2012) The Implicit Function Theorem: History, Theory, and Applications . Springer Science & Business Media, Birkhäuser, Switzerland.
  • Lee, L.H. , Pujowidianto, N.A. , Li, L.-W. , Chen, C.-H. and Yap, C.M. (2012) Approximate simulation budget allocation for selecting the best design in the presence of stochastic constraints. IEEE Transactions on Automatic Control , 57 (11), 2940–2945.
  • Li, H. , Xu, X. and Zhao, Y. (2019) Efficient simulation budget allocation with bound information. IEEE Transactions on Automatic Control , 65 (1), 207–222.
  • Li, J. , Liu, W. , Pedrielli, G. , Lee, L.H. and Chew, E.P. (2017) Optimal computing budget allocation to select the nondominated systems—A large deviations perspective. IEEE Transactions on Automatic Control , 63 (9), 2913–2927.
  • Li, Y. , Fu, M.C. and Xu, J. (2021) An optimal computing budget allocation tree policy for Monte Carlo tree search. IEEE Transactions on Automatic Control.
  • Liu, H. , Liang, J. , Lee, L.H. and Chew, E.P. (2022) Unifying offline and online simulation for online decision making. IISE Transactions.
  • Pasupathy, R. , Hunter, S.R. , Pujowidianto, N.A. , Lee, L.H. and Chen, C.-H. (2014) Stochastically constrained ranking and selection via SCORE. ACM Transactions on Modeling and Computer Simulation (TOMACS) , 25 (1), 1–26.
  • Peng, Y. , Chen, C.-H. , Chong, E.K. and Fu, M.C. (2018) A review of static and dynamic optimization for ranking and selection, in 2018 Winter Simulation Conference (WSC) , IEEE Press, Piscataway, NJ, pp. 1909–1920.
  • Peng, Y. , Chong, E.K. , Chen, C.-H. and Fu, M.C. (2018) Ranking and selection as stochastic control. IEEE Transactions on Automatic Control , 63 (8), 2359–2373.
  • Rudin, W. (1964) Principles of Mathematical Analysis , Volume 3. McGraw-hill New York, NY.
  • Shi, Z. , Gao, S. , Xiao, H. and Chen, W. (2019) A worst-case formulation for constrained ranking and selection with input uncertainty. Naval Research Logistics (NRL) , 66 (8), 648–662.
  • Shi, Z. , Peng, Y. , Shi, L. , Chen, C.-H. and Fu, M.C. (2021) Dynamic sampling allocation under finite simulation budget for feasibility determination. INFORMS Journal on Computing , 34 (1), 557–568.
  • Wu, D. and Zhou, E. (2018) Analyzing and provably improving fixed budget ranking and selection algorithms. arXiv preprint arXiv:1811.12183.
  • Xiao, H. , Lee, L.H. , Morrice, D. , Chen, C.-H. and Hu, X. (2021) Ranking and selection for terminating simulation under sequential sampling. IISE Transactions , 53 (7), 735–750.
  • Zhang, S. , Lee, L.H. , Chew, E.P. , Xu, J. and Chen, C. (2016, January) A simulation budget allocation procedure for enhancing the efficiency of optimal subset selection. IEEE Transactions on Automatic Control , 61 (1), 62–75.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.