流水车间调度中的离散粒子群优化算法  

Discrete particle swarm optimization algorithm in flow shop scheduling

作　　者：刘冬冬 方烁 LIU Dongdong;FANG Shuo(School of Computer and Information Engineering,Fuyang Normal University,Fuyang Anhui 236037,China)

机构地区：[1]阜阳师范大学计算机与信息工程学院,安徽阜阳236037

出　　处：《阜阳师范大学学报（自然科学版）》2024年第2期24-29,共6页Journal of Fuyang Normal University:Natural Science

基　　金：安徽省自然科学基金面上项目(2008085MF215);安徽省高等学校自然科学研究重点项目(KJ2021A0682,2023AH050403,2023AH050406)。

摘　　要：针对传统的流水车间调度不能适应存在并行机的工作过程的缺陷,本文提出了求解柔性流水车间调度FFSSP(Flexible Flow Shop Scheduling Problem,FFSSP)的方法。针对无等待阻塞柔性流水车间调度问题中流水车间最大时间最小化的问题,设计了一个优化求解模型,实现了多约束条件下的柔性流水车间调度,实验结果验证了该算法的有效性和可行性。In response to the shortcomings of traditional flow shop scheduling that cannot adapt to the working process with parallel machines,this paper proposes a method for solving FFSSP.This article focuses on the problem of minimizing the maximum time of the flow shop in the flexible flow shop scheduling problem without waiting and blocking,and designs an optimization solution model to achieve flexible flow shop scheduling under multiple constraint conditions.The experimental results have verified the effectiveness and feasibility of the algorithm.

关 键 词：柔性流水车间调度 闭塞 离散粒子群优化 迭代 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]