并应用该算法解决了双目标的流水车间调度问题。
Then, found its application in flow shop scheduling problems with two objects.
提出了一种求解置换流水车间调度问题的离散粒子群优化算法。
Solving Rectangular Packing Problem Based on Discrete Particle Swarm Optimization Algorithm;
炼钢-连铸生产的浇次组合与排序是带有工艺约束的并行机流水车间调度问题。
The cast grouping and ordering problem of steelmaking continuous casting hot rolling (SM-CC) is a combinatorial optimization problem.
以总完工时间为目标的无等待流水车间调度问题是一个重要的制造加工系统,广泛应用于工业生产中。
No-wait flow shop scheduling problems with total flow time minimization is an important manufacturing system widely existing in industrial environments.
针对混合流水车间调度问题,提出了分阶段加工优先级的调度原则,并将迭代局部搜索算法应用于求解此问题。
Multistage processing priority was developed for the hybrid flow shop problem and an iterated local search algorithm was used for solving this kind of problem.
无等待问题是流水车间调度中的一种,是一类典型的NP完全问题,已被证明在多项式时间内得不到最优值。
No-wait flow shop problem is one of flow shop problems, and is a typically NP-complete problem, which means that it is impossible to find the global optimum in polynomial complexity.
针对柔性流水车间动态调度求解困难的问题,首先分析调度问题的特征,构建问题模型;
For the difficulties of flexible flow shop(FFS)dynamic scheduling problem, the problem's character is analyzed, and the model of the problem is built.
针对柔性流水车间动态调度求解困难的问题,首先分析调度问题的特征,构建问题模型;
For the difficulties of flexible flow shop(FFS)dynamic scheduling problem, the problem's character is analyzed, and the model of the problem is built.
应用推荐