Mostrar el registro sencillo del ítem

Nurse and paramedic rostering with constraint programming: A case study

dc.contributor.authorSoto R.
dc.contributor.authorCrawford B.
dc.contributor.authorMonfroy E.
dc.contributor.authorPalma W.
dc.contributor.authorParedes F.
dc.date.accessioned2020-09-02T22:28:42Z
dc.date.available2020-09-02T22:28:42Z
dc.date.issued2013
dc.identifier.citation16, 1, 52-64
dc.identifier.issn14538245
dc.identifier.urihttps://hdl.handle.net/20.500.12728/6312
dc.descriptionThe nurse rostering problem consists in generating a configuration of daily schedules for a set of nurses satisfying a set of constraints. The problem is known to be computationally challenging as it must consider different requirements such as minimal area or floor allocations, different skills, working regulations, as well as personnel wishes. The literature presents several successful work devoted to this problem, however there still is limited evidence about real cases of nurse rostering, in particular solved with constraint programming. The aim of this paper is to illustrate a real case study involving the design of a constraint programming solution for nurse rostering. The solution is devoted to a set of mid-size Chilean hospitals where nurse rostering is done manually using a very uncommon shift sequence called the "fourth shift" system. We present a classic model and a global constraint-based model that can be applied generically to any fourth shift health care center.
dc.language.isoen
dc.subjectConstraint Programming
dc.subjectHeuristic Search.
dc.subjectRostering
dc.titleNurse and paramedic rostering with constraint programming: A case study
dc.typeArticle


Ficheros en el ítem

Thumbnail
Nombre:
item_2-s2.0-84890728674.pdf
Tamaño:
2.037Kb
Formato:
PDF
Ver/

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem