您要查找的是不是：
- 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. 摘要针对供应链网络优化领域中的混合流水作业调度问题提出了一种新的多目标演化优化算法。
- According to ants' routing behavior model and its resemblance to hybrid flow shop scheduling, an ant-like scheduling algorithm for hybrid flow shop is put forward. 摘要根据蚂蚁路迳寻优行为模型及其与混流车间调度的相似性，提出混流车间的蚂蚁调度算法。
- hybrid flow shop scheduling problem 混合流水车间排序问题
- hybrid flow shop scheduling 混合流水作业调度
- A new local search method with hybrid neighborhood for Job shop scheduling problem is developed. 另辟蹊径求解工厂作业调度问题。
- A hybrid algorithm of ant colony &genetic algorithms was proposed to solve the flexible Job Shop scheduling problem capacitated constraints. 摘要提出一种主、从递阶结构的蚁群遗传求解算法。
- 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. 在混合流水车间的构建过程中,每个阶段配置几台平行机最为合理是一个有待确定的问题。
- An ant colony optimization based algorithm for permutation flow shop scheduling was proposed. 摘要提出了一种求解置换流水车间调度的蚁群优化算法。
- Discrete Particle Swarm Optimization (DPSO) algorithm was proposed for no-wait flow shop scheduling problem with makespan criterion. 摘要针对以生产周期为目标的无等待流水车间调度问题，提出了一种离散粒子群优化算法。
- Aiming at flow shop scheduling problem,the model of the no-idle scheduling problems with dominant machines and deteriorating jobs is established. 针对流水作业排序问题,建立了具有优势机器和恶化工件并且有无空闲限制的排序模型。
- Ching-Fang Liaw, 1999, “A hybrid genetic algorithm for the open shop scheduling problem”, Proceedings of the Chinese Institute of Industrial Engineers, National conference, pp.36-41, 1998. 施大维，廖经芳，1999,”开放工厂总加权流程时间最小化排程问题之研究”，八十八年工业工程年会论文集。
- Meanwhile，the dynamic generation of Gantt chart is implemented.The result of this paper can be applied to flow shop scheduling and job shop scheduling problem directly. 最后将量子粒子群算法应用到花布印染企业的生产调度中，对加工任务进行优化调度，并实现甘特图的动态生成。
- To the problem that it takes a long time for current available algorithms to solve large-scale flow shop scheduling problems(FSPs),a fast taboo search algorithm based on Block properties of FSP is proposed to reduce the neighborhood size. 为解决现有算法在求解大规模流水线调度问题(FSP)时计算时间过长的问题;从缩小邻域的角度出发;提出一种基于FSP问题Block性质的快速禁忌搜索(TS)算法.
- Hybrid Search Strategy in Fuzzy Job Shop Scheduling 调度中的混合搜索策略的研究
- Local search is a very important heuristic method for the job shop scheduling problem. 邻域搜索是一种很重要的求解工件加工调度问题的启发式算法。
- Keywords production scheduling;vestee enterprise;Shapley value;genetic algorithms;hybrid flow shop; 生产调度;装饰布企业;夏普利值;遗传算法;混合流程作业;
- The results have shown the effectiveness of particle swarm optimisation for flexible job shop scheduling. 实验结果表明粒子群算法在柔性工作车间调度问题的应用上是十分有效的。
- W Barnes, J B Chambers.Solving the job shop scheduling problem with tabu search[J].IIE Transaction, 1995,27. 周泓;蔡缪峰;冯允成.;求解流水车间作业排序问题的一种遗传算法[J]
- Job Shop Scheduling is a difficult combinatorial optimization problem and an improved genetic algorithm is used to solve it. 摘要作业车间调度是一类求解困难的组合优化问题，使用改进的遗传算法来求解。
- Gonzalez, T., Sahni, S., Open shop scheduling to minimize finish time, Journal of the association for computiong machinery 23（1976）665-679. 丁威清;双阶段流程型与开放型生产型态之排程研究;中原大学工业工程学系硕士学位论文;（2002）.
