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

Institutions

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

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Finding Feasible Systems for a Stochastic Constraint with Relaxed Tolerance Levels

Sigrún Andradóttir, Yuwei Zhou, Seong‐Hee Kim, Chuljin Park
Scheduling and Optimization Algorithms
article

Finding Feasible Systems for a Stochastic Constraint with Relaxed Tolerance Levels

Sigrún Andradóttir, Yuwei Zhou, Seong‐Hee Kim, Chuljin Park
article en

Abstract

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.

Georgia Institute of Technology (US), Indiana University Bloomington (US), Hanyang University (KR)
National Science Foundation, National Research Foundation of Korea
Openalex Percentile: Top 62%
Scheduling and Optimization Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.