Objective increment based hybrid GA for no-wait flowshops

被引:2
|
作者
Zhu, Xia [1 ]
Li, Xiaoping
Wang, Qian
机构
[1] Southeast Univ, Sch Comp Sci & Engn, Nanjing, Peoples R China
基金
中国国家自然科学基金;
关键词
no-wait flowshops; flowtime; objective increment; hybrid genetic algorithm;
D O I
10.1109/ICMLC.2008.4620545
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
No-wait flowshops with flowtime minimization are typical NP-Complete combinatorial optimization problems, widely existing in practical manufacturing systems. Different from traditional methods by which objective of a new schedule being completely computed objective increment methods are presented in (his paper by which the objective of an offspring being obtained just by objective increments and computational time can be considerably reduced. HGAI (Hybrid GA based on objective Increment) is proposed by integrating genetic algorithm with a local search method. A heuristic is constructed to generate an individual of initial population and a crossover operator is introduced for mating process. HGAI is compared with two best so far algorithms for the considered problem on 110 benchmark instances. Computational results show that HGAI outperforms the existing two in effectiveness with a little more computation time.
引用
收藏
页码:969 / +
页数:3
相关论文
共 50 条
  • [1] Objective increment based metaheuristic for total flowtime minimization in no-wait flowshops
    Zhu, Xia
    Li, Xiaoping
    Wang, Qian
    [J]. Journal of Southeast University (English Edition), 2008, 24 (02) : 168 - 173
  • [2] Total-idle-time increment based hybrid GA for no-wait flowshops with makespan minimization
    Zhu, Xia
    Li, Xiaoping
    Wang, Qian
    [J]. Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2011, 48 (03): : 455 - 463
  • [3] A new heuristic for minimal makespan in no-wait hybrid flowshops
    Chang, Junlin
    Ma, Guangfu
    Ma, Xiaoping
    [J]. 2006 CHINESE CONTROL CONFERENCE, VOLS 1-5, 2006, : 395 - +
  • [4] MINIMIZING TOTAL TARDINESS IN NO-WAIT FLOWSHOPS
    Aldowaisan, Tariq
    Allahverdi, Ali
    [J]. FOUNDATIONS OF COMPUTING AND DECISION SCIENCES, 2012, 37 (03) : 149 - 162
  • [5] No-wait flowshops with bicriteria of makespan and maximum lateness
    Allahverdi, A
    Aldowaisan, T
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2004, 152 (01) : 132 - 147
  • [6] A Metaheuristic for No-wait Flowshops with Variable Processing Times
    Xu, Yi
    Li, Xiaoping
    Shi, Chaomin
    Cui, Mingyu
    Cao, Xincheng
    Ge, Yanyan
    [J]. PROCEEDINGS OF THE 2018 IEEE 22ND INTERNATIONAL CONFERENCE ON COMPUTER SUPPORTED COOPERATIVE WORK IN DESIGN ((CSCWD)), 2018, : 479 - 484
  • [7] New heuristics for no-wait flowshops to minimize makespan
    Aldowaisan, T
    Allahverdi, A
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2003, 30 (08) : 1219 - 1231
  • [8] Scheduling and lot streaming in flowshops with no-wait in process
    Hall, NG
    Laporte, G
    Selvarajah, E
    Sriskandarajah, C
    [J]. JOURNAL OF SCHEDULING, 2003, 6 (04) : 339 - 354
  • [9] Scheduling and Lot Streaming in Flowshops with No-Wait in Process
    Nicholas G. Hall
    Gilbert Laporte
    Esaignani Selvarajah
    Chelliah Sriskandarajah
    [J]. Journal of Scheduling, 2003, 6 : 339 - 354
  • [10] Some heuristics for no-wait flowshops with total tardiness criterion
    Liu, Gengcheng
    Song, Shiji
    Wu, Cheng
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (02) : 521 - 525