IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v272y2024ics0925527324000896.html
   My bibliography  Save this article

Flexible serial capacity allocation with intensive care application

Author

Listed:
  • van Dijk, N.M.
  • van der Sluis, E.
  • Bulder, L.N.
  • Cui, Y.

Abstract

Serial delay structures are of natural and practical interest, as in production, communications and health care. Flexible service allocation might well be beneficial, particularly to handle overflow. The availability of bed capacity for Intensive Care (IC) provision was prominent in hospitals during the corona period. By integrating an Intensive Care Unit (ICU) with a flexible Step Down Unit (SDU) for intensive care overflow, IC availability might be greatly enhanced. This will lead to an unsolvable system that has to be evaluated by numerical computation (or simulation). First, as an approximate modeling and from a computational point of view, it is shown that by an artificial capacity flexibility principle, related to a principle known for parallel structures within telecommunications, an analytic so-called product form expression can be obtained for a flexible serial structure, such as an ICU-SDU complex. The principle will be referred to as serial repositioning (SR). The analytic form appears to be of both theoretical and computational interest. Theoretical as the closed form expression under this principle seems new for a serial structure. For indistinguishable intensive care at the ICU and SDU it is also proven to be insensitive, i.e. to only depend on the IC service by its mean. Computational as it provides easily computable estimates and bounds. For distinguishable overflow services, in contrast, insensitivity is numerically shown not to hold. Nevertheless, from a practical point of view, the insensitivity appears virtually true. Throughout numerical support is provided for small and realistic scale. It shows that the result •provides a reasonable first order of magnitude approximate,•supports an intuitive notion of bounds,•strongly reduces computational times and leads to qualitative results. For example, it shows that full flexibility for overflow service might be most useful but not necessarily required. A reallife academic hospital case is numerically studied. It illustrates that just a small number of flexible beds can well be beneficial. The results can be seen as representative for ICU-SDU dimensioning itself as well as for possible application to other serial structures, such as in flexible manufacturing.

