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 条
  • [1] Embedding ant system in genetic algorithm for re-entrant hybrid flow shop scheduling problems with time window constraints
    Chamnanlor, Chettha
    Sethanan, Kanchana
    Gen, Mitsuo
    Chien, Chen-Fu
    JOURNAL OF INTELLIGENT MANUFACTURING, 2017, 28 (08) : 1915 - 1931
  • [2] A hybrid genetic algorithm for the re-entrant flow-shop scheduling problem
    Chen, Jen-Shiang
    Pan, Jason Chao-Hsien
    Lin, Chien-Min
    EXPERT SYSTEMS WITH APPLICATIONS, 2008, 34 (01) : 570 - 577
  • [3] A re-entrant hybrid flow shop scheduling problem with machine eligibility constraints
    Zhang, Xiang Yi
    Chen, Lu
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2018, 56 (16) : 5293 - 5305
  • [4] Minimizing total completion time for re-entrant flow shop scheduling problems
    Jing, Caixia
    Huang, Wanzhen
    Tang, Guochun
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (48) : 6712 - 6719
  • [5] Design of a genetic algorithm for bi-objective flow shop scheduling problems with re-entrant jobs
    Lee, Carman K. M.
    Lin, Danping
    Ho, William
    Wu, Zhang
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2011, 56 (9-12): : 1105 - 1113
  • [6] Design of a genetic algorithm for bi-objective flow shop scheduling problems with re-entrant jobs
    Carman K. M. Lee
    Danping Lin
    William Ho
    Zhang Wu
    The International Journal of Advanced Manufacturing Technology, 2011, 56 : 1105 - 1113
  • [7] Integrating analytical hierarchy process to genetic algorithm for re-entrant flow shop scheduling problem
    Lin, Danping
    Lee, C. K. M.
    Wu, Zhang
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2012, 50 (07) : 1813 - 1824
  • [8] Re-entrant flow shop scheduling problem with time windows using hybrid genetic algorithm based on auto-tuning strategy
    Chamnanlor, Chettha
    Sethanan, Kanchana
    Chien, Chen-Fu
    Gen, Mitsuo
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2014, 52 (09) : 2612 - 2629
  • [9] Green re-entrant hybrid flow shop scheduling problem considering multiple time factors
    Geng K.
    Ye C.
    Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2023, 29 (01): : 75 - 90
  • [10] A model for a Special Re-entrant Flow Shop Scheduling
    Cai, Yue
    Wang, Jian
    Li, Hua
    2010 INTERNATIONAL CONFERENCE ON INFORMATION, ELECTRONIC AND COMPUTER SCIENCE, VOLS 1-3, 2010, : 1887 - 1891