Operational workforce planning for check-in counters at airports
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.
Volume (Year): 46 (2010)
Issue (Month): 3 (May)
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/bibliographic|
When requesting a correction, please mention this item's handle: RePEc:eee:transe:v:46:y:2010:i:3:p:414-425. See general information about how to correct material in RePEc.
If references are entirely missing, you can add them using this form.