A methodology is presented that determines the staff requirements for a baggage handling operation at an international airport facing high demand. It consists of two sequentially solved integer linear programming models. The first model determines the handler requirement using historical demand data and incorporates the operation’s spatial constraints. The second model, taking as input the results of the first model, defines each handler’s shift and task assignments. This formulation can be considered as the solution of a set covering problem using feasible shift structures pre-defined by an algorithm. The proposed approach is validated in an application to a real-world case, demonstrating significant improvements over the baggage handling operator’s own staff planning decisions.

提出了一种方法，该方法可以确定在面临高需求的国际机场进行行李处理操作的人员要求。它由两个顺序求解的整数线性规划模型组成。第一个模型使用历史需求数据确定处理人员需求，并结合操作的空间约束。第二个模型以第一个模型的结果为输入，定义每个处理程序的班次和任务分配。该公式可被视为使用算法预先定义的可行换挡结构的集合覆盖问题的解决方案。所提出的方法在一个实际案例中得到了验证，证明了对行李处理操作员自己的员工计划决策的重大改进。