Staff scheduling and rostering problems, with application in several application areas, from transportation systems to hospitals, have been widely addressed by researchers. This is not the case of hospitality services, which have been forgotten by the quantitative research literature. The purpose of this paper is to provide some insights on the application of staff scheduling and rostering problems to hospitality management operations, reviewing existing approaches developed in other similar areas, such as nurse rostering or examining adaptable problem models, such as the tour scheduling.
In this work we propose a general integer programming model to address the staff scheduling problem, flexible enough to be easily adapted to a widerange of real-world problems. The model is applied with slight changes to two case studies: a glass plant and a continuous care unit, and also to a collection of benchmark instances available in the literature. The emphasis of our approach is on a novel formulation of sequence constraints and also on workload balance, which is tackled through cyclic scheduling. Models are solved using the CPLEX solver. Computational results indicate that optimal solutions can be achieved within a reasonable amount of time.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations鈥揷itations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.