Matheuristics for a parallel machine scheduling problem with non-anticipatory family setup times: Application in the offshore oil and gas industry

被引：15

作者：

Abu-Marrul, Victor ^{[1
]}

Martinelli, Rafael ^{[1
]}

Hamacher, Silvio ^{[1
]}

Gribkovskaia, Irina ^{[2
]}

机构：

[1] Pontifical Catholic Univ Rio de Janeiro PUC Rio, Marques de Sao Vicente 225, BR-22451900 Rio De Janeiro, RJ, Brazil

[2] Molde Univ Coll, Specialized Univ Logist HiMolde, Britvegen 2, N-6410 Molde, Norway

来源：

COMPUTERS & OPERATIONS RESEARCH | 2021年 / 128卷

关键词：

Parallel machine scheduling; Family scheduling; Batch scheduling; Matheuristic; Offshore industry logistics; Ship scheduling; MINIMIZING TOTAL TARDINESS; OPTIMIZATION; GRASP;

D O I：

10.1016/j.cor.2020.105162

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

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 MIPbased 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. (c) 2020 Elsevier Ltd. All rights reserved.

引用

页数：19

共 40 条

[31] Scheduling with batching: A review [J].