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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

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


    Contributors:
    Soufi, Amal (author) / Mjirda, Anis (author) / Mourad, Abed (author)


    Publication date :

    2014-05-01


    Size :

    3684224 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    Diagnosis of Satellites -Top-Down Approch-

    Iwata, T. / Motomura, Y. / Machida, K. | British Library Conference Proceedings | 2002


    Modular Robotic System - A Concurrent Engineering Approch

    Bizdoaca, N. / Petrisor, A. / Bizdoaca, E. et al. | British Library Conference Proceedings | 2008


    Heuristic Algorithm for Solving a Multimodal Location-Based Concierge Service Problem

    Kang, S. / Oh, S. / Kim, T. J. et al. | British Library Conference Proceedings | 2006