UPM Institutional Repository

Local search heuristics for elective surgery scheduling considering patient urgency


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


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.

Download File

[img] Text
Local search heuristics .pdf

Download (53kB)

Additional Metadata

Item Type: Article
Divisions: Faculty of Science
Publisher: Malaysian Mathematical Society
Keywords: Surgery scheduling; Surgeon assignment; Heuristic; Local search; Integer linear programming
Depositing User: Mohamad Jefri Mohamed Fauzi
Date Deposited: 28 Sep 2021 21:56
Last Modified: 28 Sep 2021 21:56
URI: http://psasir.upm.edu.my/id/eprint/81244
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item