4.4 Article

FLEXIBLE JOB SHOP SCHEDULING BASED ON DIGITAL TWIN AND IMPROVED BACTERIAL FORAGING

期刊

出版社

DAAAM INTERNATIONAL VIENNA
DOI: 10.2507/IJSIMM21-3-CO14

关键词

Flexible Job Shop Scheduling; Improved Bacteria Foraging Optimization Algorithm; Digital Twin; Complex Product; Dynamic Scheduling

资金

  1. Research Project on Economic and Social Development of Liaoning Province [2022lsljdybkt-014]
  2. Science and technology innovation fund program of Dalian [2021JJ13SN81]
  3. Major theoretical and practical problems in social science circles of Shaanxi Province [20yj-39]
  4. Project of Dalian Federation of Social Sciences [2021dlskzd121]

向作者/读者索取更多资源

This study proposes a hybrid dynamic scheduling method with Digital Twin and improved bacterial foraging algorithm (IBFOA) to optimize the complex workpiece processing in a job shop. The results show that this method can effectively minimize the maximum completion time and machine load, and address the issue of extended production time caused by disruptions.
To realize the dynamic scheduling of complex workpiece processing in complex workpiece job shop, a hybrid dynamic scheduling method with Digital Twin and improved bacterial foraging algorithm (IBFOA) is proposed to minimize the maximum completion time and machine load. During the actual workshop processing, the flexible job shop scheduling problem (FJSP) is divided into two sub-problems: machine assignment and process sequencing. The initial scheduling scheme is completed using an IBFOA to construct a Digital Twin flexible job shop scheduling model. Digital Twin model is used to solve the impact of workshop emergencies. Based on typical benchmark cases and real data from a machine company's mould shop, the machining shop production scheduling experiments are conducted. The results show that the scheduling scheme using the IBFOA combined with the Digital Twin can optimize the system performance as a whole and effectively deal with the problem of extended production time caused by disruption. The algorithm can obtain the most satisfactory scheduling solution and the effectiveness of solving the multi-objective FJSP are verified.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.4
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据