Suggested Citation

  • van Dijk, N.M. & van der Sluis, E. & Bulder, L.N. & Cui, Y., 2024. "Flexible serial capacity allocation with intensive care application," International Journal of Production Economics, Elsevier, vol. 272(C).
  • Handle: RePEc:eee:proeco:v:272:y:2024:i:c:s0925527324000896
    DOI: 10.1016/j.ijpe.2024.109232
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925527324000896
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ijpe.2024.109232?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. David D. Yao & J. A. Buzacott, 1987. "Modeling a Class of Flexible Manufacturing Systems with Reversible Routing," Operations Research, INFORMS, vol. 35(1), pages 87-93, February.
    2. J. P. van der Gaast & M. B. M. de Koster & I. J. B. F. Adan, 2018. "Conveyor Merges in Zone Picking Systems: A Tractable and Accurate Approximate Model," Service Science, INFORMS, vol. 52(6), pages 1428-1443, December.
    3. Tsekouras, Kostas & Papathanassopoulos, Fotis & Kounetas, Kostas & Pappous, Giorgos, 2010. "Does the adoption of new technology boost productive efficiency in the public sector? The case of ICUs system," International Journal of Production Economics, Elsevier, vol. 128(1), pages 427-433, November.
    4. B. Pittel, 1979. "Closed Exponential Networks of Queues with Saturation: The Jackson-Type Stationary Distribution and Its Asymptotic Analysis," Mathematics of Operations Research, INFORMS, vol. 4(4), pages 357-378, November.
    5. N M van Dijk & E van der Sluis, 2008. "Bounds for simulation," Journal of Simulation, Taylor & Francis Journals, vol. 2(1), pages 61-65, March.
    6. Hordijk, A. & Schassberger, R., 1982. "Weak convergence for generalized semi-Markov processes," Stochastic Processes and their Applications, Elsevier, vol. 12(3), pages 271-291, May.
    7. James R. Jackson, 1957. "Networks of Waiting Lines," Operations Research, INFORMS, vol. 5(4), pages 518-521, August.
    8. P. G. Taylor, 2011. "Insensitivity in Stochastic Models," International Series in Operations Research & Management Science, in: Richard J. Boucherie & Nico M. Dijk (ed.), Queueing Networks, chapter 0, pages 121-140, Springer.
    9. Nico van Dijk & Erik van der Sluis, 2002. "Simple Product-Form Bounds for Queueing Networks with Finite Clusters," Annals of Operations Research, Springer, vol. 113(1), pages 175-195, July.
    10. Ma, Xin & Zhao, Xue & Guo, Pengfei, 2022. "Cope with the COVID-19 pandemic: Dynamic bed allocation and patient subsidization in a public healthcare system," International Journal of Production Economics, Elsevier, vol. 243(C).
    11. Navid Izady & Israa Mohamed, 2021. "A Clustered Overflow Configuration of Inpatient Beds in Hospitals," Manufacturing & Service Operations Management, INFORMS, vol. 23(1), pages 139-154, 1-2.
    12. Dijk, N.M. van, 1988. "On Jackson's product form with 'jump-over' blocking," Serie Research Memoranda 0004, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    13. Golmohammadi, Davood, 2016. "Predicting hospital admissions to reduce emergency department boarding," International Journal of Production Economics, Elsevier, vol. 182(C), pages 535-544.
    14. Mor Armony & Carri W. Chan & Bo Zhu, 2018. "Critical Care Capacity Management: Understanding the Role of a Step Down Unit," Production and Operations Management, Production and Operations Management Society, vol. 27(5), pages 859-883, May.
    15. James R. Jackson, 1963. "Jobshop-Like Queueing Systems," Management Science, INFORMS, vol. 10(1), pages 131-142, October.
    16. Nico M. van Dijk & Masakiyo Miyazawa, 2004. "Error Bounds for Perturbing Nonexponential Queues," Mathematics of Operations Research, INFORMS, vol. 29(3), pages 525-558, August.
    17. Yin-Chi Chan & Eric W. M. Wong & Gavin Joynt & Paul Lai & Moshe Zukerman, 2018. "Overflow models for the admission of intensive care patients," Health Care Management Science, Springer, vol. 21(4), pages 554-572, December.
    18. Peter J H Hulshof & Nikky Kortbeek & Richard J Boucherie & Erwin W Hans & Piet J M Bakker, 2012. "Taxonomic classification of planning decisions in health care: a structured review of the state of the art in OR/MS," Health Systems, Taylor & Francis Journals, vol. 1(2), pages 129-175, December.
    19. Dervaux, B. & Leleu, H. & Minvielle, E. & Valdmanis, V. & Aegerter, P. & Guidet, B., 2009. "Performance of French intensive care units: A directional distance function approach at the patient level," International Journal of Production Economics, Elsevier, vol. 120(2), pages 585-594, August.
    20. Litvak, Nelly & van Rijsbergen, Marleen & Boucherie, Richard J. & van Houdenhoven, Mark, 2008. "Managing the overflow of intensive care patients," European Journal of Operational Research, Elsevier, vol. 185(3), pages 998-1010, March.
    21. Peter J. H. Hulshof & Martijn R. K. Mes & Richard J. Boucherie & Erwin W. Hans, 2016. "Patient admission planning using Approximate Dynamic Programming," Flexible Services and Manufacturing Journal, Springer, vol. 28(1), pages 30-61, June.
    22. Asaduzzaman, Md & Chaussalet, Thierry J., 2014. "Capacity planning of a perinatal network with generalised loss network model with overflow," European Journal of Operational Research, Elsevier, vol. 232(1), pages 178-185.
    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. Nico Dijk & Barteld Schilstra, 2022. "On two product form modifications for finite overflow systems," Annals of Operations Research, Springer, vol. 310(2), pages 519-549, March.
    2. Samantha L. Zimmerman & Alexander R. Rutherford & Alexa Waall & Monica Norena & Peter Dodek, 2023. "A queuing model for ventilator capacity management during the COVID-19 pandemic," Health Care Management Science, Springer, vol. 26(2), pages 200-216, June.
    3. Dijk, N.M. van, 1989. "On 'stop=repeat' servicing for non-exponential queueing networks with blocking," Serie Research Memoranda 0023, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    4. J. P. van der Gaast & M. B. M. de Koster & I. J. B. F. Adan, 2018. "Conveyor Merges in Zone Picking Systems: A Tractable and Accurate Approximate Model," Service Science, INFORMS, vol. 52(6), pages 1428-1443, December.
    5. Boucherie, R.J. & Dijk, N.M. van, 1989. "Product forms for queueing networks with state dependent multiple job transitions," Serie Research Memoranda 0022, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    6. Yanting Chen & Jingui Xie & Taozeng Zhu, 2023. "Overflow in systems with two servers: the negative consequences," Flexible Services and Manufacturing Journal, Springer, vol. 35(3), pages 838-863, September.
    7. Francisco Castro & Hamid Nazerzadeh & Chiwei Yan, 2020. "Matching queues with reneging: a product form solution," Queueing Systems: Theory and Applications, Springer, vol. 96(3), pages 359-385, December.
    8. Yuta Kanai & Hideaki Takagi, 2021. "Markov chain analysis for the neonatal inpatient flow in a hospital," Health Care Management Science, Springer, vol. 24(1), pages 92-116, March.
    9. Sauer Cornelia & Daduna Hans, 2003. "Availability Formulas and Performance Measures for Separable Degradable Networks," Stochastics and Quality Control, De Gruyter, vol. 18(2), pages 165-194, January.
    10. Flötteröd, G. & Osorio, C., 2017. "Stochastic network link transmission model," Transportation Research Part B: Methodological, Elsevier, vol. 102(C), pages 180-209.
    11. Papadopoulos, H. T. & Heavey, C., 1996. "Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines," European Journal of Operational Research, Elsevier, vol. 92(1), pages 1-27, July.
    12. Morabito, Reinaldo & de Souza, Mauricio C. & Vazquez, Mariana, 2014. "Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks," European Journal of Operational Research, Elsevier, vol. 232(3), pages 618-629.
    13. Sumi Kim & Seongmoon Kim, 2015. "Differentiated waiting time management according to patient class in an emergency care center using an open Jackson network integrated with pooling and prioritizing," Annals of Operations Research, Springer, vol. 230(1), pages 35-55, July.
    14. John S. Hollywood, 2005. "An approximate planning model for distributed computing networks," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(6), pages 590-605, September.
    15. Dijk, N.M. van, 1989. "Product forms for queueing networks with limited clusters," Serie Research Memoranda 0029, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    16. Kurt M. Bretthauer, 2000. "Optimal service and arrival rates in Jackson queueing networks," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(1), pages 1-17, February.
    17. Haskose, A. & Kingsman, B. G. & Worthington, D, 2004. "Performance analysis of make-to-order manufacturing systems under different workload control regimes," International Journal of Production Economics, Elsevier, vol. 90(2), pages 169-186, July.
    18. Dijk, N.M. van, 1991. "Product forms for queueing networks with limited clusters," Serie Research Memoranda 0013, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    19. Osorio, Carolina & Wang, Carter, 2017. "On the analytical approximation of joint aggregate queue-length distributions for traffic networks: A stationary finite capacity Markovian network approach," Transportation Research Part B: Methodological, Elsevier, vol. 95(C), pages 305-339.
    20. D Worthington, 2009. "Reflections on queue modelling from the last 50 years," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 83-92, May.

    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:eee:proeco:v:272:y:2024:i:c:s0925527324000896. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/ijpe .

    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.