A Memetic Approach to the Nurse Rostering Problem
Applied Intelligence
Scheduling, Timetabling and Rostering - A Special Relationship?
Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
A Hybrid Tabu Search Algorithm for the Nurse Rostering Problem
SEAL'98 Selected papers from the Second Asia-Pacific Conference on Simulated Evolution and Learning on Simulated Evolution and Learning
An indirect genetic algorithm for a nurse-scheduling problem
Computers and Operations Research
The State of the Art of Nurse Rostering
Journal of Scheduling
An electromagnetic meta-heuristic for the nurse scheduling problem
Journal of Heuristics
Selection mechanisms in memory consideration for examination timetabling with harmony search
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Dynamic multi-swarm particle swarm optimizer with harmony search
Expert Systems with Applications: An International Journal
Harmony search for generalized orienteering problem: best touring in China
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part III
Office-space-allocation problem using harmony search algorithm
ICONIP'12 Proceedings of the 19th international conference on Neural Information Processing - Volume Part II
Hi-index | 0.00 |
In this paper, a Harmony Search Algorithm (HSA) is adapted for Nurse Rostering Problem (NRP). HSA is a global optimization method derived from a musical improvisation process which has been successfully tailored for several optimization domains. NRP is a hard combinatorial scheduling problem of assigning given shifts to given nurses. Using a dataset established by International Nurse Rostering Competition 2010 of sprint dataset that has 10-early, 10-late, 10-hidden, and 3-hint. The proposed method achieved competitively comparable results.