Optimal scheduling of waitstaff with different experience levels at a restaurant chain

Restaurants often face strong pressure to reduce costs. Managers regularly respond by hiring temporary or part-time workers and by trying to reduce the size of the workforce as much as possible, which makes it difficult to develop a personnel schedule that provides sufficient service to the customers. The problem gets even more complicated if (frequent) employee turnover and demand fluctuations occur and if employees have different experience levels. This paper presents mathematical models to support waitstaff scheduling at a restaurant chain based in Baku, Azerbaijan, taking into account the managerial requirements of the company. The problem we address is equivalent to a general tour scheduling problem that assigns waitstaff to work shifts throughout the week. We develop three integer programming models taking account of factors, such as employee types and experience levels, differences in the complexity of customer orders, and side tasks and responsibilities, to find the optimal number of employees together with the best tour for each of them. The models are solved to optimality, and the results are applied at a branch of the restaurant chain in Baku. Compared with the existing schedule, the optimized schedule enabled the restaurant to reduce overstaffing levels by approximately 40% and labor costs by 20% while keeping the same service standards. Restaurants often face strong pressure to reduce costs. Managers regularly respond by hiring temporary or part-time workers and by trying to reduce the size of the workforce as much as possible, which makes it difficult to develop a personnel schedule that provides sufficient service to the customers. The problem gets even more complicated if (frequent) employee turnover and demand fluctuations occur and if employees have different experience levels. This paper presents mathematical models to support waitstaff scheduling at a restaurant chain based in Baku, Azerbaijan, taking into account the managerial requirements of the company. The problem we address is equivalent to a general tour scheduling problem that assigns waitstaff to work shifts throughout the week. We develop three integer programming models taking account of factors, such as employee types and experience levels, differences in the complexity of customer orders, and side tasks and responsibilities, to find the optimal number of employees together with the best tour for each of them. The models are solved to optimality, and the results are applied