Please use this identifier to cite or link to this item:
https://ptsldigital.ukm.my/jspui/handle/123456789/476520Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | Masri Ayob, Assoc. Prof Dr. | - |
| dc.contributor.author | Rema A. Abobaker (P47948) | - |
| dc.date.accessioned | 2023-10-06T09:20:09Z | - |
| dc.date.available | 2023-10-06T09:20:09Z | - |
| dc.date.issued | 2011-07-08 | - |
| dc.identifier.other | ukmvital:114914 | - |
| dc.identifier.uri | https://ptsldigital.ukm.my/jspui/handle/123456789/476520 | - |
| dc.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 | - |
| dc.language.iso | eng | - |
| dc.publisher | UKM, Bangi | - |
| dc.relation | Faculty of Information Science and Technology / Fakulti Teknologi dan Sains Maklumat | - |
| dc.rights | UKM | - |
| dc.subject | Heuristic algorithms | - |
| dc.subject | Nursing services -- Malaysia -- Administration | - |
| dc.subject | Universiti Kebangsaan Malaysia -- Dissertations | - |
| dc.subject | Dissertations, Academic -- Malaysia | - |
| dc.title | Greedy conctructive heuristic and simulated annealing for solving nurse rostering problem | - |
| dc.type | theses | - |
| dc.format.pages | 51 | - |
| dc.identifier.callno | QA76.9.A43A109 2011 3 tesis | - |
| dc.identifier.barcode | 002497(2011) | - |
| 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.