IRMA-International.org: Creator of Knowledge
Information Resources Management Association
Advancing the Concepts & Practices of Information Resources Management in Modern Organizations

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

An Efficient Batch Scheduling Model for Hospital Sterilization Services Using Genetic Algorithm
View Sample PDF
Author(s): Shubin Xu (College of Business and Management, Northeastern Illinois University, Chicago, USA)and John Wang (School of Business, Montclair State University, Upper Montclair, USA)
Copyright: 2021
Pages: 19
Source title: Research Anthology on Multi-Industry Uses of Genetic Programming and Algorithms
Source Author(s)/Editor(s): Information Resources Management Association (USA)
DOI: 10.4018/978-1-7998-8048-6.ch047

Purchase

View An Efficient Batch Scheduling Model for Hospital Sterilization Services Using Genetic Algorithm on the publisher's website for pricing and purchasing information.

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.

Related Content

Shailendra Aote, Mukesh M. Raghuwanshi. © 2021. 34 pages.
Anjana Mishra, Bighnaraj Naik, Suresh Kumar Srichandan. © 2021. 15 pages.
Thendral Puyalnithi, Madhuviswanatham Vankadara. © 2021. 15 pages.
Geng Zhang, Xiansheng Gong, Xirui Chen. © 2021. 13 pages.
Jhuma Ray, Siddhartha Bhattacharyya, N. Bhupendro Singh. © 2021. 19 pages.
Pijush Samui, Viswanathan R., Jagan J., Pradeep U. Kurup. © 2021. 18 pages.
Ravinesh C. Deo, Sujan Ghimire, Nathan J. Downs, Nawin Raj. © 2021. 32 pages.
Body Bottom