Local search approaches for patient scheduling problem in parallel operating theatre

Patient scheduling in operating theatres (OT) involves high costs to hospitals and may affect treatment and satisfaction to patients. Scheduling for patients in parallel OT can help to schedule a large number of patients and emergency patients are considered in this study .Other than that, emerge...

Full description

Saved in:
Bibliographic Details
Main Author: Alimin, Nur Neesha
Format: Thesis
Language:English
Published: 2020
Subjects:
Online Access:http://psasir.upm.edu.my/id/eprint/92794/1/FS%202021%2016%20-%20IR.pdf
http://psasir.upm.edu.my/id/eprint/92794/
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Universiti Putra Malaysia
Language: English
id my.upm.eprints.92794
record_format eprints
spelling my.upm.eprints.927942022-05-10T04:28:11Z http://psasir.upm.edu.my/id/eprint/92794/ Local search approaches for patient scheduling problem in parallel operating theatre Alimin, Nur Neesha Patient scheduling in operating theatres (OT) involves high costs to hospitals and may affect treatment and satisfaction to patients. Scheduling for patients in parallel OT can help to schedule a large number of patients and emergency patients are considered in this study .Other than that, emergency patients are able to be scheduled and treated on the day as the modification of schedule is performed during the dynamic processof scheduling. The objective of the study is to propose different types of local search which are local search(LS), improved local search(ILS) and mixed local search (MLS) for solving patient scheduling problem in parallel OT. This study presents two phases of scheduling where initial schedule of regular patients is obtained in the first phase, then scheduling process continues in the second phase when operations start and emergency patients arrive. In the first phase, pre-processing stage, combination of pre-processing stage with low-level heuristic and genetic algorithm are used.The different types of LS are applied in the second phase of scheduling. Tests are conducted for the proposed methods to look for a method that has the ability to prevent delays of patients with a lower total cost. The performance of the LS is compared with zero-one programming method from literature and it is reliable to the problem. The result of ILS has reduced the average total cost to 30:4% while MLS has achieved 52:7% decrease in the average total cost. The computational results show that MLS out performs both methods of LS and ILS by minimizing the total cost of OT greatly. 2020-12 Thesis NonPeerReviewed text en http://psasir.upm.edu.my/id/eprint/92794/1/FS%202021%2016%20-%20IR.pdf Alimin, Nur Neesha (2020) Local search approaches for patient scheduling problem in parallel operating theatre. Masters thesis, Universiti Putra Malaysia. Operating rooms - Management Parallel scheduling (Computer scheduling) Operating Rooms - organization & administration
institution Universiti Putra Malaysia
building UPM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Putra Malaysia
content_source UPM Institutional Repository
url_provider http://psasir.upm.edu.my/
language English
topic Operating rooms - Management
Parallel scheduling (Computer scheduling)
Operating Rooms - organization & administration
spellingShingle Operating rooms - Management
Parallel scheduling (Computer scheduling)
Operating Rooms - organization & administration
Alimin, Nur Neesha
Local search approaches for patient scheduling problem in parallel operating theatre
description Patient scheduling in operating theatres (OT) involves high costs to hospitals and may affect treatment and satisfaction to patients. Scheduling for patients in parallel OT can help to schedule a large number of patients and emergency patients are considered in this study .Other than that, emergency patients are able to be scheduled and treated on the day as the modification of schedule is performed during the dynamic processof scheduling. The objective of the study is to propose different types of local search which are local search(LS), improved local search(ILS) and mixed local search (MLS) for solving patient scheduling problem in parallel OT. This study presents two phases of scheduling where initial schedule of regular patients is obtained in the first phase, then scheduling process continues in the second phase when operations start and emergency patients arrive. In the first phase, pre-processing stage, combination of pre-processing stage with low-level heuristic and genetic algorithm are used.The different types of LS are applied in the second phase of scheduling. Tests are conducted for the proposed methods to look for a method that has the ability to prevent delays of patients with a lower total cost. The performance of the LS is compared with zero-one programming method from literature and it is reliable to the problem. The result of ILS has reduced the average total cost to 30:4% while MLS has achieved 52:7% decrease in the average total cost. The computational results show that MLS out performs both methods of LS and ILS by minimizing the total cost of OT greatly.
format Thesis
author Alimin, Nur Neesha
author_facet Alimin, Nur Neesha
author_sort Alimin, Nur Neesha
title Local search approaches for patient scheduling problem in parallel operating theatre
title_short Local search approaches for patient scheduling problem in parallel operating theatre
title_full Local search approaches for patient scheduling problem in parallel operating theatre
title_fullStr Local search approaches for patient scheduling problem in parallel operating theatre
title_full_unstemmed Local search approaches for patient scheduling problem in parallel operating theatre
title_sort local search approaches for patient scheduling problem in parallel operating theatre
publishDate 2020
url http://psasir.upm.edu.my/id/eprint/92794/1/FS%202021%2016%20-%20IR.pdf
http://psasir.upm.edu.my/id/eprint/92794/
_version_ 1732947082085400576