本研究探討人員在多重班務或多重技能下，如何制定每個工作站的最適化 值班表，一直以來排班問題多著重於滿足最低人數限制、最小成本、排班公平 性與人員滿意度的最佳組合，且大多數人員調度問題皆限制值班人員一次僅能 執行單項工作，國軍為典型24 小時輪班輪休的值勤單位，在值班 (勤) 上因戰爭 型態的改變人力短缺又流動性高，各單位人員需具備多重技能以輪值不同類型 班務，甚至須同時輪值兼任兩種班務，故本文以國軍某通信中心為例，以整數規 劃法建立人員多重排班模型，採用階段式循序排班方式求解，探討四重整合性 之排班問題最佳化 (值班、留守、衛哨、休假)，希望能快速制定符合實際需求 之工作人員多重值班班表，提供未來有限人力下混合式班表執行的應用參考。

This study investigates that how to achieve the maximization of satisfaction in the scheduling of each workshop when officers are under multiple skills or tasks. Most difficulties of scheduling problem focus on the limit of the manpower, costs, fairness, and the satisfaction. Then, the Army is also a typical 24-hour-work organization, and has difficulties concerning the maximization of satisfaction about the shift scheduling with the less manpower. In addition, because of the change of war types, the shortage of manpower, and higher mobility, military officers need to have many skills to face different tasks, and even have to do many tasks at a time. Using a military communication center as an example, this paper will propose an in-teger programming scheduling model to maximize satisfaction with multiple duties and fairness. Finally, we hope the proposed model can solve the multiple skills multiple duties shifts scheduling problem under multiple constraints.