Show simple item record

dc.contributor.authorSoto R.
dc.contributor.authorCrawford B.
dc.contributor.authorBertrand R.
dc.contributor.authorMonfroy E.
dc.date.accessioned2020-09-02T22:28:39Z
dc.date.available2020-09-02T22:28:39Z
dc.date.issued2013
dc.identifier.citation1, , 430-435
dc.identifier.urihttps://hdl.handle.net/20.500.12728/6290
dc.descriptionNurse rostering deals with the shifts arrangements of nursing staff in the daily operation of health care centers. The design of suitable rosters for nurses is known to be particularly complex due to the number of interrelated requirements that must be considered. The literature reports a wide list of works devoted to solve such a problem. The techniques used range from classic methods such as linear programming to more modern incomplete methods such as evolutionary computing. However, most works are centered on the performance of techniques for solving well-known instances of nurse rostering. In this paper, we focus on a real case study of nurse rostering. The solution is devoted to a set of mid-size Chilean hospitals that use a very uncommon shift pattern due to proper country legal regulations. We present a new model involving hard and soft constraints that can be applied generically to any chilean health care center.
dc.language.isoen
dc.subjectConstraint programming
dc.subjectHeuristic search
dc.subjectRostering
dc.subjectConstraint programming
dc.subjectEvolutionary computing
dc.subjectHard and soft constraints
dc.subjectHeuristic search
dc.subjectLegal regulation
dc.subjectNurse rostering
dc.subjectRostering
dc.subjectSoft constraint
dc.subjectComputer programming
dc.subjectConstraint theory
dc.subjectHeuristic algorithms
dc.subjectInformation systems
dc.subjectLaws and legislation
dc.subjectNursing
dc.titleNurse rostering with soft constraints : Evidence from chilean mid-size health care centers
dc.typeConference Paper


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record