- 學位論文
建構空病床最小化之外科部醫師手術排班
Building department of surgery physician surgery schedule to minimize empty beds
摘要
本研究為建構空病床最小化之外科部醫師手術排班問題，並分成兩階段進行求解：第一階段針對單一科別醫師手術排班問題進行求解，設定三種情境並建構四個數學規劃模式進行求解，分別期望能使空病床數量最小化，且排入大手術數量最大化、排入醫師理想時段數最大化以及結合排入理想時段與大手術數量最大化，並增設權重以求解兩者之間的關係比例；第二階段則針對外科部門科別與科別之間的病床調度問題進行求解，並以第一階段模式三之求解結果帶入，並依照所設計的啟發式演算法之步驟進行求解，最後獲得改善後之空病床數以及排班結果。而實驗結果顯示，第一階段與第二階段的求解，可以有效的執行排班結果，且排班結果皆依照數學規劃模式之限制而安排，且本研究求解醫師數50，病床數為200時，第一階段與第二階段的總求解時間在20秒以內，顯示出本研究所提出的數學規劃模式求解是有效率性的。
並列摘要
We study the problem arising from the bed shortage of a hospital which is of prime concern for hospital management. It is a tactical planning problem of assigning physicians’ surgery operations to the defined time slots/shifts over a time horizon incorporating a number of constraints and physicians’ shifts preferred or shifts off. The objective is to minimize the total empty beds, which in turn to maximize the total bed occupancies. The algorithm we developed consists of two stages. At the first stage, four objectives are considered on the basis of mathematical programming modeling, namely minimizing the empty beds, giving the priority on the assignment of heavy surgery, satisfying physician’s ideal shift, and finally we concerned with the bi-objective problem of maximizing the number of physician’s ideal shift and the number of heavy surgery. At the second stage, a transferring rule is applied between departments when the admission of operated patients is block due to lack of bed spaces. The developed models were tested on randomly generated problem instances. We show that this approach is very efficient even the problem with 50 physician combined with 200 beds can be solve within 20 seconds.