Embedding ant system in genetic algorithm for re-entrant hybrid flow shop scheduling problems with time window constraints

被引:0
|
作者
Chettha Chamnanlor
Kanchana Sethanan
Mitsuo Gen
Chen-Fu Chien
机构
[1] Khon Kaen University,Department of Industrial Engineering, Faculty of Engineering
[2] Tokyo University of Science,Department of Industrial Engineering and Engineering Management
[3] Fuzzy Logic Systems Institute,undefined
[4] National Tsing Hua University,undefined
来源
关键词
Reentrant flexible flow shop; Time window; Hybrid genetic algorithm; Ant colony optimization; Local search;
D O I
暂无
中图分类号
学科分类号
摘要
This paper focuses on minimizing the makespan for a reentrant hybrid flow shop scheduling problem with time window constraints (RHFSTW), which is often found in manufacturing systems producing the slider part of hard-disk drive products, in which production needs to be monitored to ensure high quality. For this reason, production time control is required from the starting-time-window stage to the ending-time-window stage. Because of the complexity of the RHFSTW problem, in this paper, genetic algorithm hybridized ant colony optimization (GACO) is proposed to be used as a support tool for scheduling. The results show that the GACO can solve problems optimally with reasonable computational effort.
引用
收藏
页码:1915 / 1931
页数:16
相关论文
共 50 条
  • [41] Proactive maintenance scheduling in a re-entrant flow shop using Lagrangian decomposition coordination method
    Kaihara, T.
    Fujii, N.
    Tsujibe, A.
    Nonaka, Y.
    CIRP ANNALS-MANUFACTURING TECHNOLOGY, 2010, 59 (01) : 453 - 456
  • [42] An efficient genetic algorithm for hybrid flow shop scheduling with multiprocessor task problems
    Engin, Orhan
    Ceran, Gulsad
    Yilmaz, Mustafa K.
    APPLIED SOFT COMPUTING, 2011, 11 (03) : 3056 - 3065
  • [43] A Hybrid Genetic Algorithm and Particle Swarm Optimization for Flow Shop Scheduling Problems
    Alvarez Pomar, Lindsay
    Cruz Pulido, Elizabeth
    Tovar Roa, Julian Dario
    APPLIED COMPUTER SCIENCES IN ENGINEERING, 2017, 742 : 601 - 612
  • [44] A hybrid genetic algorithm for the job shop scheduling problems
    Park, BJ
    Choi, HR
    Kim, HS
    COMPUTERS & INDUSTRIAL ENGINEERING, 2003, 45 (04) : 597 - 613
  • [45] An improved multi-objective evolutionary algorithm based on decomposition for solving re-entrant hybrid flow shop scheduling problem with batch processing machines
    Wu, Xiuli
    Cao, Zheng
    COMPUTERS & INDUSTRIAL ENGINEERING, 2022, 169
  • [46] A hybrid genetic algorithm for the job shop scheduling problems
    Tao, Z
    Xie, LY
    Hao, CZ
    PROCEEDINGS OF THE 11TH INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT, VOLS 1 AND 2: INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT IN THE GLOBAL ECONOMY, 2005, : 335 - 339
  • [47] Series production in a basic re-entrant shop to minimize makespan or total flow time
    Chu, Feng
    Chu, Chengbin
    Desprez, Caroline
    COMPUTERS & INDUSTRIAL ENGINEERING, 2010, 58 (02) : 257 - 268
  • [48] Energy-efficient distributed heterogeneous re-entrant hybrid flow shop scheduling problem with sequence dependent setup times considering factory eligibility constraints
    Geng, Kaifeng
    Liu, Li
    Wu, Zhanyong
    SCIENTIFIC REPORTS, 2022, 12 (01)
  • [49] A Genetic Algorithm for Hybrid Job-Shop Scheduling Problems with Minimizing the Makespan or Mean Flow Time
    Gholami, Omid
    Sotskov, Yuri N.
    Werner, Frank
    JOURNAL OF ADVANCED MANUFACTURING SYSTEMS, 2018, 17 (04) : 461 - 486
  • [50] Energy-efficient distributed heterogeneous re-entrant hybrid flow shop scheduling problem with sequence dependent setup times considering factory eligibility constraints
    Kaifeng Geng
    Li Liu
    Zhanyong Wu
    Scientific Reports, 12