A heuristic algorithm for nurse scheduling with balanced preference satisfaction
This paper tackles the nurse scheduling problem with balanced preference satisfaction which consists of generating an assignment of shifts to nurses over a given time horizon and ensuring that the satisfaction of nurses personal preferences for shifts is as even as possible in order to ensure fairne...
| Main Authors: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
IEEE press
2011
|
| Subjects: | |
| Online Access: | https://eprints.nottingham.ac.uk/32602/ |