IDEAS home Printed from https://ideas.repec.org/a/igg/jsds00/v9y2018i1p1-17.html
   My bibliography  Save this article

An Efficient Batch Scheduling Model for Hospital Sterilization Services Using Genetic Algorithm

Author

Listed:
  • Shubin Xu

    (College of Business and Management, Northeastern Illinois University, Chicago, USA)

  • John Wang

    (School of Business, Montclair State University, Upper Montclair, USA)

Abstract

A major challenge faced by hospitals is to provide efficient medical services. The problem studied in this article is motivated by the hospital sterilization services where the washing step generally constitutes a bottleneck in the sterilization services. Therefore, an efficient scheduling of the washing operations to reduce flow time and work-in-process inventories is of great concern to management. In the washing step, different sets of reusable medical devices may be washed together as long as the washer capacity is not exceeded. Thus, the washing step is modeled as a batch scheduling problem where washers have nonidentical capacities and reusable medical device sets have different sizes and different ready times. The objective is to minimize the sum of completion times for washing operations. The problem is first formulated as a nonlinear integer programming model. Given that this problem is NP-hard, a genetic algorithm is then proposed to heuristically solve the problem. Computational experiments show that the proposed algorithm is capable of consistently obtaining high-quality solutions in short computation times.

Suggested Citation

  • Shubin Xu & John Wang, 2018. "An Efficient Batch Scheduling Model for Hospital Sterilization Services Using Genetic Algorithm," International Journal of Strategic Decision Sciences (IJSDS), IGI Global, vol. 9(1), pages 1-17, January.
  • Handle: RePEc:igg:jsds00:v:9:y:2018:i:1:p:1-17
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJSDS.2018010101
    Download Restriction: no
    ---><---

    Citations

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


    Cited by:

    1. Zhang, Han & Li, Kai & Jia, Zhao-hong & Chu, Chengbin, 2023. "Minimizing total completion time on non-identical parallel batch machines with arbitrary release times using ant colony optimization," European Journal of Operational Research, Elsevier, vol. 309(3), pages 1024-1046.

    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:igg:jsds00:v:9:y:2018:i:1:p:1-17. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.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.