Nurse scheduling using integer linear programming and constraint programming
Résumé
In order to reduce cost and to optimize the use of resources, hospitals are prompted to regroup facilities and human resources, especially in the surgical suite. This paper focuses on the anaesthesiology nurse scheduling problem (ANSP) of a French public hospital, where the anaesthesiology nurses constitute one of the most shared resources. They work in a cross way over surgical specialities and assume various activities. Two methods are proposed to solve the ANSP based on integer programming and constraint programming. The objective is to maximize the fairness of the schedule. Theses two techniques are tested in order to be compared.
Origine : Fichiers produits par l'(les) auteur(s)