Infinite-horizon scheduling algorithms for optimal search for hidden objects

DOI10.1016/0969-6016(94)90023-XzbMath0854.90084OpenAlexW2000933413MaRDI QIDQ4888233

Eugene Levner

Publication date: 19 January 1997

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0969-6016(94)90023-x

zbMATH Keywords

schedulingsequencingcombinatorial analysisdiscrete searchhidden objectminimize the expected lossessequential search policy

Mathematics Subject Classification ID

Search theory (90B40) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Scheduling an autonomous robot searching for hidden targets ⋮ Optimal capacity and operation of deteriorating chemical production service facilities

This page was built for publication: Infinite-horizon scheduling algorithms for optimal search for hidden objects