In this paper, we present a new budget allocation framework for the problem of selecting the best simulated design from a finite set of alternatives. The new framework is developed on the basis of general underlying distributions and a finite simulation budget. It adopts the expected opportunity cost (EOC) quality measure, which, compared to the traditional probability of correct selection (PCS) measure, penalizes a particularly bad choice more than a slightly incorrect selection, and is thus preferred by risk-neutral practitioners and decision makers. To this end, we establish a closed-form approximation of EOC to formulate the budget allocation problem and derive the corresponding optimality conditions. A sequential budget allocation algorithm is then developed for implementation. The efficiency of the proposed method is illustrated via numerical experiments. We also link the EOC and PCS-based budget allocation problems by showing that the two are asymptotically equivalent. This result explains, to some extent, the similarity in performance between the EOC and PCS allocation procedures observed in the literature. The online appendix is available at https://doi.org/10.1287/opre.2016.1581 .

The service sector has become increasingly important in today's economy. To meet the rising expectation of high‐quality services, efficiently allocating resources is vital for service systems to balance service qualities with costs. In particular, this paper focuses on a class of resource allocation problems where the service‐level objective and constraints are in the form of probabilistic measures. Further, process complexity and system dynamics in service systems often render their performance evaluation and optimization challenging and relying on simulation models. To this end, we propose a generalized resource allocation model with probabilistic measures, and subsequently, develop an optimal computing budget allocation (OCBA) formulation to select the optimal solution subject to random noises in simulation. The OCBA formulation minimizes the expected opportunity cost that penalizes based on the quality of the selected solution. Further, the formulation takes a Bayesian approach to consider the prior knowledge and potential performance correlations on candidate solutions. Then, the asymptotic optimality conditions of the formulation are derived, and an iterative algorithm is developed accordingly. Numerical experiments and a case study inspired by a real‐world problem in a hospital emergency department demonstrate the effectiveness of the proposed algorithm for solving the resource allocation problem via simulation.

We study simulation-assisted service system design, where stochastic simulation is used to select the best design from a finite set of structural or parametric alternatives. Since high-fidelity simulation can be prohibitively time-consuming, we adopt a multifidelity approach that combines expensive high-fidelity runs with cheaper, coarser low-fidelity runs to estimate system performance and compare designs. This research is motivated by the design of an integrated electric vehicle (EV) fast-charging station. We formulate the design problem under the fixed-budget ranking and selection framework, in which the simulation budget is allocated across fidelity levels and design alternatives to maximize the probability of correct selection of the best design. We derive an asymptotic solution, develop a selection algorithm that satisfies the resulting optimality conditions, and establish its consistency and asymptotic optimality. We further demonstrate the algorithm’s empirical performance through an EV fast-charging station case study and a set of synthetic examples. These theoretical and empirical results provide actionable guidance on when and how multifidelity simulation can improve best-design selection in complex service system design problems.