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 条
12345