A Variable Neighbourhood Search for nurse scheduling with balanced preference satisfaction
The nurse scheduling problem (NSP) is a combinatorial optimisation problem widely tackled in the literature. Recently, a new variant of this problem was proposed, called nurse scheduling problem with balanced preference satisfaction (NSPBPS). This paper further investigates this variant of the NSP a...
| Main Authors: | , , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
Scipress
2015
|
| Online Access: | http://eprints.nottingham.ac.uk/31295/ http://eprints.nottingham.ac.uk/31295/ http://eprints.nottingham.ac.uk/31295/1/dls_nabic2015.pdf |