Local search heuristics for elective surgery scheduling considering patient urgency

This paper study a surgery scheduling and surgeon assignment problem in operating rooms focusing on elective patients with different urgency. A long waiting time can increase the patient’s urgency and lead to health complication. Our aim is to maximize the sum of the urgency values assigned to each...

Full description

Bibliographic Details
Main Authors: Rashid, N. S. A., Rahmin, N. A. A., Leong, W. J., Mohamed Ali, Nazihah
Format: Article
Language:English
Published: Malaysian Mathematical Society 2019
Online Access:http://psasir.upm.edu.my/id/eprint/81244/
http://psasir.upm.edu.my/id/eprint/81244/1/Local%20search%20heuristics%20.pdf
_version_ 1848859057806376960
author Rashid, N. S. A.
Rahmin, N. A. A.
Leong, W. J.
Mohamed Ali, Nazihah
author_facet Rashid, N. S. A.
Rahmin, N. A. A.
Leong, W. J.
Mohamed Ali, Nazihah
author_sort Rashid, N. S. A.
building UPM Institutional Repository
collection Online Access
description This paper study a surgery scheduling and surgeon assignment problem in operating rooms focusing on elective patients with different urgency. A long waiting time can increase the patient’s urgency and lead to health complication. Our aim is to maximize the sum of the urgency values assigned to each surgery. An integer linear programming model is referred to solve the problem. As the model consume a high computational time to solve for a large-scale instance, we developed a local search algorithm based on a simple heuristic to deal with the problem. To test the efficiency of our proposed heuristics, we compare the solutions of integer linear programming model with the heuristics. The results show that solutions obtained by the local search algorithm are good quality and has significantly reduce the computational time even when considering more surgeries in the waiting list.
first_indexed 2025-11-15T12:23:18Z
format Article
id upm-81244
institution Universiti Putra Malaysia
institution_category Local University
language English
last_indexed 2025-11-15T12:23:18Z
publishDate 2019
publisher Malaysian Mathematical Society
recordtype eprints
repository_type Digital Repository
spelling upm-812442021-09-28T21:56:23Z http://psasir.upm.edu.my/id/eprint/81244/ Local search heuristics for elective surgery scheduling considering patient urgency Rashid, N. S. A. Rahmin, N. A. A. Leong, W. J. Mohamed Ali, Nazihah This paper study a surgery scheduling and surgeon assignment problem in operating rooms focusing on elective patients with different urgency. A long waiting time can increase the patient’s urgency and lead to health complication. Our aim is to maximize the sum of the urgency values assigned to each surgery. An integer linear programming model is referred to solve the problem. As the model consume a high computational time to solve for a large-scale instance, we developed a local search algorithm based on a simple heuristic to deal with the problem. To test the efficiency of our proposed heuristics, we compare the solutions of integer linear programming model with the heuristics. The results show that solutions obtained by the local search algorithm are good quality and has significantly reduce the computational time even when considering more surgeries in the waiting list. Malaysian Mathematical Society 2019-12-30 Article PeerReviewed text en http://psasir.upm.edu.my/id/eprint/81244/1/Local%20search%20heuristics%20.pdf Rashid, N. S. A. and Rahmin, N. A. A. and Leong, W. J. and Mohamed Ali, Nazihah (2019) Local search heuristics for elective surgery scheduling considering patient urgency. Discovering Mathematics, 41 (2). pp. 46-56. ISSN 0126-9003 https://myjms.mohe.gov.my/index.php/dismath/article/view/13462/6884
spellingShingle Rashid, N. S. A.
Rahmin, N. A. A.
Leong, W. J.
Mohamed Ali, Nazihah
Local search heuristics for elective surgery scheduling considering patient urgency
title Local search heuristics for elective surgery scheduling considering patient urgency
title_full Local search heuristics for elective surgery scheduling considering patient urgency
title_fullStr Local search heuristics for elective surgery scheduling considering patient urgency
title_full_unstemmed Local search heuristics for elective surgery scheduling considering patient urgency
title_short Local search heuristics for elective surgery scheduling considering patient urgency
title_sort local search heuristics for elective surgery scheduling considering patient urgency
url http://psasir.upm.edu.my/id/eprint/81244/
http://psasir.upm.edu.my/id/eprint/81244/
http://psasir.upm.edu.my/id/eprint/81244/1/Local%20search%20heuristics%20.pdf