Loading...

The Planning and Scheduling of Operating Rooms under the Open Scheduling Strategy and Uncertainty

Noroozi Rasool Abadi, Mozhdeh | 2016

568 Viewed
  1. Type of Document: M.Sc. Thesis
  2. Language: Farsi
  3. Document No: 49156 (01)
  4. University: Sharif University of Technology
  5. Department: Industrial Engineering
  6. Advisor(s): Rafiee, Majid
  7. Abstract:
  8. Operating rooms has always been considered as one of the most expensive, yet most profitable part of a hospital. Since many units in the hospitals are related to the operating room, improving efficiency in the operating room will result in increased efficiency in other units, so offering proper solutions in this area is very important. Suitable Planning and scheduling has a great impact on increasing the level of service and efficiency of the hospital. in this thesis, a mixed integer programming model for scheduling weekly elective patients in the surgical theater with the objective of maximizing the number of elective patients for the surgery and also the workload of the operating room will be presented in the form of flexible flow shops with regard to capacity constraints including capacity of the care units after the procedure, no-wait between sectors, limited presence of the doctors and difference between the operating rooms and at the same time in one phase the allocation of patients to the operating room and day and also their sequence and Completion time of the surgical procedure will be determined under open scheduling strategy. On the one hand duration of surgery in the operating room is not deterministic and therefore robust optimization model will be presented based on methods of sim and Bertsimas. After proving NP-hard problem, in order to solve the deterministic model, Benders decomposition algorithm will be used to reduce the time of large scale issues. Then to increase the speed of convergence valid inequalities and acceleration method Benders decomposition algorithm Pareto- will be developed. Based on the results of numerical examples, using the above techniques, will reduce the time needed to solve the problem
  9. Keywords:
  10. Operating room ; Mixed Integer Programming ; Benders Decomposition ; Robust Optimization ; Scheduling ; Planning ; Uncertainty ; Improved Benders Decomposition Algorithm

 Digital Object List

 Bookmark

No TOC