Task assignment with start time-dependent processing times for personnel at check-in counters
- 297 Downloads
This paper addresses a task assignment problem encountered by check-in counter personnel at airports. The problem consists of assigning multiskilled agents to a sequence of tasks in check-in counters. Because each task’s ending time is fixed to comply with the flight schedule, its processing time depends on the arrival of the assigned agents. We propose a mixed-integer program and a branch-and-price algorithm to solve this problem. We exploit the problem structure to efficiently formulate the pricing problems and improve computation time. Using real-world data from a German ground-handling agency, we conduct numerical studies to evaluate the performance of the proposed solutions.
KeywordsTask scheduling Check-in counters Branch-and-price Workforce planning
This research was supported by the Erich-Becker-Stiftung, a foundation of Fraport AG. The authors are grateful to the anonymous referees for helpful and constructive suggestions.
- Caseau, Y., & Koppstein, P. (1992). A cooperative-architecture expert system for solving large time/travel assignment problems. In Database and expert systems applications (pp. 197–202). Vienna: Springer.Google Scholar
- Cordeau, J.-F., Desaulniers, G., Desrosiers, J., Solomon, M. M., & Soumis, F. (2001). The VRP with time windows. In P. Toth & D. Vigo (Eds.), The vehicle routing problem (pp. 157–193). Philadelphia: Society for Industrial and Applied Mathematics.Google Scholar
- Gleave, S. D. (2010). Possible revision of Directive 96/67/EC on access to the groundhandling market at Community airports. London.Google Scholar
- Smet, P., Wauters, T., Mihaylov, M., & Berghe, G. V. (2014). The shift minimisation personnel task scheduling problem: A new hybrid approach and computational insights. Omega, 46, 64–73.Google Scholar
- Yang, R. (1996). Solving a workforce management problem with constraint programming. In The 2nd international conference on the practical application of constraint technology (pp. 373–387). The Practical Application Company Ltd.Google Scholar
- Zamorano, E., & Stolletz, R. (2017). Branch-and-price approaches for the multiperiod technician routing and scheduling problem. European Journal of Operational Research, 257(1), 55–68.Google Scholar