Infinite-horizon scheduling algorithms for optimal search for hidden objects

Eugene Levner

Research output: Contribution to journalArticlepeer-review

12 Scopus citations

Abstract

This paper considers discrete search problems in which a decision-maker has to find objects lost or hidden in a given set of locations so as to minimize the expected losses incurred. Given a chance to look for a hidden object in the same location infinitely many times, this type of problem, in contrast to standard scheduling problems, has an infinite sequence as its solution. Thus we are concerned to find an algorithm that yields an optimal solution, rather than the optimal sequence itself. Using combinatorial techniques, fast optimal algorithms for solving the problems are obtained, and optimality conditions are presented for search criteria, under which the local-search algorithms yield the global optimum.

Original languageEnglish
Pages (from-to)241-250
Number of pages10
JournalInternational Transactions in Operational Research
Volume1
Issue number2
DOIs
StatePublished - Apr 1994
Externally publishedYes

Keywords

  • combinatorial analysis
  • optimization
  • scheduling
  • search
  • sequencing
  • sequential search policy

Fingerprint

Dive into the research topics of 'Infinite-horizon scheduling algorithms for optimal search for hidden objects'. Together they form a unique fingerprint.

Cite this