Heuristic approch for solving the makespan problem in a hospital sterilization service - Université Polytechnique des Hauts-de-France Access content directly
Conference Papers Year :

Heuristic approch for solving the makespan problem in a hospital sterilization service

Abstract

In this work, we focus on the study of a scheduling problem that arises in the sterilization services in hospitals. The main role of a sterilization service is the disinfection of the reusable medical devices used in surgical operation rooms. Sterilization process has a well-defined cycle and it consists of the following steps: washing, cleaning, checking, packaging, and sterilization. Some of these steps are processed manually and others are processed on special machines. We propose a variable neighborhood descent based heuristic to minimize the makespan of the tasks processed manually on the sterilization services in the hospital 'Jolimont'. Benchmarks based on data from hospitals are generated and computational experiments are done
No file

Dates and versions

hal-03663744 , version 1 (10-05-2022)

Identifiers

Cite

Amal Soufi, Anis Mjirda, Mourad Abed. Heuristic approch for solving the makespan problem in a hospital sterilization service. 2014 International Conference on Advanced Logistics and Transport (ICALT), May 2014, Hammamet, Tunisia. pp.179-183, ⟨10.1109/ICAdLT.2014.6864114⟩. ⟨hal-03663744⟩
8 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More