Optimizing job release and scheduling jointly in a reentrant hybrid flow shop

被引:4
|
作者
Wu, Xiuli [1 ]
Yan, Xiaoyan [1 ]
Wang, Ling [2 ]
机构
[1] Univ Sci & Technol Beijing, Sch Mech Engn, Beijing 100083, Peoples R China
[2] Tsinghua Univ, Dept Automat, Beijing 100084, Peoples R China
基金
中国国家自然科学基金;
关键词
Job release; Scheduling; Reentrant hybrid flow shop; Inverse optimization; IMOEA/IOD; Adaptive neighborhood updating strategy; ALGORITHM; OPTIMIZATION; MOEA/D; MACHINES; MINIMIZE; STRATEGY;
D O I
10.1016/j.eswa.2022.118278
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In a reentrant manufacturing system, job release and scheduling are of great importance. However, the two decisions have been made separately in the past. This study mainly aims at optimizing job release and scheduling jointly in a reentrant hybrid flow shop (RHFS-OJRSJ) with unrelated parallel machines. To promote energy conservation and emission reduction, a mathematical model for minimizing the makespan and total energy consumption is proposed. Due to the frequent reentrances of jobs and the complexity of the RHFS-OJRSJ problem, it is a strongly NP-hard problem. To effectively solve the RHFS-OJRSJ problem, an improved multiobjective evolutionary algorithm based on inverse optimization and decomposition (IMOEA/IOD) is proposed. First, the improved multi-objective evolutionary algorithm based on decomposition is employed to search the solution space. Second, a genetic algorithm is integrated to determine an initially best job release plan, based on which the scheduling problem can be encoded. Third, in the decoding, inverse optimization is introduced to further optimize the job release plan. Finally, to avoid falling into a local optimum and ensure population diversity, an adaptive neighborhood updating strategy is proposed. The experimental results demonstrate that the IMOEA/IOD algorithm bridges the gap of the job release and scheduling problem and the proposed algorithm can effectively solve the RHFS-OJRSJ problem.
引用
下载
收藏
页数:14
相关论文
共 50 条
  • [1] IMOEA/D to optimize job release problem for a reentrant hybrid flow shop
    Yan, Xiaoyan
    Wu, Xiuli
    COMPUTERS & INDUSTRIAL ENGINEERING, 2022, 163
  • [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 Reentrant-Bottleneck Heuristic for the Reentrant Hybrid Flow Shop Scheduling
    Yan XiaoYan
    Wu XiuLi
    2020 CHINESE AUTOMATION CONGRESS (CAC 2020), 2020, : 4170 - 4175
  • [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] Scheduling of a hub reentrant job shop to minimize makespan
    Xie Xie
    Lixin Tang
    Yanping Li
    The International Journal of Advanced Manufacturing Technology, 2011, 56 : 743 - 753
  • [7] Scheduling of a hub reentrant job shop to minimize makespan
    Xie, Xie
    Tang, Lixin
    Li, Yanping
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2011, 56 (5-8): : 743 - 753
  • [8] A DE-based Algorithm for Reentrant Permutation Flow-shop Scheduling with Different Job Reentrant Times
    Qian, Bin
    Wan, Jing
    Liu, Bo
    Hu, Rong
    Che, Guo-Lin
    PROCEEDINGS OF THE 2013 IEEE SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE IN SCHEDULING (CISCHED), 2013, : 22 - 27
  • [9] Considering stockers in reentrant hybrid flow shop scheduling with limited buffer capacity
    Lin, Chun-Cheng
    Liu, Wan-Yu
    Chen, Yu-Hsiang
    COMPUTERS & INDUSTRIAL ENGINEERING, 2020, 139
  • [10] Hybrid differential evolution integrated with probability learning for green distributed reentrant job shop scheduling
    Hu R.
    Wu X.
    Mao J.-L.
    Qian B.
    Kongzhi Lilun Yu Yingyong/Control Theory and Applications, 2024, 41 (03): : 512 - 521