当前位置: X-MOL 学术Int. Trans. Oper. Res. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Algorithms for the multiperiod workforce scheduling and routing problem with dependent tasks
International Transactions in Operational Research ( IF 3.1 ) Pub Date : 2021-03-22 , DOI: 10.1111/itor.12971
Vitor Notini Pontes 1 , Dilson Lucas Pereira 2
Affiliation  

Logistics problems lie at the core of industries' everyday operations. These types of problems are also one of the main points of interest in the operational research field of study. In recent years, the workforce scheduling and routing problems (WSRP) class of optimization problems has gained significant attention from researchers. In this paper, a recently proposed WSRP is studied: the multiperiod WSRP with dependent tasks. In this problem, a given company provides services by means of heterogeneously skilled mobile teams. Service requests are known beforehand and each service is composed of one or more activities. Execution of one activity may depend on the completion of another. A feasible schedule in which the requested activities are completed in the minimum amount of days must be provided. Two matheuristic algorithms are proposed. Several new upper bounds for a set of instances from the literature are discovered.

中文翻译:

具有相关任务的多周期劳动力调度和路由问题的算法

物流问题是行业日常运营的核心。这些类型的问题也是运筹学研究领域的主要兴趣点之一。近年来,劳动力调度和路由问题 (WSRP) 类优化问题引起了研究人员的极大关注。在本文中,研究了最近提出的 WSRP:具有相关任务的多周期 WSRP。在这个问题中,给定的公司通过具有异构技能的移动团队提供服务。服务请求是预先知道的,每个服务由一个或多个活动组成。一项活动的执行可能取决于另一项活动的完成。必须提供一个可行的时间表,其中要求的活动在最短的天数内完成。提出了两种数学算法。
更新日期:2021-03-22
down
wechat
bug