...
首页> 外文期刊>Journal of Intelligent Manufacturing >A multi-objective scheduling algorithm with self-evolutionary feature for job-shop-like knowledgeable manufacturing cell
【24h】

A multi-objective scheduling algorithm with self-evolutionary feature for job-shop-like knowledgeable manufacturing cell

机译:具有自进化特征的多目标调度算法,用于求职知识渊博的制造单元

获取原文
获取原文并翻译 | 示例
           

摘要

A multi-objective scheduling algorithm with self-evolutionary feature for job-shop-like knowledgeable manufacturing cell (JSKMC) is proposed in this paper, targeting such scheduling issues as make-span, mean complete time of tasks, total tardiness of tasks, number of tardy tasks and the maximum tardiness. Four matrixes are designed to represent the scheduling model of JSKMC. Properties of the key arcs of tasks are discussed and it is found helpless to seek a better solution by reversing the direction of the middle key arcs of tasks. A simplified neighborhood is then established whereby the number of feasible solutions to be searched for is greatly reduced. Based on the above a multi-objective scheduling algorithm with self-evolutionary feature for JSKMC is proposed. Adaptive heuristic critic method is adopted in the algorithm, whose associate search element (ASE) module is designed to select the appropriate action for acquisition of a better solution in the next step by using the knowledge obtained from learning; such an ability of this module can be improved progressively with the increasing training. A scheduling algorithm based on ASE is developed, in which a Pareto archive is embedded to obtain the Pareto optimal solutions. Numerical simulation results confirm the strong ability of the proposed algorithm to home in on the optimal solution by self-evolution via learning.
机译:针对制造跨度、任务平均完成时间、任务总拖期、拖期任务数和最大拖期等调度问题,提出了一种具有自进化特征的知识化制造单元作业车间多目标调度算法(JSKMC)。设计了四个矩阵来表示JSKMC的调度模型。讨论了任务关键弧的性质,发现通过反转任务中间关键弧的方向来寻求更好的解决方案是无能为力的。然后建立一个简化的邻域,从而大大减少了要搜索的可行解的数量。在此基础上,提出了一种具有自进化特性的JSKMC多目标调度算法。该算法采用自适应启发式评判方法,其关联搜索元素(ASE)模块设计用于选择合适的操作,以便在下一步利用从学习中获得的知识获取更好的解;本模块的这种能力可以随着培训的增加而逐步提高。提出了一种基于ASE的调度算法,该算法嵌入了一个Pareto文件以获得Pareto最优解。数值模拟结果证实了该算法通过学习自进化获得最优解的能力。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号