Zucchi Giorgio, Iori Manuel, Subramanian Anand
FMB, Marco Biagi Foundation, University of Modena and Reggio Emilia, Largo Marco Biagi 10, 41121 Modena, Italy.
R&D Department, Coopservice S.coop.p.a, Via Rochdale 5, 42122 Reggio Emilia, Italy.
Optim Lett. 2021;15(4):1385-1396. doi: 10.1007/s11590-020-01648-2. Epub 2020 Oct 4.
This paper addresses a real-life personnel scheduling problem in the context of Covid-19 pandemic, arising in a large Italian pharmaceutical distribution warehouse. In this case study, the challenge is to determine a schedule that attempts to meet the contractual working time of the employees, considering the fact that they must be divided into mutually exclusive groups to reduce the risk of contagion. To solve the problem, we propose a mixed integer linear programming formulation (MILP). The solution obtained indicates that optimal schedule attained by our model is better than the one generated by the company. In addition, we performed tests on random instances of larger size to evaluate the scalability of the formulation. In most cases, the results found using an open-source MILP solver suggest that high quality solutions can be achieved within an acceptable CPU time. We also project that our findings can be of general interest for other personnel scheduling problems, especially during emergency scenarios such as those related to Covid-19 pandemic.
本文探讨了在新冠疫情背景下,意大利一家大型药品配送仓库出现的实际人员调度问题。在这个案例研究中,面临的挑战是确定一个试图满足员工合同工作时间的排班计划,同时要考虑到必须将他们分成相互独立的组以降低传染风险。为了解决这个问题,我们提出了一个混合整数线性规划模型(MILP)。得到的解决方案表明,我们模型获得的最优排班计划优于公司生成的计划。此外,我们对更大规模的随机实例进行了测试,以评估该模型的可扩展性。在大多数情况下,使用开源MILP求解器得到的结果表明,在可接受的CPU时间内可以获得高质量的解决方案。我们还预计,我们的研究结果对于其他人员调度问题可能具有普遍意义,特别是在与新冠疫情相关的紧急情况下。