Abstract
Abstract This paper addresses operation models for workforce planning for check-in systems at airports. We characterize different tasks of the hierarchical workforce planning problem with time-dependent demand. A binary linear programming formulation is developed for the fortnightly tour scheduling problem with flexible employee contracts. This binary programming model is solved for optimality by CPLEX for real-world demand scenarios with different workforce sizes. The numerical study analyzes the impact of the degree of flexibility and economies of scale. The model formulation is extended to generate convenient tours with regard to employee preferences.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
