IDEAS home Printed from https://ideas.repec.org/p/tiu/tiutis/6ef73414-ea29-4dd6-a008-ce6b3f7ca778.html
   My bibliography  Save this paper

Tandem Queues with Impatient Customers for Blood Screening Procedures

Author

Listed:
  • Bar-Lev, S.K.
  • Blanc, J.P.C.

    (Tilburg University, School of Economics and Management)

  • Boxma, O.J.

Abstract

We study a blood testing procedure for detecting viruses like HIV, HBV and HCV. In this procedure, blood samples go through two screening steps. The first test is ELISA (antibody Enzyme Linked Immuno-Sorbent Assay). The portions of blood which are found not contaminated in this first phase are tested in groups through PCR (Polymerase Chain Reaction). The ELISA test is less sensitive than the PCR test and the PCR tests are considerably more expensive. We model the two test phases of blood samples as services in two queues in series; service in the second queue is in batches, as PCR tests are done in groups. The fact that blood can only be used for transfusions until a certain expiration date leads, in the tandem queue, to the feature of customer impatience. Since the first queue basically is an infinite server queue, we mainly focus on the second queue, which in its most general form is an S-server M/G [k, K]/S + G queue, with batches of sizes which are bounded by k and K. Our objective is to maximize the expected profit of the system, which is composed of the amount earned for items which pass the test (and before their patience runs out), minus costs. This is done by an appropriate choice of the decision variables, namely, the batch sizes and the number of servers at the second service station. As will be seen, even the simplest version of the batch queue, the M/M [k, K]/1 + M queue, already gives rise to serious analytical complications for any batch size larger than 1. These complications are discussed in detail, and handled for K = 2. In view of the fact that we aim to solve realistic optimization problems for blood screening procedures, these analytical complications force us to take recourse to either a numerical approach or approximations. We present a numerical solution for the queue length distribution in the M/M [k, K]/S + M queue and then formulate and solve several optimization problems. The power-series algorithm, which is a numerical-analytic method,
(This abstract was borrowed from another version of this item.)

