Flow-shop scheduling problem is known to be notoriously intractable, both in theory and practice.
流水作业调度问题在理论和实践方面均是一个著名的难题。
A new evolutionary algorithm for solving multi-objective hybrid flow shop scheduling problem(HFSP) which is an important topic in supply chain network optimization is presented.
针对供应链网络优化领域中的混合流水作业调度问题提出了一种新的多目标演化优化算法。
A hybrid flow shop scheduling problem with no-wait is derived from the optimal matching of furnaces and machines in steel making casting production.
将炼钢连铸生产计划中炉机优化匹配问题归结为一个不允许等待的混合流水车间排序问题来进行研究，提出了一个启发式算法-最小偏差算法。
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.
针对柔性流水车间动态调度求解困难的问题，首先分析调度问题的特征，构建问题模型；
The Flow shop scheduling problem under simple linear deterioration was considered.
讨论了工件具有线性恶化加工时间的调度问题 。
This concept is the integration of identical parallel machine scheduling with flow shop scheduling. The solution to IFSP is a non- polynomial computation of time problem.
采用网络理论构造了平行流水作业的非连接图模型，提出了采用蚁群算法求解平行流水作业计划问题，以及求解过程中可行路径表的建立方法。
This concept is the integration of identical parallel machine scheduling with flow shop scheduling. The solution to IFSP is a non- polynomial computation of time problem.
采用网络理论构造了平行流水作业的非连接图模型，提出了采用蚁群算法求解平行流水作业计划问题，以及求解过程中可行路径表的建立方法。
应用推荐