Abstract Search theory is concerned with the problem of locating a hidden object or target (a military target, a mineral deposit, a failed component in an equipment, etc.) with minimal cost or maximal probability subject to various practical constraints. The problem solution results in a plan or strategy of search, indicating where and in what sequence to look for the target. Koopman (1956) who pioneered the basis of the search theory states that ‘ search problems are more general than the problems of linear programming, since the expression to be optimized is nonlinear and involves integration ’. However, despite its generality and practical usefulness, almost all published material in the area emphasizes the theory which gives a false impression of the relevance of the available work to application. In this paper it has been shown that search models can be used for the solution of testing and inspection problems arising in industrial maintenance and quality control, Search models which can be used for t...
[1]
B. O. Koopman.
The Theory of Search. I. Kinematic Bases
,
1956
.
[2]
B. Gluss.
An Optimum Policy for Detecting a Fault in a Complex System
,
1959
.
[3]
Sidney I. Firstman,et al.
Optimum Search Routines for Automatic Fault Location
,
1960
.
[4]
Hylton Boothroyd.
Least-cost Testing Sequence
,
1960
.
[5]
David W. Matula.
A Periodic Optimal Search
,
1964
.
[6]
R. Bellman.
Dynamic programming.
,
1957,
Science.
[7]
Milton C. Chew.
A Sequential Search Procedure
,
1967
.
[8]
James M. Dobbie,et al.
A Survey of Search Theory
,
1968,
Oper. Res..
[9]
J. Kadane.
Discrete search and the Neyman-Pearson Lemma
,
1968
.
[10]
Michael L. Moore.
A REVIEW OF SEARCH AND RECONNAISSANCE THEORY LITERATURE
,
1970
.