您要查找的是不是：
- 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. 邻域搜索是一种很重要的求解工件加工调度问题的启发式算法。
- W Barnes, J B Chambers.Solving the job shop scheduling problem with tabu search[J].IIE Transaction, 1995,27. 周泓;蔡缪峰;冯允成.;求解流水车间作业排序问题的一种遗传算法[J]
- A hybrid algorithm of ant colony &genetic algorithms was proposed to solve the flexible Job Shop scheduling problem capacitated constraints. 摘要提出一种主、从递阶结构的蚁群遗传求解算法。
- 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-难组合优化问题,它在工程应用中有着十分重要的意义。
- 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. 作业车间调度问题是制造系统实际生产中的重要问题,也是理论研究的难点之一。
- Discrete Particle Swarm Optimization (DPSO) algorithm was proposed for no-wait flow shop scheduling problem with makespan criterion. 摘要针对以生产周期为目标的无等待流水车间调度问题，提出了一种离散粒子群优化算法。
- 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 New Approach for Job Shop Scheduling Problem 一种新型的作业车间调度算法的研究与实现
- Study on Job Shop Scheduling Problem 车间调度算法的研究和开发
- Flexible Job Shop Scheduling Problem 柔性作业车间调度
- Job Shop Scheduling Problem (JSP) 作业车间调度问题（JSP）
- Deterministic job shop scheduling problem 静态JSP
- 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，通过与已有算法的比较表明，该算法对这类问题具有很好的求解性能。
- 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,”开放工厂总加权流程时间最小化排程问题之研究”，八十八年工业工程年会论文集。
- Aiming at flow shop scheduling problem,the model of the no-idle scheduling problems with dominant machines and deteriorating jobs is established. 针对流水作业排序问题,建立了具有优势机器和恶化工件并且有无空闲限制的排序模型。
- A New Local Search Algorithm for Job Shop Scheduling Problem 求解工件车间调度问题的一种新的邻域搜索算法
