Development and implementation of a computer-aided method for planning resident shifts in a hospital

Authors: Kreeft, Daniel
Advisor: Lamond, BernardRuiz, Angel
Abstract: This thesis provides a problem formulation for the resident scheduling problem, a problem on which very little research has been done. The hospital departments mentioned in this thesis are the paediatrics department of the CHUL (Centre Hospitalier de l’Université Laval) and the emergency department of the Hôpital Enfant-Jésus in Québec City. The main contribution of this thesis is the proposal of a framework for the analysis of manual techniques used in scheduling problems, often described as highly constrained optimisation problems. We show that it is possible to use manual scheduling techniques to establish a reduced set of constraints to focus the search on. The techniques used can differ from one schedule type to another and will determine the quality of the final solution. Since a scheduler manually makes the schedule, the techniques used reflect the scheduler’s notion of schedule quality. The framework shows that a scheduler is capable of selecting a reduced set of constraints, producing manual schedules that often are of very high quality. The fact that a scheduler’s approach is efficient becomes clear when his schedules are compared to heuristics solutions. We therefore translated the manual techniques into an algorithm so that the scheduler’s notion of schedule quality was used for the local search and show the results that were obtained. Key words: Timetable scheduling, Resident scheduling, Manual scheduling, Heuristic schedule generation, Local search methods
Document Type: Mémoire de maîtrise
Issue Date: 2012
Open Access Date: 18 April 2018
Grantor: Université Laval
Collection:Thèses et mémoires

Files in this item:
Description SizeFormat 
28682.pdfTexte3.7 MBAdobe PDFThumbnail
All documents in CorpusUL are protected by Copyright Act of Canada.