Suggested Citation

  • Bar-Lev, S.K. & Blanc, J.P.C. & Boxma, O.J., 2009. "Tandem Queues with Impatient Customers for Blood Screening Procedures," Other publications TiSEM 6ef73414-ea29-4dd6-a008-c, Tilburg University, School of Economics and Management.
    • Handle: RePEc:tiu:tiutis:6ef73414-ea29-4dd6-a008-ce6b3f7ca778
    as

    Download full text from publisher

    File URL: https://pure.uvt.nl/ws/portalfiles/portal/1169891/blood0211.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Blanc, J.P.C. & van der Mei, R.D., 1992. "Optimization of polling systems with Bernoulli schedules," Other publications TiSEM dd631dbc-d81c-4b05-9539-7, Tilburg University, School of Economics and Management.
    2. Lawrence M. Wein & Stefanos A. Zenios, 1996. "Pooled Testing for HIV Screening: Capturing the Dilution Effect," Operations Research, INFORMS, vol. 44(4), pages 543-569, August.
    3. Bar-Lev, Shaul K. & Parlar, Mahmut & Perry, David & Stadje, Wolfgang & Van der Duyn Schouten, Frank A., 2007. "Applications of bulk queues to group testing models with incomplete identification," European Journal of Operational Research, Elsevier, vol. 183(1), pages 226-237, November.
    4. Shaul K. Bar‐Lev & Wolfgang Stadje & Frank A. Van der Duyn Schouten, 2006. "Group testing procedures with incomplete identification and unreliable testing results," Applied Stochastic Models in Business and Industry, John Wiley & Sons, vol. 22(3), pages 281-296, May.
    5. Lei Zhu & Jacqueline M. Hughes-Oliver & S. Stanley Young, 2001. "Statistical Decoding of Potent Pools Based on Chemical Structure," Biometrics, The International Biometric Society, vol. 57(3), pages 922-930, September.
    6. Robert E. Stanford, 1979. "Reneging Phenomena in Single Channel Queues," Mathematics of Operations Research, INFORMS, vol. 4(2), pages 162-178, May.
    7. Xie M. & Tatsuoka K. & Sacks J. & Young S.S., 2001. "Group Testing With Blockers and Synergism," Journal of the American Statistical Association, American Statistical Association, vol. 96, pages 92-102, March.
    8. Blanc, J.P.C., 1993. "Performance Analysis and Optimization with the Power- Series Algorithm," Papers 9347, Tilburg - Center for Economic Research.
    9. D. Y. Barrer, 1957. "Queuing with Impatient Customers and Indifferent Clerks," Operations Research, INFORMS, vol. 5(5), pages 644-649, October.
    10. Bar-Lev, S.K. & Parlar, M. & Perry, D. & Stadje, W. & van der Duyn Schouten, F.A., 2007. "Applications of bulk queues to group testing models with incomplete identification," Other publications TiSEM 0b1bfa5e-c1e6-43ec-9684-1, Tilburg University, School of Economics and Management.
    11. Shaul K. Bar-Lev & Wolfgang Stadje & Frank A. van der Duyn Schouten, 2004. "Optimal Group Testing with Processing Times and Incomplete Identification," Methodology and Computing in Applied Probability, Springer, vol. 6(1), pages 55-72, March.
    12. Shaul K. Bar‐Lev & Arnon Boneh & David Perry, 1990. "Incomplete identification models for group‐testable items," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(5), pages 647-659, October.
    13. D. Y. Barrer, 1957. "Queuing with Impatient Customers and Ordered Service," Operations Research, INFORMS, vol. 5(5), pages 650-656, October.
    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. Bar-Lev, Shaul K. & Boxma, Onno & Kleiner, Igor & Perry, David & Stadje, Wolfgang, 2017. "Recycled incomplete identification procedures for blood screening," European Journal of Operational Research, Elsevier, vol. 259(1), pages 330-343.
    2. Antonio Di Crescenzo & Barbara Martinucci & Paola Paraggio, 2023. "Vessels Arrival Process and its Application to the SHIP/M/ $$\infty$$ ∞ Queue," Methodology and Computing in Applied Probability, Springer, vol. 25(1), pages 1-33, March.

    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. Bar-Lev, Shaul K. & Boxma, Onno & Kleiner, Igor & Perry, David & Stadje, Wolfgang, 2017. "Recycled incomplete identification procedures for blood screening," European Journal of Operational Research, Elsevier, vol. 259(1), pages 330-343.
    2. Claeys, Dieter & Walraevens, Joris & Laevens, Koenraad & Bruneel, Herwig, 2010. "A queueing model for general group screening policies and dynamic item arrivals," European Journal of Operational Research, Elsevier, vol. 207(2), pages 827-835, December.
    3. Shaul K. Bar‐Lev & Onno Boxma & Andreas Löpker & Wolfgang Stadje & Frank A. Van der Duyn Schouten, 2012. "Group testing procedures with quantitative features and incomplete identification," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(1), pages 39-51, February.
    4. Yoshiaki Inoue & Onno Boxma & David Perry & Shelley Zacks, 2018. "Analysis of $$\hbox {M}^{\mathrm {x}}/\hbox {G}/1$$ M x / G / 1 queues with impatient customers," Queueing Systems: Theory and Applications, Springer, vol. 89(3), pages 303-350, August.
    5. Shaul K. Bar-Lev & Onno Boxma & Wolfgang Stadje & Frank A. Duyn Schouten, 2010. "A Two-Stage Group Testing Model for Infections with Window Periods," Methodology and Computing in Applied Probability, Springer, vol. 12(3), pages 309-322, September.
    6. Yongxi Cheng & Ding-Zhu Du & Yinfeng Xu, 2014. "A Zig-Zag Approach for Competitive Group Testing," INFORMS Journal on Computing, INFORMS, vol. 26(4), pages 677-689, November.
    7. Yongxi Cheng & Ding-Zhu Du & Feifeng Zheng, 2015. "A new strongly competitive group testing algorithm with small sequentiality," Annals of Operations Research, Springer, vol. 229(1), pages 265-286, June.
    8. S. Pradhan & U.C. Gupta & S.K. Samanta, 2016. "Queue-length distribution of a batch service queue with random capacity and batch size dependent service: M / G r Y / 1 $M/{G^{Y}_{r}}/1$," OPSEARCH, Springer;Operational Research Society of India, vol. 53(2), pages 329-343, June.
    9. Eliran Sherzer & Yoav Kerner, 2018. "Customers’ abandonment strategy in an M / G / 1 queue," Queueing Systems: Theory and Applications, Springer, vol. 90(1), pages 65-87, October.
    10. Bar-Lev, S.K. & Parlar, M. & Perry, D. & Stadje, W. & van der Duyn Schouten, F.A., 2007. "Applications of bulk queues to group testing models with incomplete identification," Other publications TiSEM 0b1bfa5e-c1e6-43ec-9684-1, Tilburg University, School of Economics and Management.
    11. W. Rogiest & K. Laevens & J. Walraevens & H. Bruneel, 2015. "Random-order-of-service for heterogeneous customers: waiting time analysis," Annals of Operations Research, Springer, vol. 226(1), pages 527-550, March.
    12. S. K. Samanta & R. Nandi, 2021. "Queue-Length, Waiting-Time and Service Batch Size Analysis for the Discrete-Time GI/D-MSP (a,b) / 1 / ∞ $^{\text {(a,b)}}/1/\infty $ Queueing System," Methodology and Computing in Applied Probability, Springer, vol. 23(4), pages 1461-1488, December.
    13. H. Christian Gromoll & Philippe Robert & Bert Zwart, 2008. "Fluid Limits for Processor-Sharing Queues with Impatience," Mathematics of Operations Research, INFORMS, vol. 33(2), pages 375-402, May.
    14. Yu, Miaomiao & Alfa, Attahiru Sule, 2015. "Algorithm for computing the queue length distribution at various time epochs in DMAP/G(1, a, b)/1/N queue with batch-size-dependent service time," European Journal of Operational Research, Elsevier, vol. 244(1), pages 227-239.
    15. Gopinath Panda & Veena Goswami, 2023. "Analysis of a Discrete-time Queue with Modified Batch Service Policy and Batch-size-dependent Service," Methodology and Computing in Applied Probability, Springer, vol. 25(1), pages 1-18, March.
    16. Shaul K. Bar-Lev & Wolfgang Stadje & Frank A. van der Duyn Schouten, 2004. "Optimal Group Testing with Processing Times and Incomplete Identification," Methodology and Computing in Applied Probability, Springer, vol. 6(1), pages 55-72, March.
    17. James J. Kim & Douglas G. Down & Mohan Chaudhry & Abhijit Datta Banik, 2022. "Difference Equations Approach for Multi-Server Queueing Models with Removable Servers," Methodology and Computing in Applied Probability, Springer, vol. 24(3), pages 1297-1321, September.
    18. Walid Nasrallah & Raymond Levitt & Peter Glynn, 2003. "Interaction Value Analysis: When Structured Communication Benefits Organizations," Organization Science, INFORMS, vol. 14(5), pages 541-557, October.
    19. Blanc, J.P.C., 1996. "Optimization of Periodic Polling Systems with Non-Preemptive, Time-Limited Service," Other publications TiSEM 2cdebb4d-bb27-44a9-b3c4-1, Tilburg University, School of Economics and Management.
    20. Srinivas R. Chakravarthy & Shruti & Alexander Rumyantsev, 2021. "Analysis of a Queueing Model with Batch Markovian Arrival Process and General Distribution for Group Clearance," Methodology and Computing in Applied Probability, Springer, vol. 23(4), pages 1551-1579, December.

    More about this item

    Statistics

    Access and download statistics

    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:tiu:tiutis:6ef73414-ea29-4dd6-a008-ce6b3f7ca778. 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: Richard Broekman (email available below). General contact details of provider: https://www.tilburguniversity.edu/about/schools/economics-and-management/ .

    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.