Model and solution approaches for patient admission scheduling problems

Saif Kifah Jihad (P60049)

Please use this identifier to cite or link to this item: https://ptsldigital.ukm.my/jspui/handle/123456789/513298

Full metadata record

DC Field	Value	Language
dc.contributor.advisor	Salwani Abdullah, Prof. Dr.	-
dc.contributor.author	Saif Kifah Jihad (P60049)	-
dc.date.accessioned	2023-10-16T04:35:20Z	-
dc.date.available	2023-10-16T04:35:20Z	-
dc.date.issued	2017-01	-
dc.identifier.other	ukmvital:98989	-
dc.identifier.uri	https://ptsldigital.ukm.my/jspui/handle/123456789/513298	-
dc.description	Patient admission scheduling is a combinatorial optimisation problem that is attaining raising concern in health care practice. It deals in assigning a patient to bed in a hospital that fulfils the medical urgency subject to several restrictions. Patient admission is, nonetheless, a very complex task. This is because of the involvement of several resources in the hospital, such as oxygen or telemetry, that is either necessary or not to the patients. Assigning a patient to a bed, which is located in the department that specialised to treat patient’s condition is a critical requirement. In addition, there is uncertainty in the health condition of the patient and changes do often occur, that necessitate the provision of patients’ needed medical equipment or properties. These challenges will prompt the healthcare system to offer a higher quality treatment in terms of patients’ comfort with limited resources. The research work presented in this thesis aims to build upon the state of the art in search methodologies for patient admission scheduling problems. The research first highlights an investigation on an adaptive non-linear Great Deluge algorithm to tackle a standard static patient admission scheduling problem. Due to the fact that unpredictable changes might occur during the course of an ongoing scheduling process. Thus, the research next highlights an extension to the static patient admission scheduling problem that is modelled in a dynamic fashion to represent a real world scenario. Three dynamic models are introduced i.e., (i) dynamic duration, (ii) dynamic properties, and (iii) dynamic duration and properties. In solving the dynamic patient admission scheduling problem, the solution approach should be able to monitor the movement of the optimal point and the changes in the landscape solutions. In real-world scenario, patients have multiple objectives that are conflicting to each other. Thus, the research proposes a solution approach to multi-objective patient admission scheduling problem where six conflicting objectives are considered i.e., room should be occupied by the same gender, minimised a patient transfer, assign patients to wards specialised in the treatment, satisfy the mandatory/preferred properties, satisfy the specialism of the pathology and satisfy room preferences. A set of non-dominating solutions known as the Pareto optimal (rather than a single solution as in static and dynamic patient admission problems) is generated, which later helps the decision maker in the hospital to make the right decision. In this work, the performance of the adaptive non-linear algorithm is tested on three different natures of the patient admission scheduling problems where the non-linear decay rate of the water level in the Great Deluge algorithm is adaptively updating during the optimisation course. Computational results based on standard benchmark instances are reported to demonstrate the effectiveness of the approach studied here on static, dynamic and multi-objective patient admission scheduling problems. Comparison with other approaches in the scientific literature shows that the proposed approaches are able to obtain competitive results and would be a highly appropriate methodology to employ.,Certification of Master's/Doctoral Thesis" is not available	-
dc.language.iso	eng	-
dc.publisher	UKM, Bangi	-
dc.relation	Faculty of Information Science and Technology / Fakulti Teknologi dan Sains Maklumat	-
dc.rights	UKM	-
dc.subject	Computer algorithms	-
dc.title	Model and solution approaches for patient admission scheduling problems	-
dc.type	Theses	-
dc.format.pages	144	-
dc.identifier.callno	QA76.9.A43J535 2017 3 tesis	-
dc.identifier.barcode	003229(2018)	-
Appears in Collections:	Faculty of Information Science and Technology / Fakulti Teknologi dan Sains Maklumat

Files in This Item:

File	Description	Size	Format
ukmvital_98989+SOURCE1+SOURCE1.0.PDF Restricted Access		618.69 kB	Adobe PDF	View/Open

Show simple item record Recommend this item