Finding Feasible Systems for a Stochastic Constraint with Relaxed Tolerance Levels
We consider the problem of finding feasible systems with respect to a stochastic constraint when the performance of each system needs to be evaluated via simulation. We develop a new procedure, referred to as the Indifference-Zone Relaxation procedure, to lessen inefficiencies of existing procedures derived under the assumption that all systems are exactly the tolerance level away from the threshold. Specifically, our procedure introduces a set of relaxed tolerance levels and simultaneously implements two subroutines for each relaxed tolerance level: one to identify clearly feasible systems and the other to exclude clearly infeasible systems. As a result, the proposed procedure allows early determination of feasibility for some systems, while maintaining the statistical guarantee. The efficiency of the procedure is investigated through experimental results.
Authors
- Sigrún Andradóttir (ORCID: https://orcid.org/0000-0002-5763-0199)
- Yuwei Zhou (ORCID: https://orcid.org/0000-0003-1266-7200)
- Seong‐Hee Kim (ORCID: https://orcid.org/0000-0001-9536-5755)
- Chuljin Park (ORCID: https://orcid.org/0000-0001-9447-1281)
Institutions
- Georgia Institute of Technology (US)
- Indiana University Bloomington (US)
- Hanyang University (KR)
Publication Details
- Published
- 2024-12-15
- DOI
- https://doi.org/10.1109/wsc63780.2024.10838993
- Primary Topic
- Scheduling and Optimization Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Science Foundation
- National Research Foundation of Korea