您要查找的是不是:
- An ant-colony heuristic algorithm was proposed for the No-Wait Flow Shop problem(NWFS) with makespan criterion. 针对以最大完成时间为目标的无等待流水车间调度问题,提出了一种蚁群算法。
- ACA and Its Application on Flow Shop Problem and Clustering Problem 蚁群算法及其在Flow Shop问题和聚类问题上的应用
- flow shop problem 流水型排序
- Interval perturbation robustness of optimal schedules for a class of Flow Shop problems 调度问题最优调度区间摄动鲁棒性
- A two-objective model was constructed for flow shop rescheduling problem with arrivals of new jobs. 摘要作业车间往往因出现新作业而需要进行重调度。
- 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. 在混合流水车间的构建过程中,每个阶段配置几台平行机最为合理是一个有待确定的问题。
- The Model and Algorithm for a Random Flow Shops Problems 模型及其算法
- Discrete Particle Swarm Optimization (DPSO) algorithm was proposed for no-wait flow shop scheduling problem with makespan criterion. 摘要针对以生产周期为目标的无等待流水车间调度问题,提出了一种离散粒子群优化算法。
- 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. 最后将量子粒子群算法应用到花布印染企业的生产调度中,对加工任务进行优化调度,并实现甘特图的动态生成。
- 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. 摘要针对供应链网络优化领域中的混合流水作业调度问题提出了一种新的多目标演化优化算法。
- Aiming at flow shop scheduling problem,the model of the no-idle scheduling problems with dominant machines and deteriorating jobs is established. 针对流水作业排序问题,建立了具有优势机器和恶化工件并且有无空闲限制的排序模型。
- 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. 车间调度问题是解决如何按时间的先后分配资源来完成不同的生产任务,使预定目标最优化的问题。
- 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. 中国工业工程学会九十二学年度学会暨学术研讨会;建国技术学院彰化.
- An ant colony optimization based algorithm for permutation flow shop scheduling was proposed. 摘要提出了一种求解置换流水车间调度的蚁群优化算法。
- Give the arithmetic examples of flow shop and job shop, and show their schedule Gantt pictures. 针对流水调度和作业调度给出了算法实例,并且绘制出了流水和作业调度的甘特图。
- 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 问题。
- 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. 摘要根据蚂蚁路迳寻优行为模型及其与混流车间调度的相似性,提出混流车间的蚂蚁调度算法。
- 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)算法.
- permutation flow shop scheduling problem 置换流水车间调度问题