您要查找的是不是：
- A new local search method with hybrid neighborhood for Job shop scheduling problem is developed. 另辟蹊径求解工厂作业调度问题。
- Local search is a very important heuristic method for the job shop scheduling problem. 邻域搜索是一种很重要的求解工件加工调度问题的启发式算法。
- 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. 摘要作业车间调度是一类求解困难的组合优化问题，使用改进的遗传算法来求解。
- A hybrid algorithm of ant colony &genetic algorithms was proposed to solve the flexible Job Shop scheduling problem capacitated constraints. 摘要提出一种主、从递阶结构的蚁群遗传求解算法。
- This paper presents a complete multiagent framework for dynamic job shop scheduling, with an emphasis on robustness and adaptability. 本文描述了一个完整的为动态车间进度工作表设计的多主体框架，着重强调了此框架的及健全性和适应性。
- Job Shop Scheduling problem is an important problem in actual production of manufacturing system, it is also one of the difficult problems of theory research. 作业车间调度问题是制造系统实际生产中的重要问题,也是理论研究的难点之一。
- 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. 最后将量子粒子群算法应用到花布印染企业的生产调度中，对加工任务进行优化调度，并实现甘特图的动态生成。
- Tabu Search is an effective local search algorithm for the job shop scheduling problem, but the quality of the best solution found depends on the initial solution. 禁忌搜索一种求解作业车间调度问题的有效局部搜索算法，但其搜索最优解的能力取决于初始解的选择。
- Job shop scheduling problem (JSSP) is a very difficult combinatorial optimization problem, which is proved to be NP-hard. It has great importance in engineering application and academic study. 作业车间调度问题(Job Shop Scheduling Problem,简称JSSP)是一个非常复杂的NP-难组合优化问题,它在工程应用中有着十分重要的意义。
- Based on the framework, an algorithm, GA\|SPTS, is developed for job shop scheduling problems with sequence dependent setup times, which shows high performance compared with the existing algorithms. 在以上框架基础上,针对含调整时间的作业排序问题建立了一种混合算法GA-SPTS,通过与已有算法的比较表明,该算法对这类问题具有很好的求解性能。
- Based on the framework, an algorithm, GA-SPTS, is developed for job shop scheduling problems with sequence-dependent setup times, which shows high performance compared with the existing algorithms. 在以上框架基础上，针对含调整时间的作业排序问题建立了一种混合算法GA-SPTS，通过与已有算法的比较表明，该算法对这类问题具有很好的求解性能。
- 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. 摘要针对以生产周期为目标的无等待流水车间调度问题，提出了一种离散粒子群优化算法。
- Gonzalez, T., Sahni, S., Open shop scheduling to minimize finish time, Journal of the association for computiong machinery 23（1976）665-679. 丁威清;双阶段流程型与开放型生产型态之排程研究;中原大学工业工程学系硕士学位论文;（2002）.
- Aiming at flow shop scheduling problem,the model of the no-idle scheduling problems with dominant machines and deteriorating jobs is established. 针对流水作业排序问题,建立了具有优势机器和恶化工件并且有无空闲限制的排序模型。
- 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. 摘要根据蚂蚁路迳寻优行为模型及其与混流车间调度的相似性，提出混流车间的蚂蚁调度算法。
- This thesis presents a novel use of Inductive Logic Programming (ILP) for the extraction of knowledge from a large set of job shop schedules. 癌症化疗用药规划模型是种多模的最佳化问题，其可行的解空间是由数个不连续的区空间所构成。
