Knowledge-Guided Multiview Hierarchical Evolutionary Algorithm for Flexible Job Shop Scheduling With Finite Skilled Workers

IF 8.7 1区 计算机科学 Q1 AUTOMATION & CONTROL SYSTEMS
Rui Li;Ling Wang;Hongyan Sang;Lizhong Yao
{"title":"Knowledge-Guided Multiview Hierarchical Evolutionary Algorithm for Flexible Job Shop Scheduling With Finite Skilled Workers","authors":"Rui Li;Ling Wang;Hongyan Sang;Lizhong Yao","doi":"10.1109/TSMC.2025.3583207","DOIUrl":null,"url":null,"abstract":"This work addresses the flexible job shop scheduling with finite skilled workers, extending classical flexible job shop scheduling by incorporating operation decomposition, finite worker, and worker transfer. These new problem features significantly increase the complexity of solving, as several operations requiring multiple workers can lead to worker competition, causing delays in other operations that depend on the same workers. Previous studies focused on either operation decomposition or worker transfer but did not address the issue of worker competition. To tackle this challenging optimization problem, we propose a knowledge-guided hierarchical evolutionary algorithm (KHEA) with multiview cooperative neighborhood search. The key contributions of this work are as follows: 1) a hierarchical solving framework is proposed to reduce the solving difficulty. This problem is decomposed into three levels. The first level ignores the worker assignment and the second level starts optimizing it. The final level then refines the global solution; 2) a knowledge-guided crossover operator with a feedback schema is designed to improve the efficiency of crossover operations; and 3) a multiview cooperative neighborhood search strategy is proposed to reduce the idle time caused by worker competition. This involves designing a new disjunctive graph that accounts for worker competition to identify the critical path. The information from both machine-view and worker-view Gantt charts is cooperatively utilized to minimize idle time. Our method, KHEA, was tested on two benchmarks across 28 instances and 16 large-scale instances, with equal running time for comparisons. Compared to state-of-the-arts, KHEA obtains significant superiority.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":"55 10","pages":"7259-7272"},"PeriodicalIF":8.7000,"publicationDate":"2025-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Systems Man Cybernetics-Systems","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/11079302/","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

This work addresses the flexible job shop scheduling with finite skilled workers, extending classical flexible job shop scheduling by incorporating operation decomposition, finite worker, and worker transfer. These new problem features significantly increase the complexity of solving, as several operations requiring multiple workers can lead to worker competition, causing delays in other operations that depend on the same workers. Previous studies focused on either operation decomposition or worker transfer but did not address the issue of worker competition. To tackle this challenging optimization problem, we propose a knowledge-guided hierarchical evolutionary algorithm (KHEA) with multiview cooperative neighborhood search. The key contributions of this work are as follows: 1) a hierarchical solving framework is proposed to reduce the solving difficulty. This problem is decomposed into three levels. The first level ignores the worker assignment and the second level starts optimizing it. The final level then refines the global solution; 2) a knowledge-guided crossover operator with a feedback schema is designed to improve the efficiency of crossover operations; and 3) a multiview cooperative neighborhood search strategy is proposed to reduce the idle time caused by worker competition. This involves designing a new disjunctive graph that accounts for worker competition to identify the critical path. The information from both machine-view and worker-view Gantt charts is cooperatively utilized to minimize idle time. Our method, KHEA, was tested on two benchmarks across 28 instances and 16 large-scale instances, with equal running time for comparisons. Compared to state-of-the-arts, KHEA obtains significant superiority.
有限熟练工人柔性作业车间调度的知识引导多视图分层进化算法
本文研究了有限熟练工人的柔性作业车间调度问题,通过将作业分解、有限工人和工人转移相结合,对传统的柔性作业车间调度进行了扩展。这些新问题显著增加了解决的复杂性,因为需要多个工人的几个操作可能导致工人竞争,导致依赖相同工人的其他操作延迟。以往的研究要么关注经营分解,要么关注工人转移,但没有解决工人竞争的问题。为了解决这一具有挑战性的优化问题,我们提出了一种多视图协同邻域搜索的知识引导分层进化算法(KHEA)。本文的主要贡献如下:1)提出了一种分层求解框架,降低了求解难度。这个问题可分为三个层次。第一级忽略工人分配,第二级开始优化它。最后一个层次是细化全局解决方案;2)设计了带反馈模式的知识引导交叉算子,提高了交叉操作的效率;3)提出了一种多视图合作邻域搜索策略,以减少工人竞争造成的空闲时间。这包括设计一个新的析取图,考虑工人的竞争,以确定关键路径。机器视图和工人视图的甘特图信息被协同利用,以最大限度地减少空闲时间。我们的方法KHEA在28个实例和16个大规模实例的两个基准测试中进行了测试,并使用相同的运行时间进行比较。与世界先进水平相比,韩国高等学校具有显著的优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Transactions on Systems Man Cybernetics-Systems
IEEE Transactions on Systems Man Cybernetics-Systems AUTOMATION & CONTROL SYSTEMS-COMPUTER SCIENCE, CYBERNETICS
CiteScore
18.50
自引率
11.50%
发文量
812
审稿时长
6 months
期刊介绍: The IEEE Transactions on Systems, Man, and Cybernetics: Systems encompasses the fields of systems engineering, covering issue formulation, analysis, and modeling throughout the systems engineering lifecycle phases. It addresses decision-making, issue interpretation, systems management, processes, and various methods such as optimization, modeling, and simulation in the development and deployment of large systems.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信