1. UKM Learning and Research Repository
2. Master Thesis / Tesis Master
3. Faculty of Information Science and Technology / Fakulti Teknologi dan Sains Maklumat

Title:	Heuristic approaches to solving the nurse rostering problem
Authors:	Mouna Saied M. Jamom (P47933)
Supervisor:	Masry binit Ayob, Dr
Keywords:	Heuristic approaches Nurse rostering problem Heuristic algorithms
Issue Date:	15-Jul-2011
Description:	Nurse Rostering problems (NRPs) represent a subclass of scheduling problems that are hard to solve. The NRP assigns nurses to shifts per day subject to some constraints. Many heuristic approaches have been applied to solve NRP. The NRPs are NP-Hard problems, which are difficult to solve for their optimality. Using exact methods to solve NRPs is impractical and computationally expensive. This is due to their complexity and their solutions space is very large which contains many objectives and constraints that need to be fulfilled. Therefore, the heuristic method, as alternative to the exact method, is used to solve such a problem. Heuristic searching methods are often used, which have no guarantee of optimal or even near optimal solutions. The goal of any heuristics method is to find solutions of acceptable quality within an acceptable time. This work focuses on solving NRP at Universiti Kebangsaan Malaysia Medical Centre (UKMMC) using tabu search algorithm. In the UKMMC there are three shifts per a day: morning shift (M), evening shift (E), and night shift (N). These shifts are assigned to the nurses over a two-week period. The goal of this study is to apply an effective heuristic algorithm to solve NRP in UKMMC by satisfying all the hard constraints (to get a feasible schedule), and attempting to satisfy the soft constraints as much as possible. In this work, we use two heuristic stages. In the first stage a Greedy Algorithm is used to get a feasible initial solution (randomly), and in the second stage an improvement heuristic algorithm was applied to improve the feasible solution for the problem. Results show that the algorithm yields fairly good results by reducing the penalty of the initial schedule.,Master/Sarjana
Pages:	69
Call Number:	QA76.9.A43.J345 2011
Publisher:	UKM, Bangi
URI:	https://ptsldigital.ukm.my/jspui/handle/123456789/476147
Appears in Collections:	Faculty of Information Science and Technology / Fakulti Teknologi dan Sains Maklumat

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.