頁籤選單縮合
題 名 | 以整數規劃法解醫院護理排班之問題=A Study on Nurse Shift Scheduling by Integer Programming Method |
---|---|
作 者 | 黃允成; | 書刊名 | 技術學刊 |
卷 期 | 14:4 1999.12[民88.12] |
頁 次 | 頁563-570 |
分類號 | 419.83 |
關鍵詞 | 護理排班; 輪班制; Nurse; Shift scheduling; |
語 文 | 中文(Chinese) |
中文摘要 | 本文針對大型醫院之護理人員排班問題提出一數學規劃模型,該數學模型之目標 函數為整體護理人員之總抱怨最小化; 其限制條件包括:1. 必須符合各班次護理人力之需 求。2. 每人每天最多只上一個班。3. 休假人力隱含在各班次的人力需求中,以應彈性調整 之需。本模式之主要特色是將個人意願、工作需求及以往上班之情形加以整合,以達到公平 客觀之要求。最後,本文舉一範例,說明本模式之運用方式。 |
英文摘要 | In this paper, we construct an integer programming model to solve the problem of nurses' shift scheduling. the objective function of the model is to minimize the complaints of all nurses. There are three constraints in this model: First, the number of nurses must meet the requirement of each shift. Second, one shift per day for each nurse. Third, the number of nurses taking days off are figured in each shift's requirements. The point of this paper is to integrate the following objects: the preference of each nurse, the workload requirement and the recent shifts records for each nurse. Finally, we simulate an example to demonstrate how the model applied. |
本系統中英文摘要資訊取自各篇刊載內容。