欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
以最大完工周期为目标的Job-shop调度问题是一类NP完全问题,迄今仍未发现其求解的有效算法。通过Job-shop型知识化制造单元自身结构特性分析,构建其链约束模型,并通过对其链路图添加约束获得可行调度。在此基础上提出一种自进化算法,该算法在运行中通过q学习能够不断从环境中获取所需知识,使其搜索能力逐步提高。对于学习过程中系统状态过多的问题,采用径向基函数网络对q函数进行逼近。通过仿真计算表明了所提算法对该类问题具备明显的学习进化能力。
英文摘要：
The Job-shop scheduling problem with make-span as goal belongs to the NP complete problem and the valid algorithm for its solution hasn＇t been given until now. Through analyzing the characteristics of Job Shop knowledgeable manufacturing cell structure, the link constraint model was constructed, and feasible scheduling was obtained by adding constraint to its link-path graph. On these bases, a self-evolution algorithm with learning ability was proposed. Through adopting the q-function of reinforcement learning in algorithm, the needed knowledge was obtained from its environment to improve its search ability. The approximation of q function was implemented by using Radial Basis-Function（RBF）network to avoid too many states in learning process. Numerical simulation results showed that the proposed algorithm had excellent learning and evolution ability for this kind of problems.
同期刊论文项目
同项目期刊论文
An Iterative Learning Method for Multi-cycle Flexible Production/Inventory Control under Random Dema
Multiple-objective Scheduling for Interbay AMHS by Using Genetic-programming-based Composite Dispatc
An Adaptive Multi-parameter Based Dispatching Strategy for Single-loop Interbay Material Handling Sy
A Performance Analytical Model of Automated Material Handling System for Semiconductor Wafer Fabrica
Dynamic Dispatching for Interbay Material Handling by Using Modified Hungarian Algorithm and Fuzzy-l
A Two-layer Dynamic Scheduling Method for Minimizing the Earliness and Tardiness of a Reentrant Prod
Robust Production Control Policy for a Single Machine and Single Part-type Manufacturing System with
A new bottleneck detecting approach to productivity improvement of knowledgeable manufacturing syste
期刊信息
位置：