An Insertion Heuristic Manpower Scheduling for In-Flight Catering Service Application
This paper studies the manpower scheduling for inflight 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.
Multi-trip Manpower scheduling Time windows Vehicle routing
San-Nah Sze Ada Ng Suk-Fong Kang-Leng Chiew
Department of Computational Science and Mathematics, Faculty of Computer Science and Information Tec Institute of Transport and Logistics Studies, Faculty of Economics and Business, The University of S
国际会议
Third International Conference ,ICCL2012(第三届国际计算物流会议)
上海
英文
206-216
2012-09-24（万方平台首次上网日期，不代表论文的发表时间）