The cumulative sum (CUSUM) control chart is one of the most popular methods used to detect a process mean shift. When one specific size of the mean shift is assumed, the CUSUM chart can be optimally designed in terms of average run length (ARL). In practice, however, the size of the mean shift is usually unknown, and the CUSUM chart can perform poorly when the actual size of the mean shift is significantly different from the assumed size. In this paper, we assign a probability distribution to the size of the mean shift to represent the lack of knowledge of the shift size. We use an ARL-based performance measure, called expected weighted run length (EWRL), and propose a method to optimally design a CUSUM chart based on EWRL. This method can be easily extended to other CUSUM-based control charts, such as weighted CUSUM and multi-CUSUM charts proposed in the literature. The numerical results show that the CUSUM or the CUSUM-based chart can be improved by our proposed method in terms of EWRL.
This work proposes a new method for approximating the Pareto front of a multi-objective simulation optimization problem (MOP) where the explicit forms of the objective functions are not available. The method iteratively approximates each objective function using a metamodeling scheme and employs a weighted sum method to convert the MOP into a set of single objective optimization problems. The weight on each single objective function is adaptively determined by accessing newly introduced points at the current iteration and the non-dominated points so far. A trust region algorithm is applied to the single objective problems to search for the points on the Pareto front. The numerical results show that the proposed algorithm efficiently generates evenly distributed points for various types of Pareto fronts.
Patient appointment scheduling (AS) in outpatient clinics is a widely studied subject and plays an important role in facilitating the efficient use of clinical resources and patients’ timely access to quality care. This paper considers two AS systems: open access (OA) and overbooking (OB). Clinics make strategic decisions on selecting an AS system and then make tactical decisions on the efficient or optimal use of the system based on the selection. This study proposes some guidelines for the strategic choice of an AS system. For this purpose, we conduct a discrete-event simulation to compare the two AS systems under various environments. We employ four performance measures for the comparison: overtime work, the proportion of unmet demand, in-clinic waiting times, and the use of appointment time slots. For the analysis, we devise an integrated measure representing a linear combination of the four measures. We divide the analysis into two phases. In the first phase, well-performed OA and OB policies are separately identified, and in the second phase, the two scheduling systems with the identified policies are compared. We find overbooking is more robust to various clinic environments and performs better than open access in general. Along with that result, we additionally suggest some rules for determining best open access and overbooking policies.
We consider unconstrained black-box biobjective optimization problems in which analytic forms of the objective functions are not available and function values can be obtained only through computationally expensive simulations. We propose a new algorithm to approximate the Pareto optimal solutions of such problems based on a trust-region approach. At every iteration, we identify a trust region, then sample and evaluate points from it. To determine nondominated solutions in the trust region, we employ a scalarization method to convert the two objective functions into one. We construct and optimize quadratic regression models for the two original objectives and the converted single objective. We then remove dominated points from the current Pareto approximation and construct a new trust region around the most isolated point in order to explore areas that have not been visited. We prove convergence of the method under general regularity conditions and present numerical results suggesting that the method efficiently generates well-distributed Pareto optimal solutions.