IMOEA/D to optimize job release problem for a reentrant hybrid flow shop

被引:5
|
作者
Yan, Xiaoyan [1 ]
Wu, Xiuli [1 ]
机构
[1] Univ Sci & Technol Beijing, Sch Mech Engn, 30 Xueyuan Rd, Beijing, Peoples R China
基金
中国国家自然科学基金;
关键词
Job release problem; Reentrant hybrid flow shop; IMOEA; D; Release quantities; Release intervals; WIP control mechanism; SCHEDULING PROBLEM; ALGORITHM; MOEA/D; CONWIP;
D O I
10.1016/j.cie.2021.107800
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
In a reentrant production system, an effective job release policy is helpful to increase output and keep the work in process (WIP) in an acceptable level. This study mainly focuses on the job release problem in a reentrant hybrid flow shop (RHFS-JRP). First, to increase output and reduce jobs' waiting time, a mathematical model is formulated to minimize the difference between the actual output and the target output and the total waiting time of jobs jointly. Second, an improved multi-objective evolutionary algorithm based on decomposition (IMOEA/D) is proposed to solve the RHFS-JRP. Third, to generate job release plans effectively, a dual chromosome encoding method indicating release quantities and release intervals is proposed. Fourth, the WIP control mechanism based decoding algorithm is proposed to reduce the total waiting time of jobs without affecting output. Fifth, to avoid falling into the local optimum and ensure the diversity of the population, an adaptive neighborhood updating strategy is proposed. Finally, numerical experiments are performed and the results show that the IMOEA/D can solve the RHFS-JRP effectively.
引用
收藏
页数:15
相关论文
共 50 条
  • [1] Optimizing job release and scheduling jointly in a reentrant hybrid flow shop
    Wu, Xiuli
    Yan, Xiaoyan
    Wang, Ling
    EXPERT SYSTEMS WITH APPLICATIONS, 2022, 209
  • [2] On the connection between a cyclic job shop and a reentrant flow shop scheduling problem
    Steiner, George
    Xue, Zhihui
    JOURNAL OF SCHEDULING, 2006, 9 (04) : 381 - 387
  • [3] On the connection between a cyclic job shop and a reentrant flow shop scheduling problem
    George Steiner
    Zhihui Xue
    Journal of Scheduling, 2006, 9 : 381 - 387
  • [4] An Improved Q Learning Algorithm to Optimize Green Dynamic Scheduling Problem in a Reentrant Hybrid Flow Shop
    Wu, Xiuli
    Yan, Xiaoyan
    Jixie Gongcheng Xuebao/Journal of Mechanical Engineering, 2023, 59 (13): : 246 - 259
  • [5] Reentrant hybrid flow shop scheduling problem with renewable energy
    Dong J.
    Ye C.
    Wan M.
    Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2022, 28 (04): : 1112 - 1128
  • [6] Solving the Reentrant Permutation Flow-Shop Scheduling Problem with a Hybrid Genetic Algorithm
    Chen, Jen Shiang
    Pan, Jason Chao Hsien
    Lin, Chien Min
    INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING-THEORY APPLICATIONS AND PRACTICE, 2009, 16 (01): : 23 - 31
  • [7] Iterated Greedy Algorithm for Solving a Hybrid Flow Shop Scheduling Problem with Reentrant Jobs
    Zhang, Qi
    Tian, Zheng
    Wang, Sen
    Liu, Shixin
    PROCEEDINGS OF THE 32ND 2020 CHINESE CONTROL AND DECISION CONFERENCE (CCDC 2020), 2020, : 5636 - 5641
  • [8] A Hybrid Differential Evolution Algorithm for the Multi-objective Reentrant Job-shop Scheduling Problem
    Qian, B.
    Li, Z. H.
    Hu, R.
    Zhang, C. S.
    2013 10TH IEEE INTERNATIONAL CONFERENCE ON CONTROL AND AUTOMATION (ICCA), 2013, : 485 - 489
  • [9] A hybrid differential evolution algorithm with estimation of distribution algorithm for reentrant hybrid flow shop scheduling problem
    Bing-hai Zhou
    Li-man Hu
    Zhen-yi Zhong
    Neural Computing and Applications, 2018, 30 : 193 - 209
  • [10] A hybrid differential evolution algorithm with estimation of distribution algorithm for reentrant hybrid flow shop scheduling problem
    Zhou, Bing-hai
    Hu, Li-man
    Zhong, Zhen-yi
    NEURAL COMPUTING & APPLICATIONS, 2018, 30 (01): : 193 - 209