本文針對大型醫院之護理人員排班問題提出一整數規劃模型，該數學模型之目標函數為整體護理人員之總不滿程度最小化；其限制條件包括：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. These are three constraints in this model: First, the amount of nurses must meet the requirement at each shift. Second, one shift one day form each nurse. Third, the amount of nurses for day-off is involved in each shift’s requirements. The characteristics of this paper is to integrate the following objects; the preference of each nurse for each shift, the workload requirement and the recent shifts records for each nurse. Finally, we illustrate an example to demonstrate how the model is applied.