Nurse scheduling is a type of manpower allocation problem that tries to satisfy hospitalmanagers’ objectives and nurses’ preferences as much as possible by generating fair shiftschedules. This paper presents a nurse scheduling problem based on a real case study, andproposes two meta-heuristics – a differential evolution algorithm (DE) and a greedyrandomised adaptive search procedure (GRASP) – to solve it. To investigate the efficiency ofthe proposed algorithms, two problems are solved. Furthermore, some comparison metricsare applied to examine the reliability of the proposed algorithms. The computationalresults in this paper show that the proposed DE outperforms the GRASP.
展开▼
