Ambulatory Clinic Scheduling

In this thesis we seek to fully explore the ambulatory clinic scheduling problem (CSP) and study the creation of ambulatory clinic schedules using mathematical models. We describe our experiences developing ambulatory clinic schedules for three healthcare facilities including the challenges we faced, lessons learned, and value provided to our partner organizations. Based on our experiences we identify and model the key elements of the CSP, providing a general model for future use. To solve our general clinic scheduling model we identify the problem in literature with the structure most similar to the CSP and consider solution approaches that may be adapted for the CSP. We adapt a solution approach for the multi-resource generalized assignment problem to the CSP based on insight gained through our practical experience. Our adaptations improve the solution approachâ s performance on the CSP. This thesis will establish the clinic scheduling problem as an important healthcare operations problem alongside other popular and well-studied healthcare scheduling problems such as personnel and operating room scheduling.

Department dc:contributor.department

Mechanical and Industrial Engineering

Year dc:date.issued

2017

Author dc:creator

• Eagen, Brendan

Advisors dc:contributor.advisor

• Chan, Timothy CY
• Carter, Michael W

• clinic scheduling
• healthcare
• integer programming

Handle dc:identifier.uri

http://hdl.handle.net/1807/77450

OAI identifier oai:identifier

oai:utoronto.scholaris.ca:1807/77450