中文 | English

J. Hefei Univ. Tech. (Nat. Sci.)

合肥工业大学学报(自然科学版)

JOURNAL OF HEFEI UNIVERSITY OF TECHNOLOGY (NATURAL SCIENCE)

Competent Authorities: Ministry of Education of the People's Republic of China

Sponsor by: Hefei University of Technology

ISSN 1000-1646, CN 34-1001/N

Rescheduling of distributed heterogeneous flexible flowshop considering machine breakdown

Download Full Text

考虑机器故障的分布式异构柔性流水车间重调度

Journal Information

J. Hefei Univ. Tech. (Nat. Sci.), Dec.2025, Vol.48 No.12: 1678-1688

DOI: 10.3969/j.issn.1003-5060.2025.12.015

Authors

XUAN Hua, XIONG Mengying, LI Bing

(School of Management, Zhengzhou University, Zhengzhou 450001, China)

Abstract and Keywords

Abstract: In order to solve the distributed heterogeneous flexible flowshop rescheduling problem (DHFFRP), considering machine breakdown, an integer planning model with the objective of minimizing the maximum completion time is established, and a hybrid artificial bee colony algorithm (HABCA), which incorporates genetic algorithms, variable neighborhood search strategies, and the idea of simulated annealing, is proposed for problem-solving. In order to cope with the dynamically changing process states, the above dynamic problem is transformed into a series of static problems with phases by distinguishing different states of the process according to the failure time and the faulty machine. In HABCA, a three-layer coding method and an insertion-based greedy decoding mechanism are designed; in the employed bees search process, crossover and mutation strategies are introduced to optimize the nectar sources in the population; in the onlooker bees search process, a local search operator based on the minimum completion time rule is used; and in the scout bees search process, four kinds of variable neighborhood search operators and simulated annealing operations are applied for the evolution of the solution. The performance improvement between initial scheduling and rescheduling is verified through a large number of example tests; the proposed algorithm is compared with the classical artificial bee colony algorithm and existing algorithms, and the results show the effectiveness and superiority of HABCA.

Keywords: distributed heterogeneous flexible flowshop; machine breakdown; rescheduling; hybrid artificial bee colony algorithm(HABCA); simulated annealing operation

作者信息

轩华，熊梦莹，李冰

（郑州大学管理学院，河南郑州450001）

摘要和关键词

摘要: 为解决考虑机器故障的分布式异构柔性流水车间重调度问题(distributed heterogeneous flexible flowshop rescheduling problem, DHFFRP)，文章建立以最小化最大完工时间为目标的整数规划模型，提出采用一种融合遗传算法、变邻域搜索策略和模拟退火思想的混合人工蜂群算法(hybrid artificial bee colony algorithm, HABCA)进行求解。为应对动态变化的工序状态，根据故障时间、故障机器区分不同状态的工序，从而将上述动态问题转化为一系列阶段性的静态问题。在 HABCA 中设计 3 层编码方式和插入式贪婪解码机制；在雇佣蜂搜索过程中引入交叉和变异策略优化种群的蜜源；在跟随蜂搜索过程中采用基于最小完工时间规则的局域搜索算子；在侦查蜂搜索过程中应用 4 种变邻域搜索算子、模拟退火操作进行解的进化。通过大量的实例测试，验证重调度的性能相较于初始调度有显著的提高；将所提算法与经典人工蜂群算法、已有算法进行比较，结果表明 HABCA 的有效性和优越性。

关键词: 分布式异构柔性流水车间；机器故障；重调度；混合人工蜂群算法（HABCA）；模拟退火操作

Funding

国家自然科学基金青年科学基金资助项目（72201251）；河南省自然科学基金面上资助项目（252300421945）和河南省科技研发计划联合基金资助项目（242103810046）

Previous Next

Back to Contents