Please use this identifier to cite or link to this item:
https://ptsldigital.ukm.my/jspui/handle/123456789/476520| Title: | Greedy conctructive heuristic and simulated annealing for solving nurse rostering problem |
| Authors: | Rema A. Abobaker (P47948) |
| Supervisor: | Masri Ayob, Assoc. Prof Dr. |
| Keywords: | Heuristic algorithms Nursing services -- Malaysia -- Administration Universiti Kebangsaan Malaysia -- Dissertations Dissertations, Academic -- Malaysia |
| Issue Date: | 8-Jul-2011 |
| Description: | Nurse rostering problems include the distribution of nurses to shifts under given rules. The aim is to generate a roster that satisfies all hard constraints (mandatory) and as many soft constraints (optional) as possible. This work is a NP-hard problem, so we introduce a greedy constructive heuristic algorithm, based on a build pattern for two weeks that needs to satisfy all hard constraints. Firstly, one is allocated to meet a minimum coverage of night demand, and then another pattern is built to satisfy the remaining shifts. If the solution is not feasible, a repair mechanism algorithm is applied, and a simulated annealing is used to improve the solution. The Universiti Kebangsaan Malaysia Medical Center (UKMMC) is used as a case study for this work to test our method. The results showed that, in many cases, the presented approaches outperformed other approaches which were used on UKMMC datasets.,“Certification of Master’s/Doctoral Thesis” is not available,Master Information Technology |
| Pages: | 51 |
| Call Number: | QA76.9.A43A109 2011 3 tesis |
| Publisher: | UKM, Bangi |
| Appears in Collections: | Faculty of Information Science and Technology / Fakulti Teknologi dan Sains Maklumat |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| ukmvital_114914+SOURCE1+SOURCE1.0.PDF Restricted Access | 11.01 MB | Adobe PDF |  View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.