Discrete particle swarm optimization algorithm in flow shop scheduling
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 maxi-mum time of the flow shop in the flexible flow shop scheduling problem without waiting and blocking,and designs an optimiza-tion solution model to achieve flexible flow shop scheduling under multiple constraint conditions.The experimental results have verified the effectiveness and feasibility of the algorithm.
NETL
NSTL
万方数据
