An insertion heuristic manpower scheduling for in-flight catering service application

  • Authors:

  • San-Nah Sze;Ada Ng Suk-Fong;Kang-Leng Chiew

  • Affiliations:

  • Department of Computational Science and Mathematics, Faculty of Computer Science and Information Technology, Universiti Malaysia Sarawak, Malaysia;Institute of Transport and Logistics Studies, Faculty of Economics and Business, The University of Sydney, NSW, Australia;Department of Computational Science and Mathematics, Faculty of Computer Science and Information Technology, Universiti Malaysia Sarawak, Malaysia

  • Venue:
  • ICCL'12 Proceedings of the Third international conference on Computational Logistics
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper studies the manpower scheduling for in-flight catering loading operations. Package meals are delivered from a common service centre to aircrafts at apron. All aircrafts must be served within the period upon arrivals and prior to departures using loading trucks. The scheduling process takes into account complex considerations such as meal break allocation, multiple trip traveling and food exposure time limit. Given the aircrafts movement and predefined maximum working hours for each loading team, the core puzzle of this study is to assign minimum number of loading teams to the aircrafts and to form a roster. An insertion based heuristic is proposed to generate the solutions in a short amount of time for large instances. Due to the presence of numerous constraints, the insertion heuristic is implemented in stages for constructing trips. Computational results show that the insertion heuristic is more efficient and outperforms the actual roster of a Malaysian in-flight caterer.