| Summary: | 碩士 === 國立雲林科技大學 === 工業工程與管理研究所碩士班 === 99 === Operating room are one importance source of revenue for hospitals. How to schedule surgeries efficiently to move patients from the operating room to the recovery room has been a problem that continues to confront hospital managers. There are many factors that can affect operating room scheduling, so scheduling members must consider many ways. Considering that there were many surgical cases and that there was a shortage of recovery room beds, our plan was to allow surgical patients to recovery in the operating room until there was an opening in the recovery room. Our objective was to minimize the time patients spent in the operating room before they could be moved to the recovery room. This problem has been classified as flow-shop scheduling, and it was solved with gene algorithms. For this study, we looked at the shortest wait times and the longest wait times. After analysis and comparison, this study achieved shorter waiting times than in the two comparison studies. The results can be referred to by hospital managers in charge of scheduling.
|
|---|
