This paper introduces the heterogeneous multicrew scheduling and routing problem (MCSRP) in road restoration. The MCSRP consists of identifying the schedule and route of heterogeneous crews that must perform the restoration of damaged nodes used in the paths to connect a source node to demand nodes in a network affected by extreme events. The objective is to minimize the accessibility time defined as the time that the demand nodes remain unconnected from the source node. The main contributions of the paper include three novel mathematical formulations that differ in the way of modeling the scheduling decisions and the synchronization of the crews, and the development of valid inequalities based on some particular properties of the problem. Additionally, we prove that the MCSRP is NP-hard. Extensive numerical experiments with randomly generated instances and a case study based on floods and landslides disasters in Rio de Janeiro, Brazil, are performed to assess the efficiency and applicability of our approach. In particular, we show that the valid inequalities significantly improve the solvability of the mathematical models. In terms of managerial implications, our results suggest that the incorporation of multiple crews helps to reduce the worst-case accessibility times across the demand nodes, thus providing more equitable solutions.

本文介绍了道路修复中的异构多机组调度与路由问题（MCSRP）。MCSRP包括标识必须执行恢复在极端事件影响的网络中将源节点连接到需求节点的路径中使用的损坏节点的异类人员的时间表和路由。目的是使可访问性时间最小化，可访问性时间定义为需求节点与源节点保持不连接的时间。本文的主要贡献包括三种新颖的数学公式，它们在调度计划决策和机组人员同步的建模方式以及基于问题的某些特定性质的有效不等式发展方面各有不同。此外，我们证明MCSRP是NP硬的。在巴西里约热内卢进行了以随机生成的实例为基础的大量数值实验以及一个基于洪水和滑坡灾害的案例研究，以评估我们方法的有效性和适用性。特别地，我们表明有效的不等式显着改善了数学模型的可解性。在管理方面，我们的结果表明，多个工作人员的加入有助于减少需求节点之间最坏情况下的可访问时间，从而提供更公平的解决方案。