Abstract
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 365 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.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Beaumont, N. Using mixed integer programming to design employee rosters. J Oper Res Soc 48, 585–590 (1997). https://doi.org/10.1057/palgrave.jors.2600415
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1057/palgrave.jors.2600415