monash_7096.pdf (379.78 kB)
Using Mixed Integer Programming to Design Employee Rosters
journal contribution
posted on 2017-06-05, 06:15 authored by Beaumont, NicholasThis 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.
History
Year of first publication
1997Series
Department of Management.Usage metrics
Categories
No categories selectedLicence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC