您要查找的是不是：
- Multi-Objective Local Search(MOLS) algorithm was proposed to solve the permutation flowshop sequencing problem with bi-objectives of makespan and total flowtime. 针对求解最小化最大完工时间和总流程时间的多目标同顺序流水作业问题,提出了一个多目标局部搜索算法。
- permutation flowshop scheduling problem 置换流水车间调度问题
- permutation flowshop 同顺序流水作业
- Such a permutation is called a derangement. 这样的一个排列称为错位排列。
- IQ switching can support high speed permutation with low cost. 基于Crossbar的输入交换机能在低成本的条件下支持高速交换.
- Unique because that particular permutation has not appeared before. 之所以独一无二，是因为那种独特的基因排列组合以前不曾出现过。
- The permutation module and the substitution module are designed. 给出了加密算法的置乱模块和替代模块。
- At the end, the permutation forms is definiteed on the p... 该推导公式对截齿排列形式的选择有一定的理论指导意义。
- I just found out the above combination and permutation. 我刚发现了以上的组合和变换。
- Every sort of permutation and combination is possible in human nature. 火的本性可能有各种交织和组合的情况。
- The permutation is even if the number of inversions it contains is even. 如果一个排列中含有的反序的个数是偶数，则称它为偶排列。
- Fengler, F., Permutation lock, U.S.Patent No. 3,115,765, December 31, 1963. 胡家琛，锁，徐氏基金会出版社，台北，1992。
- At last thealgorithms are tested against by 21 Rec FlowShop problems. Also, the topologycharacteristics and the performance are analyzed as well. 最后针对21个Rec类FlowShop问题进行实证分析,分析了该类问题的拓扑空间特性以及杂交算法性能的改进情况。
- Other enumeration problems lead us to the study of orbits of permutation groups. 其它的计数问题引导我们去研究置换群的轨道。
- Abstract: To solve the no-wait flowshop scheduling problem to minimize total tardiness with rule scheduling methods, it is necessary to compute every job's complete time. 中文摘要: 在使用规则调度方法求解无等待最小化总拖期流水车间调度问题时,前提是计算工件的完工时间。
- Computational results show that the proposed DPSO algorithm with the two-point inheritance scheme is very competitive for the lot streaming flowshop scheduling problem. 实验结果显示，利用两点继承机制的改善后DPSO演算法，在此排程问题上呈现最好的绩效。
- Then, we consider an n-job, m-machine lot streaming problem in a flowshop with equal-size sublots where the objective is to minimize the total weighted earliness and tardiness. 接著，我们考虑一个在n件工件及m部机器下，批量流在流程型工厂之排程问题，其目标是最小化总加权提早及延迟时间。
- This classification is called the parity of the permutation analogous to the definition of parity of integers. 这种分类叫作置换的奇偶性，类似于整数偶性的定义。
- Chung, Y. L., Cheng, T. C. E., Lin, B.M., Minimizing the Makespan in the 3-machine assembly-type flowshop scheduling problem, Management science 39（1993）616-625. 庐庆炜;不可中断开放工厂总完工时间最小化之排程问题;朝阳科技大学工业工程与管理硕士班硕士学位论文;（2002）.
