A genetic algorithm for the hybrid flow shop scheduling with unrelated machines and machine eligibility

被引：100
作者：
Yu, Chunlong [1 ]
Semeraro, Quirico [1 ]
Matta, Andrea [1 ]
机构：
[1] Politecn Milan, Dipartimento Meccan, Milan, Italy
来源：
COMPUTERS & OPERATIONS RESEARCH | 2018年 / 100卷
关键词：
Scheduling; Hybrid flow shop; Genetic algorithm; SEQUENCE-DEPENDENT SETUP; PARALLEL MACHINES; TOTAL TARDINESS; SEARCH ALGORITHM; TIMES; FLOWSHOPS; SYSTEM; OPTIMIZATION; CONSTRAINTS; INDUSTRY;
D O I：
10.1016/j.cor.2018.07.025
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
This paper presents a genetic algorithm to solve the hybrid flow shop scheduling problem to minimize the total tardiness. Practical assumptions as unrelated machines and machine eligibility are considered. The proposed algorithm incorporates a new decoding method developed for total tardiness objective, which is able to obtain tight schedule meanwhile guarantee the influence of the chromosome on the schedule. The proposed algorithm has been calibrated with a full factorial design of experiment, and compared to several calibrated state-of-art algorithms on 450 instances with different size and correlation patterns of operation processing time. The results validate the effectiveness of the proposed algorithm. (C) 2018 Elsevier Ltd. All rights reserved.
引用
收藏
页码：211 / 229
页数：19
相关论文
共 50 条
  • [21] A genetic algorithm for three-stage hybrid flow shop scheduling problem with dedicated machines
    Bedhief A.O.
    Dridi N.
    [J]. Journal Europeen des Systemes Automatises, 2020, 53 (03): : 357 - 368
  • [22] A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks
    Oguz, C
    Ercan, M
    [J]. JOURNAL OF SCHEDULING, 2005, 8 (04) : 323 - 351
  • [23] A Genetic Algorithm for Hybrid Flow-shop Scheduling with Multiprocessor Tasks
    Ceyda Oĝuz
    M. Fikret Ercan
    [J]. Journal of Scheduling, 2005, 8 : 323 - 351
  • [24] JOB SCHEDULING WITH THE HELP OF DOMINANCE PROPERTIES AND GENETIC ALGORITHM ON HYBRID FLOW SHOP PROBLEM
    Alcan, Pelin
    Basligil, Huseyin
    [J]. SIGMA JOURNAL OF ENGINEERING AND NATURAL SCIENCES-SIGMA MUHENDISLIK VE FEN BILIMLERI DERGISI, 2015, 6 (01): : 127 - 137
  • [25] A hybrid genetic algorithm for the hybrid flow shop scheduling problem with machine blocking and sequence-dependent setup times
    Ferreira Maciel, Ingrid Simoes
    Prata, Bruno de Athayde
    Nagano, Marcelo Seido
    de Abreu, Levi Ribeiro
    [J]. JOURNAL OF PROJECT MANAGEMENT, 2022, : 201 - 216
  • [26] Lagrangian relaxation approach to minimizing makespan in hybrid flow shop scheduling problem with unrelated parallel machines
    Asadi-Gangraj, E.
    [J]. SCIENTIA IRANICA, 2018, 25 (06) : 3765 - 3775
  • [27] The hybrid flow shop scheduling problem
    Ruiz, Ruben
    Antonio Vazquez-Rodriguez, Jose
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 205 (01) : 1 - 18
  • [28] A biogeography-based optimisation algorithm for a realistic no-wait hybrid flow shop with unrelated parallel machines to minimise mean tardiness
    Rabiee, M.
    Jolai, F.
    Asefi, H.
    Fattahi, P.
    Lim, S.
    [J]. INTERNATIONAL JOURNAL OF COMPUTER INTEGRATED MANUFACTURING, 2016, 29 (09) : 1007 - 1024
  • [29] Design of an efficient genetic algorithm for resource-constrained unrelated parallel machine scheduling problem with machine eligibility restrictions
    Afzalirad, Mojtaba
    Shafipour, Masoud
    [J]. JOURNAL OF INTELLIGENT MANUFACTURING, 2018, 29 (02) : 423 - 437
  • [30] A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations
    Fattahi, Parviz
    Hosseini, Seyed Mohammad Hassan
    Jolai, Fariborz
    Tavakkoli-Moghaddam, Reza
    [J]. APPLIED MATHEMATICAL MODELLING, 2014, 38 (01) : 119 - 134
12345