IDEAS home Printed from https://ideas.repec.org/a/spr/jsched/v25y2022i2d10.1007_s10951-021-00712-8.html
   My bibliography  Save this article

Further connections between contract-scheduling and ray-searching problems

Author

Listed:
  • Spyros Angelopoulos

    (Sorbonne Université, CNRS)

Abstract

This paper addresses two classes of different, yet interrelated optimization problems. The first class of problems involves a mobile searcher that must locate a hidden target in an environment that consists of a set of unbounded, concurrent rays. The second class pertains to the design of interruptible algorithms by means of a schedule of contract algorithms. Both types of problems capture fundamental aspects of resource allocation under uncertainty. We study several variants of these families of problems, such as searching and scheduling with probabilistic considerations, redundancy and fault-tolerance issues, randomized strategies, and trade-offs between performance and preemptions. For many of these problems, we present the first known results that apply to multi-ray and multi-problem domains. Our objective is to demonstrate that several well-motivated settings can be addressed using the same underlying approach.

Suggested Citation

  • Spyros Angelopoulos, 2022. "Further connections between contract-scheduling and ray-searching problems," Journal of Scheduling, Springer, vol. 25(2), pages 139-155, April.
    • Handle: RePEc:spr:jsched:v:25:y:2022:i:2:d:10.1007_s10951-021-00712-8
    DOI: 10.1007/s10951-021-00712-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10951-021-00712-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10951-021-00712-8?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Steve Alpern & Thomas Lidbetter, 2013. "Mining Coal or Finding Terrorists: The Expanding Search Paradigm," Operations Research, INFORMS, vol. 61(2), pages 265-279, April.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Robbert Fokkink & Ken Kikuta & David Ramsey, 2017. "The search value of a set," Annals of Operations Research, Springer, vol. 256(1), pages 63-73, September.
    2. Steve Alpern & Thomas Lidbetter, 2014. "Searching a Variable Speed Network," Mathematics of Operations Research, INFORMS, vol. 39(3), pages 697-711, August.
    3. Liu, Dehai & Xiao, Xingzhi & Li, Hongyi & Wang, Weiguo, 2015. "Historical evolution and benefit–cost explanation of periodical fluctuation in coal mine safety supervision: An evolutionary game analysis framework," European Journal of Operational Research, Elsevier, vol. 243(3), pages 974-984.
    4. Steven M. Shechter & Farhad Ghassemi & Yasin Gocgun & Martin L. Puterman, 2015. "Technical Note—Trading Off Quick versus Slow Actions in Optimal Search," Operations Research, INFORMS, vol. 63(2), pages 353-362, April.
    5. Vic Baston & Kensaku Kikuta, 2015. "Search games on a network with travelling and search costs," International Journal of Game Theory, Springer;Game Theory Society, vol. 44(2), pages 347-365, May.
    6. Steve Alpern & Thomas Lidbetter, 2019. "Approximate solutions for expanding search games on general networks," Annals of Operations Research, Springer, vol. 275(2), pages 259-279, April.
    7. Yolmeh, Abdolmajid & Baykal-Gürsoy, Melike, 2021. "Weighted network search games with multiple hidden objects and multiple search teams," European Journal of Operational Research, Elsevier, vol. 289(1), pages 338-349.
    8. Robbert Fokkink & Thomas Lidbetter & László A. Végh, 2019. "On Submodular Search and Machine Scheduling," Management Science, INFORMS, vol. 44(4), pages 1431-1449, November.
    9. Lidbetter, Thomas, 2020. "Search and rescue in the face of uncertain threats," European Journal of Operational Research, Elsevier, vol. 285(3), pages 1153-1160.
    10. Tianyu Wang & Igor Averbakh, 2022. "Network construction/restoration problems: cycles and complexity," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 51-73, August.
    11. Alpern, Steve & Lidbetter, Thomas, 2020. "Search and Delivery Man Problems: When are depth-first paths optimal?," European Journal of Operational Research, Elsevier, vol. 285(3), pages 965-976.
    12. Bui, Thuy & Lidbetter, Thomas, 2023. "Optimal patrolling strategies for trees and complete networks," European Journal of Operational Research, Elsevier, vol. 311(2), pages 769-776.
    13. Lidbetter, Thomas, 2017. "On the approximation ratio of the Random Chinese Postman Tour for network search," European Journal of Operational Research, Elsevier, vol. 263(3), pages 782-788.
    14. Ben Hermans & Roel Leus & Jannik Matuschke, 2022. "Exact and Approximation Algorithms for the Expanding Search Problem," INFORMS Journal on Computing, INFORMS, vol. 34(1), pages 281-296, January.
    15. Angelopoulos, Spyros & Lidbetter, Thomas, 2020. "Competitive search in a network," European Journal of Operational Research, Elsevier, vol. 286(2), pages 781-790.
    16. Vassili Kolokoltsov, 2017. "The Evolutionary Game of Pressure (or Interference), Resistance and Collaboration," Mathematics of Operations Research, INFORMS, vol. 42(4), pages 915-944, November.
    17. Hellerstein, Lisa & Lidbetter, Thomas, 2023. "A game theoretic approach to a problem in polymatroid maximization," European Journal of Operational Research, Elsevier, vol. 305(2), pages 979-988.
    18. Bui, Thuy & Lidbetter, Thomas & Lin, Kyle Y., 2024. "Optimal pure strategies for a discrete search game," European Journal of Operational Research, Elsevier, vol. 313(2), pages 767-775.
    19. Ben Hermans & Herbert Hamers & Roel Leus & Roy Lindelauf, 2019. "Timely exposure of a secret project: Which activities to monitor?," Naval Research Logistics (NRL), John Wiley & Sons, vol. 66(6), pages 451-468, September.
    20. Steve Alpern & Thomas Lidbetter, 2015. "Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object," Operations Research, INFORMS, vol. 63(1), pages 122-133, February.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jsched:v:25:y:2022:i:2:d:10.1007_s10951-021-00712-8. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.