| In this thesis, we first show that the performance of ranking and selection (R&S) procedures depends highly on the quality of the variance estimates that are used. We study the performance of R&S procedures using three variance estimators---overlapping area, overlapping Cramer--von Mises, and overlapping modified jackknifed Durbin-Watson estimators---that show better long-run performance than other estimators previously used in conjunction with R&S procedures for steady-state simulations. We devote additional study to the development of the new overlapping modified jackknifed Durbin-Watson estimator and demonstrate some of its useful properties.Next, we consider the problem of finding the best simulated system under a primary performance measure, while also satisfying stochastic constraints on secondary performance measures, known as constrained ranking and selection. We first present a new framework that allows certain systems to become dormant, halting sampling for those systems as the procedure continues. Secondly, we develop general procedures for constrained R&S that guarantee a nominal probability of correct selection, under any number of constraints and correlation across systems. In addition, we address topics critical to efficiency of the these procedures, namely the allocation of error between feasibility check and selection, the use of common random numbers (CRN), and the setup costs incurred when switching between systems. The use of CRN within our procedures can result in degradation of the probability of correct selection, so we also provide several new variance estimates to address this issue. |
