An Optimization on Multiple Shifts Scheduling Problem - An Example of a Military Unit

本文探討空軍某通訊中心人員之多重排班問題，該中心因勤務多樣且執勤時間交互影響，造成人工排班方式既複雜且費時，因此希望經由電腦系統，進行多重班表之整合排班。以人員總滿意度最大為目標，解決過去耗用在排班規劃所花費的大量時間。本研究運用整數規劃法進行求解，制定班別需求相關限制，滿足人力供需關係，並以權重值之大小決定人員、班別編排的優先順序。本文經範例分析結果發現，優先權重值依不同重要性給予不同分數，可使系統決定何種勤務須優先排入，以及人員在歷史週期中是否滿足偏好班別。本研究發現，比較人工排班與電腦化排班結果，除排班時間可大幅節省外，公平性、客觀性及人員偏好性皆能顧及，是本研究之一大特色。Staff shift scheduling of Air Force Communications Center is a complicated problem, because duty time and works are diverse and interactive. Besides, shift scheduling problem which deal with by hand is very difficult and time-consuming. This paper designed a mathematical model to solve the multi-shift scheduling problem via computerized software operation. The objective of the proposed model is to maximize the satisfaction of all staff. We formulated an integer programming model to solve the multi-shift scheduling problem, the shift schedules include day-off assignment, standby and on-duty service under multiple constraints. The weights of shifts are settled by historical record, so the fairness can be considered. From the results of example, we found that the use of different ranking weights for different preferences can make the result more reasonable and effective. The proposed model could solve four layers shift problem simultaneously and efficiently. Through by the demonstration case, the model we provided is more time saving, fairness and objectivity than hand-made schedules in past