Infinite-horizon scheduling algorithms for optimal search for hidden objects

DOI10.1016/0969-6016(94)90023-XMaRDI QIDQ4888233zbMATH OpenOpenAlexFDO

Authors 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

combinatorial analysisdiscrete searchhidden objectminimize the expected lossesschedulingsequencingsequential search policy

Mathematics Subject Classification ID

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

Recommendations

• Optimal search for one of many objects hidden in two boxes
• The discrete search problem and the construction of optimal allocations
• Optimal search with time-dependent detection rate functions
• Dynamic search for a moving target
• scientific article; zbMATH DE number 7271257

Cited in

(2)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4888233)