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 条
  • [41] Efficient algorithms to minimize makespan of the unrelated parallel batch-processing machines scheduling problem with unequal job ready times
    Zarook, Yaser
    Rezaeian, Javad
    Mahdavi, Iraj
    Yaghini, Masoud
    RAIRO-OPERATIONS RESEARCH, 2021, 55 (03) : 1501 - 1522
  • [42] Variable neighborhood search approaches for scheduling jobs on parallel machines with sequence-dependent setup times, precedence constraints, and ready times
    Driessel, Rene
    Moench, Lars
    COMPUTERS & INDUSTRIAL ENGINEERING, 2011, 61 (02) : 336 - 345
  • [43] Scheduling Jobs on Parallel Machines with Sequence-Dependent Setup Times, Precedence Constraints, and Ready Times Using Variable Neighborhood Search
    Driessel, Rene
    Moench, Lars
    CIE: 2009 INTERNATIONAL CONFERENCE ON COMPUTERS AND INDUSTRIAL ENGINEERING, VOLS 1-3, 2009, : 273 - 278
  • [44] A variable neighborhood search approach for planning and scheduling of jobs on unrelated parallel machines
    Andrew Bilyk
    Lars Mönch
    Journal of Intelligent Manufacturing, 2012, 23 : 1621 - 1635
  • [45] A variable neighborhood search approach for planning and scheduling of jobs on unrelated parallel machines
    Bilyk, Andrew
    Moench, Lars
    JOURNAL OF INTELLIGENT MANUFACTURING, 2012, 23 (05) : 1621 - 1635
  • [46] Learning-Based Metaheuristic for Scheduling Unrelated Parallel Machines With Uncertain Setup Times
    Cheng, Chen-Yang
    Pourhejazy, Pourya
    Ying, Kuo-Ching
    Li, Shu-Fen
    Chang, Chieh-Wen
    IEEE ACCESS, 2020, 8 : 74065 - 74082
  • [47] A GRASP for a real-world scheduling problem with unrelated parallel print machines and sequence-dependent setup times
    Iori, Manuel
    Locatelli, Alberto
    Locatelli, Marco
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2023, 61 (21) : 7367 - 7385
  • [48] Unrelated parallel machine scheduling problem with stochastic sequence dependent setup times
    Tugba Saraç
    Feristah Ozcelik
    Mehmet Ertem
    Operational Research, 2023, 23
  • [49] Unrelated parallel machine scheduling problem with stochastic sequence dependent setup times
    Sarac, Tugba
    Ozcelik, Feristah
    Ertem, Mehmet
    OPERATIONAL RESEARCH, 2023, 23 (03)
  • [50] Algorithms for the Unrelated Parallel Machine Scheduling Problem with Sequence Dependent Setup Times
    Silva, Luciano Geraldo
    Rego, Marcelo Ferreira
    de Assis, Luciana Pereira
    Andrade, Alessandro Vivas
    2018 37TH INTERNATIONAL CONFERENCE OF THE CHILEAN COMPUTER SCIENCE SOCIETY (SCCC), 2018,
12345