Beaumont, Nicholas Using Mixed Integer Programming to Design Employee Rosters This 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 on a pattern of working days and 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. Manpower planning;Mixed integer programming;1997;1959.1/36669;monash:7096;Workforce scheduling 2017-06-05
    https://bridges.monash.edu/articles/journal_contribution/Using_Mixed_Integer_Programming_to_Design_Employee_Rosters/5073661
10.4225/03/5934f6e65cb7c