IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v253y2017i1d10.1007_s10479-016-2345-7.html
   My bibliography  Save this article

Sequential testing in batches

Author

Listed:
  • Rebi Daldal

    (Sabanci University)

  • Özgür Özlük

    (MEF University)

  • Barış Selçuk

    (Bahcesehir University)

  • Zahed Shahmoradi

    (Sabanci University)

  • Tonguç Ünlüyurt

    (Sabanci University)

Abstract

We study a new extension of the Sequential Testing problem with a modified cost structure that allows performing of some tests in batches. As in the Sequential Testing problem, we assume a certain dependence between the test results and the conclusion. Namely, we stop testing once a positive result is obtained or all tests are negative. Our extension, motivated by health care applications, considers a fixed cost associated with executing a batch of tests, with the general notion that the more tests are performed in batches, the smaller the total contribution of fixed costs to the sequential testing process. The goal is to minimize the expected cost of testing by finding the optimal choice and sequence of the batches available. The resulting NP-hard model is a variation of the set partitioning problem. We propose various heuristic algorithms for the effective solution of the problem and then demonstrate the performances of the algorithms through extensive numerical experiments.

Suggested Citation

  • Rebi Daldal & Özgür Özlük & Barış Selçuk & Zahed Shahmoradi & Tonguç Ünlüyurt, 2017. "Sequential testing in batches," Annals of Operations Research, Springer, vol. 253(1), pages 97-116, June.
    • Handle: RePEc:spr:annopr:v:253:y:2017:i:1:d:10.1007_s10479-016-2345-7
    DOI: 10.1007/s10479-016-2345-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-016-2345-7
    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/s10479-016-2345-7?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. Mohan Gopalakrishnan & Sanjay L. Ahire & David M. Miller, 1997. "Maximizing the Effectiveness of a Preventive Maintenance System: An Adaptive Modeling Approach," Management Science, INFORMS, vol. 43(6), pages 827-840, June.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Agnetis, Alessandro & Hermans, Ben & Leus, Roel & Rostami, Salim, 2022. "Time-critical testing and search problems," European Journal of Operational Research, Elsevier, vol. 296(2), pages 440-452.

    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. Nima Safaei & Dragan Banjevic & Andrew Jardine, 2011. "Workforce-constrained maintenance scheduling for military aircraft fleet: a case study," Annals of Operations Research, Springer, vol. 186(1), pages 295-316, June.
    2. Rustogi, Kabir & Strusevich, Vitaly A., 2012. "Single machine scheduling with general positional deterioration and rate-modifying maintenance," Omega, Elsevier, vol. 40(6), pages 791-804.
    3. Yuqian Xu & Lingjiong Zhu & Michael Pinedo, 2020. "Operational Risk Management: A Stochastic Control Framework with Preventive and Corrective Controls," Operations Research, INFORMS, vol. 68(6), pages 1804-1825, November.
    4. N Safaei & D Banjevic & A K S Jardine, 2011. "Bi-objective workforce-constrained maintenance scheduling: a case study," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(6), pages 1005-1018, June.
    5. M. A. Kubzin & V. A. Strusevich, 2006. "Planning Machine Maintenance in Two-Machine Shop Scheduling," Operations Research, INFORMS, vol. 54(4), pages 789-800, August.

    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:annopr:v:253:y:2017:i:1:d:10.1007_s10479-016-2345-7. 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.