An Improved Reentrant-Bottleneck Heuristic for the Reentrant Hybrid Flow Shop Scheduling

被引:2
|
作者
Yan XiaoYan [1 ]
Wu XiuLi [1 ]
机构
[1] Univ Sci & Technol Beijing, Coll Mech Engn, Beijing 100083, Peoples R China
关键词
the theory of constraint; seamless steel tube add drawing production; reentrant hybrid flow shop; an improved reentrant-bottleneck heuristics; LINE;
D O I
10.1109/CAC51589.2020.9327890
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Reentrant production system is a complex system, whose main feature is that the job is repeatedly processed on a certain machine or several machines in the system. According to the theory of constraint (TOC), this paper takes a seamless steel tube cold drawing production line as an example and models it as a reentrant hybrid flow shop scheduling problem (RHFS). A scheduling model with the goal of minimizing makespan is established. An improved reentrant-bottleneck heuristic (1RBH) is proposed, which contains the initial sequence generation method (ISGM) and the multi-position job insertion method (MPGIM). The ISGM is used to generate an initial sequence and the MPGIM is applied to the initial sequence to optimize the scheduling. The experimental results show that the IRBH can soh e the RHFS problem effectively.
引用
收藏
页码:4170 / 4175
页数:6
相关论文
共 50 条
  • [1] A modified shifting bottleneck heuristic for the reentrant job shop scheduling problem with makespan minimization
    Topaloglu, Seyda
    Kilincli, Gamze
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2009, 44 (7-8): : 781 - 794
  • [2] A modified shifting bottleneck heuristic for the reentrant job shop scheduling problem with makespan minimization
    Seyda Topaloglu
    Gamze Kilincli
    The International Journal of Advanced Manufacturing Technology, 2009, 44 : 781 - 794
  • [3] An Improved Imperialist Competitive Algorithm for Reentrant Flow Shop Scheduling
    Cheng, Yong
    Lei, Deming
    2018 37TH CHINESE CONTROL CONFERENCE (CCC), 2018, : 2206 - 2211
  • [4] 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
  • [5] Improved iterated greedy algorithm for reentrant flow shop scheduling problem
    Wu, Xiuli
    Li, Yuxin
    Kuang, Yuan
    Cui, Jianjie
    Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2024, 30 (07): : 2364 - 2380
  • [6] Optimizing job release and scheduling jointly in a reentrant hybrid flow shop
    Wu, Xiuli
    Yan, Xiaoyan
    Wang, Ling
    EXPERT SYSTEMS WITH APPLICATIONS, 2022, 209
  • [7] An Elite-Class Teaching-Learning-Based Optimization for Reentrant Hybrid Flow Shop Scheduling with Bottleneck Stage
    Lei, Deming
    Duan, Surui
    Li, Mingbo
    Wang, Jing
    CMC-COMPUTERS MATERIALS & CONTINUA, 2024, 79 (01): : 47 - 63
  • [8] 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
  • [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] 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