论文标题
非审判家庭设置时间的平行机器调度问题的数学学时间：在海上石油和天然气行业中应用
Matheuristics for a Parallel Machine Scheduling Problem with Non-Anticipatory Family Setup Times: Application in the Offshore Oil and Gas Industry
论文作者
论文摘要
在本文中，我们通过相同的并行机器和非访问性家庭设置时间解决了批处理调度问题的变体，以最大程度地减少加权完成时间。我们使用建设性的启发式和两个基于MIP的邻域搜索来解决问题，以考虑两种批次调度计划数学公式，以解决该问题。该问题来自与海上石油和天然气物流有关的船舶调度问题，管道铺设支撑船计划问题（PLSVSP）。根据72个实例的基准进行的实验，开发的方法克服了PLSVSP文献中当前的解决方案方法，这些实验在计算时间和解决方案质量方面具有不同的大小和特征。为所有中型和大型实例提供了新的最佳解决方案，从而在最佳情况的目标功能中降低了10％以上。
In this paper, we address a variant of a batch scheduling problem with identical parallel machines and non-anticipatory family setup times to minimize the total weighted completion time. We developed an ILS and a GRASP matheuristics to solve the problem using a constructive heuristic and two MIP-based neighborhood searches, considering two batch scheduling mathematical formulations. The problem derives from a ship scheduling problem related to offshore oil & gas logistics, the Pipe Laying Support Vessel Scheduling Problem (PLSVSP). The developed methods overcome the current solution approaches in the PLSVSP literature, according to experiments carried out on a benchmark of 72 instances, with different sizes and characteristics, in terms of computational time and solution quality. New best solutions are provided for all medium and large-sized instances, achieving a reduction of more than 10% in the objective function of the best case.
