A Weighted Constraint Optimization Approach to the Nurse Scheduling Problem

• Tipo: Artigo em Livro de Atas de Conferência Internacional
• Data: 2015

Autores

Diogo Santos (Autor) FEUP; Pedro Fernandes (Autor) FEUP; Henrique Lopes Cardoso (Autor) FEUP; Eugénio Oliveira (Autor) FEUP

Ata de Conferência Internacional

Título: 2015 IEEE 18th International Conference on Computational Science and Engineering

Páginas: 233-239

Indexação

ISI Web of Knowledge - 6 Citações

Scopus - 12 Citações

Classificação Científica

CORDIS: Ciências Tecnológicas > Engenharia > Engenharia de computadores

FOS: Ciências da engenharia e tecnologias > Engenharia electrotécnica, electrónica e informática

Outras Informações

ID Authenticus: P-00K-AM8

DOI: 10.1109/cse.2015.46

Abstract (EN): As a solution proposal for the Second International Nurse Rostering Competition (INRC-II) [1], we introduce in this paper an approach based on the weighted constraint satisfaction problem (WCSP). The WCSP, given a number of constraints (both hard constraints - ones that must not be violated, and soft constraints - ones that influence the degree of optimality of a possible solution) aims to minimize the total weight of all unsatisfied constraints. We propose an heuristic based approach to the WCSP, using a general constraint satisfaction solver whose configuration was specifically adapted to the nurse scheduling problem presented by the INRC-II competition. Several problems were solved using our approach in order to better tweak the heuristic settings, the results of which are presented in this document, as well as the best implementation of the solver found so far.

Idioma: Inglês

Tipo (Avaliação Docente): Científica

Nº de páginas: 7