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.
针对混合流水车间调度问题，提出了分阶段加工优先级的调度原则，并将迭代局部搜索算法应用于求解此问题。
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.
无等待问题是流水车间调度中的一种，是一类典型的NP完全问题，已被证明在多项式时间内得不到最优值。
In the establishment of hybrid flow shop (HFS), how many parallel machines being set at every stage will be reasonable is a problem to be studied.
在混合流水车间的构建过程中，每个阶段配置几台平行机最为合理是一个有待确定的问题。
The problem of the combination of inspection facilities for flow shop quality inspection is studied in this paper.
研究了一类流水作业质量检验的检验设备组合问题。
The problem of acyclic reconfigurable flow shop modeling and optimization is studied for the new manufacturing paradigm-reconfigurable manufacturing system.
针对可重构制造这一新的制造模式，研究一类非周期可重构流水作业的建模与优化问题。
The problem of the combination of machines for flow shop quality inspection is studied in this paper.
研究了一类流水作业质量检验的机床组合问题。
Most flow shop sequencing problems with more than two machines belong to NPC problem. People often use heuristic algoristic algorithms to deal with them in practice.
大多数一般的多于两台机床的流水车间作业排序问题均属于NPC问题，在实际生产中一般采用启发式算法。
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.
将炼钢连铸生产计划中炉机优化匹配问题归结为一个不允许等待的混合流水车间排序问题来进行研究，提出了一个启发式算法-最小偏差算法。
No-idle flow shop(NIFS) problem with makespan criterion is studied.
研究了以最大完工时间为目标的零空闲流水线调度问题。
Flow-shop scheduling problem is known to be notoriously intractable, both in theory and practice.
流水作业调度问题在理论和实践方面均是一个著名的难题。
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.
针对柔性流水车间动态调度求解困难的问题，首先分析调度问题的特征，构建问题模型；
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.
采用网络理论构造了平行流水作业的非连接图模型，提出了采用蚁群算法求解平行流水作业计划问题，以及求解过程中可行路径表的建立方法。
The Flow shop scheduling problem under simple linear deterioration was considered.
讨论了工件具有线性恶化加工时间的调度问题 。
The Flow shop scheduling problem under simple linear deterioration was considered.
讨论了工件具有线性恶化加工时间的调度问题 。
应用推荐