Using Mixed Integer Programming to Design Employee Rosters
研究如何用混合整数规划优化员工年度排班，在满足24小时全天候需求等约束下，最大化三个目标的加权和，并用实际数据验证效果。
TMs; paper describes the problem of rostering a workforce so as to optimise a weighted sum of three criteria while satisfying several constraints.The rostering entailed deciding ori \a pattern of working days a' ^d breaks over a period of (typically) one year.Demand had to meet 24 hours each day and 356 days each year.It was possible to formulate this problem as a mixed integer program and, with some experimentation, solve it using an 'off the shelf linear programming package.The results obtained are compared with rosters the client now uses.