EMPLOYEE SCHEDULING IN FAST FOOD RESTAURANTS USING A SET OF SMALL INTEGER LINEAR PROGRAMS

摘要

Employee scheduling in a fast food restaurant is especially challenging because employees may have limited availability and skills, can work a maximum of 5 days a week, and management may have a target total weekly work hours for each employee. We decompose the problem into (a) shift scheduling and (b) tour scheduling/employee assignment, and use small integer linear programs to solve each part. As a preliminary test, we apply this method to the data given in a reference paper and compare our results.