Simulated annealing approach for an overbooking appointment scheduling problem
No-shows are patients that do not show up for scheduled appointments or cancel at the last minute, preventing the health centre from filling the slot. Due to missed appointments, the health centre may lose time and money, and patient care may be compromised. In this study, we concentrate on patient...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Universiti Putra Malaysia
2024
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/118025/ http://psasir.upm.edu.my/id/eprint/118025/1/118025.pdf |
| _version_ | 1848867408669835264 |
|---|---|
| author | Ab Rahmin, Nor Aliza Nawawi @ Mohamed Nawawi, Athirah Khairuddin, Nur Irdina Husna |
| author_facet | Ab Rahmin, Nor Aliza Nawawi @ Mohamed Nawawi, Athirah Khairuddin, Nur Irdina Husna |
| author_sort | Ab Rahmin, Nor Aliza |
| building | UPM Institutional Repository |
| collection | Online Access |
| description | No-shows are patients that do not show up for scheduled appointments or cancel at the last minute, preventing the health centre from filling the slot. Due to missed appointments, the health centre may lose time and money, and patient care may be compromised. In this study, we concentrate on patient no-show behaviour to reduce resource idle time, resource overtime, and patient waiting time. We aim to improve the overbooking appointment scheduling problem by applying the simulated annealing method after implementing the heuristics procedure. We also discover the effects of multiple patient assignments in the same slot, where we tend to find the greatest number of patients per slot that may be allocated to reduce costs. Our findings indicate that when using a large dataset of patients, simulated annealing performs slightly better than heuristics methods, and as a result, the maximum number that may be assigned to the same time slot is four. |
| first_indexed | 2025-11-15T14:36:02Z |
| format | Article |
| id | upm-118025 |
| institution | Universiti Putra Malaysia |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-15T14:36:02Z |
| publishDate | 2024 |
| publisher | Universiti Putra Malaysia |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | upm-1180252025-06-25T01:37:14Z http://psasir.upm.edu.my/id/eprint/118025/ Simulated annealing approach for an overbooking appointment scheduling problem Ab Rahmin, Nor Aliza Nawawi @ Mohamed Nawawi, Athirah Khairuddin, Nur Irdina Husna No-shows are patients that do not show up for scheduled appointments or cancel at the last minute, preventing the health centre from filling the slot. Due to missed appointments, the health centre may lose time and money, and patient care may be compromised. In this study, we concentrate on patient no-show behaviour to reduce resource idle time, resource overtime, and patient waiting time. We aim to improve the overbooking appointment scheduling problem by applying the simulated annealing method after implementing the heuristics procedure. We also discover the effects of multiple patient assignments in the same slot, where we tend to find the greatest number of patients per slot that may be allocated to reduce costs. Our findings indicate that when using a large dataset of patients, simulated annealing performs slightly better than heuristics methods, and as a result, the maximum number that may be assigned to the same time slot is four. Universiti Putra Malaysia 2024 Article PeerReviewed text en http://psasir.upm.edu.my/id/eprint/118025/1/118025.pdf Ab Rahmin, Nor Aliza and Nawawi @ Mohamed Nawawi, Athirah and Khairuddin, Nur Irdina Husna (2024) Simulated annealing approach for an overbooking appointment scheduling problem. Menemui Matematik, 46 (2). pp. 81-89. ISSN 2231-7023 https://myjms.mohe.gov.my/index.php/dismath/issue/archive |
| spellingShingle | Ab Rahmin, Nor Aliza Nawawi @ Mohamed Nawawi, Athirah Khairuddin, Nur Irdina Husna Simulated annealing approach for an overbooking appointment scheduling problem |
| title | Simulated annealing approach for an overbooking appointment scheduling problem |
| title_full | Simulated annealing approach for an overbooking appointment scheduling problem |
| title_fullStr | Simulated annealing approach for an overbooking appointment scheduling problem |
| title_full_unstemmed | Simulated annealing approach for an overbooking appointment scheduling problem |
| title_short | Simulated annealing approach for an overbooking appointment scheduling problem |
| title_sort | simulated annealing approach for an overbooking appointment scheduling problem |
| url | http://psasir.upm.edu.my/id/eprint/118025/ http://psasir.upm.edu.my/id/eprint/118025/ http://psasir.upm.edu.my/id/eprint/118025/1/118025.pdf |