This article presents a two-stage workforce scheduling approach for security guards at motor traffic gates. In the first stage, staffing requirements are determined based on analyzing workload variations for each gate. In the second stage, an integer programming model is formulated to assign guards to different work shifts in order to satisfy the staffing requirements of each gate. The objective is to minimize the total labour cost of two categories of security employees: non-supervising (guards), and supervising (supervisors). The new model considers multiple employee types, multiple shifts, and multiple locations, where security employees are assigned to work groups. Moreover, to maximize flexibility, each employee can be assigned to work at different gates during different shifts. Compared to the currently used schedule, the model produced an optimum work schedule that reduced the workforce size by 23% and the labour cost by 26%. Computational experiments with 40 randomly generated test problems confirmed the high savings potential of the proposed scheduling approach.

本文提出了一种针对机动交通口的保安人员的两阶段劳动力调度方法。在第一阶段，根据分析每个闸门的工作量变化来确定人员需求。在第二阶段，制定了整数规划模型，以将警卫分配给不同的工作班次，以满足每个登机口的人员需求。目的是最大程度地减少两类安全员工的总人工成本：非监督人员（警卫）和监督人员（主管）。新模型考虑了多个员工类型，多个班次和多个位置，在这些位置将安全员工分配到了工作组。此外，为了最大程度地提高灵活性，可以将每个员工分配到不同班次的不同部门工作。与当前使用的时间表相比，该模型产生了最佳的工作计划，使劳动力规模减少了23％，劳动力成本减少了26％。具有40个随机生成的测试问题的计算实验证实了所提出的调度方法具有很高的节省潜力。