IDEAS home Printed from https://ideas.repec.org/a/spr/ijsaem/v15y2024i6d10.1007_s13198-024-02252-8.html
   My bibliography  Save this article

Open Jackson queuing networks for waiting time reduction and manpower planning in pharmacy

Author

Listed:
  • Preeti

    (J. C. Bose University of Science and Technology, YMCA)

  • Neetu Gupta

    (J. C. Bose University of Science and Technology, YMCA)

Abstract

This study focuses on determining the optimal staffing levels for maximizing the benefits of a pharmacy. Through experimental methods, including simulation and queuing analysis, the research identifies the ideal number of staff required for efficient pharmacy operations. The study not only addresses workforce planning but also successfully reduces customer waiting times. By selecting a random sample of patients observed over six months, the study derives a distribution that accurately represents arrival and departure patterns, enabling the calculation of key parameters such as arrival and departure rates. Utilizing this data, a discrete event simulation model is developed and compared to results obtained from queuing theoretical methods. The findings highlight the effectiveness of combining a Jackson network in a series queuing configuration with simulation techniques for optimizing hospital pharmacy performance. Ultimately, this research offers valuable insights into harmonizing staffing levels with customer satisfaction, leading to enhanced operational efficiency in pharmacy units.

Suggested Citation

  • Preeti & Neetu Gupta, 2024. "Open Jackson queuing networks for waiting time reduction and manpower planning in pharmacy," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 15(6), pages 2383-2390, June.
    • Handle: RePEc:spr:ijsaem:v:15:y:2024:i:6:d:10.1007_s13198-024-02252-8
    DOI: 10.1007/s13198-024-02252-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13198-024-02252-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/s13198-024-02252-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. Shimshak, Daniel G. & Gropp Damico, Dru & Burden, Hope D., 1981. "A priority queuing model of a hospital pharmacy unit," European Journal of Operational Research, Elsevier, vol. 7(4), pages 350-354, August.
    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. Yang, Xiaopeng & Zheng, Danheng & Sieminowski, Tammy & Paradi, Joseph C., 2015. "A dynamic benchmarking system for assessing the recovery of inpatients: Evidence from the neurorehabilitation process," European Journal of Operational Research, Elsevier, vol. 240(2), pages 582-591.
    2. Di Lin & Jonathan Patrick & Fabrice Labeau, 2014. "Estimating the waiting time of multi-priority emergency patients with downstream blocking," Health Care Management Science, Springer, vol. 17(1), pages 88-99, March.
    3. Pazour, Jennifer A. & Roy, Debjit, 2012. "Minimizing Customer Waiting Costs for Rental Vehicle Providers using Threshold Reservation Policies," IIMA Working Papers WP2012-12-05, Indian Institute of Management Ahmedabad, Research and Publication Department.

    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:ijsaem:v:15:y:2024:i:6:d:10.1007_s13198-024-02252-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.