Nurse scheduling using integer linear programming and constraint programming - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2006

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.
Fichier principal
Vignette du fichier
Trilling_Guinet_Lemagny_INCOM_2006.pdf (155.21 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00173072 , version 1 (18-09-2007)

Identifiants

  • HAL Id : hal-00173072 , version 1

Citer

Lorraine Trilling, Alain Guinet, Dominique Le Magny. Nurse scheduling using integer linear programming and constraint programming. 12th IFAC Symposium on Information Control Problems in Manufacturing INCOM 2006, Sep 2007, Saint-Etienne, France. pp.651-656. ⟨hal-00173072⟩
315 Consultations
6443 Téléchargements

Partager

Gmail Facebook X LinkedIn More