A variable neighborhood descent heuristic for the problem of makespan minimisation on unrelated parallel machines with setup times

被引：27

作者：

Fleszar, Krzysztof ^{[1
]}

Charalambous, Christoforos ^{[2
]}

Hindi, Khalil S. ^{[1
]}

机构：

[1] AUB, Olayan Sch Business, Beirut 11072020, Lebanon

[2] Frederick Univ, Dept Comp Sci & Engn, CY-1303 Nicosia, Cyprus

来源：

JOURNAL OF INTELLIGENT MANUFACTURING | 2012年 / 23卷 / 05期

关键词：

Parallel machine scheduling; Hybrid optimization; Neighborhood search; Makespan minimization; Mixed-integer programming; MULTI-EXCHANGE NEIGHBORHOOD; TOTAL WEIGHTED TARDINESS; SCHEDULING PROBLEM; ALGORITHM; SEQUENCE; APPROXIMATION; SEARCH;

D O I：

10.1007/s10845-011-0522-8

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

The NP-hard problem of scheduling jobs on unrelated parallel machines, in the presence of machine-dependent and sequence-dependent setup times, with the objective of minimizing the makespan, is considered. A variable neighborhood descent search algorithm, hybridized with mathematical programming elements, is presented and its performance is evaluated on a large set of benchmark problem instances. The extensive computational experiments show that the proposed algorithm outperforms previously proposed methods in terms of solution quality as well as computation time.

引用

页码：1949 / 1958

页数：10

共 50 条

[1] A variable neighborhood descent heuristic for the problem of makespan minimisation on unrelated parallel machines with setup times
Krzysztof Fleszar
Christoforos Charalambous
Khalil S. Hindi
Journal of Intelligent Manufacturing, 2012, 23 : 1949 - 1958
[2] Makespan minimization for scheduling unrelated parallel machines with setup times
Ying, Kuo-Ching
Lee, Zne-Jung
Lin, Shih-Wei
JOURNAL OF INTELLIGENT MANUFACTURING, 2012, 23 (05) : 1795 - 1803
[3] VARIABLE NEIGHBORHOOD DESCENT FOR THE UNRELATED PARALLEL MACHINE SCHEDULING PROBLEM
Charalambous, Christoforos
Fleszar, Krzysztof
INTERNATIONAL JOURNAL ON ARTIFICIAL INTELLIGENCE TOOLS, 2012, 21 (04)
[4] Analysis of variable neighborhood descent as a local search operator for total weighted tardiness problem on unrelated parallel machines
Marinho Diana, Rodney Oliveira
de Souza, Sergio Ricardo
COMPUTERS & OPERATIONS RESEARCH, 2020, 117
[5] A Clonal Selection Algorithm for Makespan Minimization on Unrelated Parallel Machines with Sequence Dependent Setup Times
Diana, Rodney O. M.
Filho, Moacir F. de F.
de Souza, Sergio R.
Silva, Maria Amelia L.
2013 BRAZILIAN CONFERENCE ON INTELLIGENT SYSTEMS (BRACIS), 2013, : 57 - 63
[6] A worm optimization algorithm to minimize the makespan on unrelated parallel machines with sequence-dependent setup times
Arnaout, Jean-Paul
ANNALS OF OPERATIONS RESEARCH, 2020, 285 (1-2) : 273 - 293
[7] A two-stage Ant Colony Optimization algorithm to minimize the makespan on unrelated parallel machines with sequence-dependent setup times
Arnaout, Jean-Paul
Rabadi, Ghaith
Musa, Rami
JOURNAL OF INTELLIGENT MANUFACTURING, 2010, 21 (06) : 693 - 701
[8] A Modified Variable Neighborhood Search for Minimizing the Makespan on Identical Parallel Machines
Sevkli, Mehmet
Uysal, Hatice
CIE: 2009 INTERNATIONAL CONFERENCE ON COMPUTERS AND INDUSTRIAL ENGINEERING, VOLS 1-3, 2009, : 108 - +
[9] Integrated maintenance and production scheduling for unrelated parallel machines with setup times
Geurtsen, Michael
Adan, Jelle
Akcay, Alp
FLEXIBLE SERVICES AND MANUFACTURING JOURNAL, 2024, 36 (03) : 1046 - 1079
[10] Constructive heuristics for the unrelated parallel machines scheduling problem with machine eligibility and setup times
Perez-Gonzalez, Paz
Fernandez-Viagas, Victor
Zamora Garcia, Miguel
Framinan, Jose M.
COMPUTERS & INDUSTRIAL ENGINEERING, 2019, 131 : 131 - 145

← 1 2 3 4 5 →