Loading...

Proposing a Solution Algorithm for Operating Room Scheduling Problem Using Open Scheduling and Elective Patient Strategy

Iranzad, Reza | 2017

436 Viewed
  1. Type of Document: M.Sc. Thesis
  2. Language: Farsi
  3. Document No: 49769 (01)
  4. University: Sharif University of Technology
  5. Department: Industrial Engineering
  6. Advisor(s): Rafiee, Majid
  7. Abstract:
  8. Operating rooms have always been the most expensive and also the most profitable section in hospitals which include approximately one third of cost and two third of income. The management always wants to decrease the cost of hospitals. On the other hand, usually this goal stands against other goals such as patient’s satisfaction. So the manager should make a balance between these goals. In this research, we will propose an integer programming model for operating room scheduling problem without uncertainty for elective patients. In order to make the model more realistic, we want to make connection between operating room theatre and intensive care units. Also, we will consider desirable range of planning for patients which helps the management to minimize the risk of dying and leaving of the patients. To assign a surgeon to a patient, we will use open scheduling strategy and implement a lagrangian relaxation algorithm to solve the problem. In the algorithm, the group of hard constraints are eliminated and transferred to the objective function with a penalty vector. By selecting the best penalty vector in each iteration, we will use subgradian method. At the end, to evaluate the performance of our proposed algorithm, we will make comparison between our results and other similar researches
  9. Keywords:
  10. Operating Room Scheduling ; Integer Programming ; Lagrangian Relaxation ; Subgradient Algorithm ; Operaring Room Planning ; Open Scheduling

 Digital Object List

 Bookmark

No TOC