您要查找的是不是：
- Chiang, C. -P., 2004, THE PARALLEL FLOW SHOP SEQUENCING PROBLEM WITH UNRELATED PROCESSING TIME , Proceedings of the 33rd international Conference on Computers and Industrial Engineering , PP.25-27. 中国工业工程学会九十二学年度学会暨学术研讨会;建国技术学院彰化.
- 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 most complex of job shop systems is the open shop. 最复杂的定货加工式工厂系统就是开放式工厂。
- 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. 摘要提出一种主、从递阶结构的蚁群遗传求解算法。
- 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 Problem is to solve the problem that making prearrange is optimization by assigning resources to finish different manufacture tasks according to time early or late. 车间调度问题是解决如何按时间的先后分配资源来完成不同的生产任务，使预定目标最优化的问题。
- The workpiece machining sequencing problem in case of one machine tool is studied with genetic algorithm and advanced/tardy scheduling model. 运用遗传算法和提前／拖期调度模型，研究了在单机情况下工件加工排序问题，提出了一个新算法。
- Multi-Objective Local Search(MOLS) algorithm was proposed to solve the permutation flowshop sequencing problem with bi-objectives of makespan and total flowtime. 针对求解最小化最大完工时间和总流程时间的多目标同顺序流水作业问题,提出了一个多目标局部搜索算法。
- A structural model for large-scale projects is not far different from a job shop model. 一个大型工程项目的结构模型同一个定货加工厂的模型相差不远。
- 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-难组合优化问题,它在工程应用中有着十分重要的意义。
- The sequencing problem is modeled as a cumulative traveling salesman problem (TSP) with ready time, static and dynamic, two cases, are considered, and a set of constraints are adde. 提出了一种新的终端区规划排序模型,把飞机的排序问题看作等价于带有准备好时间的渐增周游店员问题,并给出了兼顾解的最优性和计算复杂性的快速启发式算法。
- Job Shop Problem is the concentrate model of many actual job shop shedule problems, and it is a typical Nondeterministic Polynomial-time hard problem. 作业车间调度（Job-Shop调度）问题是许多实际车间调度问题的简化模型，是一个典型的 NP-hard 问题。
- This paper presented a fabric spreading and cutting sequencing (SCS) model using GA to solve the sequencing problem of the computerized cutting system used in the garment industry. 利用遗传算法可进行铺布与裁剪服装生产系统过程的优化调度。
- Give the arithmetic examples of flow shop and job shop, and show their schedule Gantt pictures. 针对流水调度和作业调度给出了算法实例，并且绘制出了流水和作业调度的甘特图。
- The results have shown the effectiveness of particle swarm optimisation for flexible job shop scheduling. 实验结果表明粒子群算法在柔性工作车间调度问题的应用上是十分有效的。
- CIM differs from the traditional job shop manufacturing system in the role the computer plays in the manufacturing process. CIM与传统的加工车间的制造系统的区别在于计算机在制造过程中所起的作用。
