Detection Model With a Maximum Discounted Effort Reward Search to Maintenance a Best Decision Under the Quality Control Process

Abstract

This paper aims to get a needed service by making the best decision of choosing one suitable company (queue) from K − independent Markovian queues (companies). The customers arrive at each queue according to a Poisson process. The service time of each customer has an exponential distribution. In a steady-state, the best decision depends on the minimum cost of detecting the suitable company which provides the best service with high speed (maximum service rate). To minimize the detection cost and maximize the probability of detection, we consider the search effort bounded by a Gaussian distribution as a function with a discounted parameter. The effectiveness of this model appears in a simulation study and the comparison with other models.

On Probabilistic Cooperative Search Model to Detect a Lost Target in N-Disjoint Areas

“…They formulated a search model and found the conditions that make this search strategy finite. For more interesting search strategies that find the randomly moving target, see El-Hadidy et al [14][15][16][17][19][20][21][22][23][24][25][26][27][28][29][30][31][32][33][34][35][36][37]. In this paper, we extend the theory of the coordinated search to n-regions by using n-searchers.…”

A probabilistic early fault detection model for a feedback machining system with multiple types of spares

“…There are different models to detect this damage (target), which appeared in the optimal search theory. El-Hadidy et al 20 – 47 provided different search techniques to detect the lost target on the line, the plane, and the space. They aimed to detect the target in the minimum amount of time and with the maximum detection probability.…”