An Iterated Local Search Heuristic for the Staff Scheduling Problem for Part-Time Employees in Japan
An Iterated Local Search Heuristic for the Staff Scheduling Problem for Part-Time Employees in Japan
复制标题
日本兼职员工的员工调度问题的迭代本地搜索启发式
DOI：
10.1142/s0217595921500378
复制
发表时间：
2021
影响因子：
1.4
通讯作者：
A. Ikegami
中科院分区：
文献类型：
--
作者：
W. Wu;N. Katoh;A. Ikegami
在本文中，我们介绍了一个数学规划模型来解决一个工作人员调度问题的基础上，一天的职责（任务模式）的个人工作人员。该模型可以适应各种服务类型、管理策略和员工偏好。我们首先列举了所有可行的一天的职责，并提出了一个迭代的本地搜索方法，结合了各种方法，包括一个尺寸减小的方法和一个非常大规模的邻域搜索。对于超大规模的邻域搜索，我们设计了一种动态规划方法，旨在找到最佳的改进计划，并可以用于重新调度阶段。计算结果表明，该模型和所提出的算法在日本的真实世界的情况下表现良好。
In this paper, we introduce a mathematical programming model for solving a staff scheduling problem based on one-day duties (task patterns) of individual staff members. The model can accommodate various service types, management policies, and staff preferences. We first enumerate all feasible one-day duties and propose an iterated local search approach that incorporates various methodologies, including a size-reduction method and a very large-scale neighborhood search. For the very large-scale neighborhood search, we design a dynamic programming method that aims to find the most improved schedule and can be used in the rescheduling stage. Computational results show that the model and the proposed algorithm perform well for real-world instances in Japan.