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:	Operating rooms - Management Parallel scheduling (Computer scheduling) Operating Rooms - organization & administration
Online Access:	http://psasir.upm.edu.my/id/eprint/92794/1/FS%202021%2016%20-%20IR.pdf
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my-upm-ir.92794
record_format	uketd_dc
spelling	my-upm-ir.927942022-05-10T04:28:11Z Local search approaches for patient scheduling problem in parallel operating theatre 2020-12 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. Operating rooms - Management Parallel scheduling (Computer scheduling) Operating Rooms - organization & administration 2020-12 Thesis http://psasir.upm.edu.my/id/eprint/92794/ http://psasir.upm.edu.my/id/eprint/92794/1/FS%202021%2016%20-%20IR.pdf text en public masters Universiti Putra Malaysia Operating rooms - Management Parallel scheduling (Computer scheduling) Operating Rooms - organization & administration Abd Rahmin, Nor Aliza
institution	Universiti Putra Malaysia
collection	PSAS Institutional Repository
language	English
advisor	Abd Rahmin, Nor Aliza
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
qualification_level	Master's degree
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
granting_institution	Universiti Putra Malaysia
publishDate	2020
url	http://psasir.upm.edu.my/id/eprint/92794/1/FS%202021%2016%20-%20IR.pdf
_version_	1747813768523415552

Local search approaches for patient scheduling problem in parallel operating theatre

Similar Items