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
关键词
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 条
[11]  
Cunha V., 2017, 12 ED MET INT C MIC, P552
[12]   An ILS heuristic for the ship scheduling problem: application in the oil industry [J].
Cunha, Victor ;
Santos, Iuri ;
Pessoa, Luciana ;
Hamacher, Silvio .
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2020, 27 (01) :197-218
[13]   Minimizing total completion time in the two-machine no-idle no-wait flow shop problem [J].
Della Croce, Federico ;
Grosso, Andrea ;
Salassa, Fabio .
JOURNAL OF HEURISTICS, 2021, 27 (1-2) :159-173
[14]   A matheuristic approach for the two-machine total completion time flow shop problem [J].
Della Croce, Federico ;
Grosso, Andrea ;
Salassa, Fabio .
ANNALS OF OPERATIONS RESEARCH, 2014, 213 (01) :67-78
[15]   An application of unrelated parallel machine scheduling with sequence-dependent setups at Vestel Electronics [J].
Ekici, Ali ;
Elyasi, Milad ;
Ozener, Okan Orsan ;
Sarikaya, Merve Burcu .
COMPUTERS & OPERATIONS RESEARCH, 2019, 111 :130-140
[16]   Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources [J].
Fanjul-Peyro, Luis ;
Perea, Federico ;
Ruiz, Ruben .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2017, 260 (02) :482-493
[17]   New decomposition methods for home care scheduling with predefined visits [J].
Grenouilleau, Florian ;
Lahrichi, Nadia ;
Rousseau, Louis-Martin .
COMPUTERS & OPERATIONS RESEARCH, 2020, 115
[18]  
Haddad E, 2010, 50 C EUR REG SCI ASS
[19]  
Hansen P, 2003, INT SER OPER RES MAN, V57, P145, DOI 10.1007/0-306-48056-5_6
[20]   A GRASP for simultaneously assigning and sequencing product families on flexible assembly lines [J].
Heath, Susan K. ;
Bard, Jonathan F. ;
Morrice, Douglas J. .
ANNALS OF OPERATIONS RESEARCH, 2013, 203 (01) :295-323