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 条
  • [21] Heuristics for the unrelated parallel machine scheduling problem with setup times
    Rabadi, G
    Moraga, RJ
    Al-Salem, A
    JOURNAL OF INTELLIGENT MANUFACTURING, 2006, 17 (01) : 85 - 97
  • [22] Heuristics for the Unrelated Parallel Machine Scheduling Problem with Setup Times
    Ghaith Rabadi
    Reinaldo J. Moraga
    Ameer Al-Salem
    Journal of Intelligent Manufacturing, 2006, 17 : 85 - 97
  • [23] Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times
    Rocha, Pedro Leite
    Ravetti, Martin Gomez
    Mateus, Geraldo Robson
    Pardalos, Panos M.
    COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (04) : 1250 - 1264
  • [24] An Improved Firefly Algorithm for the Unrelated Parallel Machines Scheduling Problem With Sequence-Dependent Setup Times
    Ezugwu, Absalom E.
    Akutsah, Francis
    IEEE ACCESS, 2018, 6 : 54459 - 54478
  • [25] A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines
    Chen, Chun-Lung
    Chen, Chuen-Lung
    COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (11) : 3073 - 3081
  • [26] An adaptive large neighborhood search for unrelated parallel machine scheduling with setup times and delivery times
    Xie, Fulong
    Li, Kai
    Chen, Jianfu
    Xiao, Wei
    Zhou, Tao
    COMPUTERS & OPERATIONS RESEARCH, 2025, 177
  • [27] A two-stage Ant Colony Optimization algorithm to minimize the makespan on unrelated parallel machines with sequence-dependent setup times
    Jean-Paul Arnaout
    Ghaith Rabadi
    Rami Musa
    Journal of Intelligent Manufacturing, 2010, 21 : 693 - 701
  • [28] 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
  • [29] Scheduling unrelated parallel machines with a common server and sequence dependent setup times
    Raboudi, Houda
    Alpan, Gulgun
    Mangione, Fabien
    Tissot, Geoffrey
    Noel, Frederic
    IFAC PAPERSONLINE, 2022, 55 (10): : 2179 - 2184
  • [30] Iterated hybrid metaheuristic algorithms for unrelated parallel machines problem with unequal ready times and sequence-dependent setup times
    Chun-Lung Chen
    The International Journal of Advanced Manufacturing Technology, 2012, 60 : 693 - 705
12345