基于图卷积网络求解开放车间调度问题的方法
DOI:
作者:
作者单位:

作者简介:

通讯作者:

中图分类号:

基金项目:

国家自然科学基金资助项目(61702177);湖南省教育厅优秀青年基金资助项目(21B0547);湖南省自然科学基金资助项目(2023JJ30217);湖南省教育厅科研基金资助重点项目(21A0356)


A Method for Solving Open Workshop Scheduling Problem Based on Graph Convolutional Network
Author:
Affiliation:

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    传统的元启发式算法难以有效求解大规模开放车间调度问题(OSSP),为此提出了一种基于图卷积网络GCN求解OSSP的方法。首先,设计了基于GCN的开放车间调度模型,将OSSP的工序节点特征嵌入图中并对其进行多层卷积操作,有效获取了工序节点之间复杂的依赖关系。然后,为了提高求解大规模OSSP的效率和质量,提出了一种基于GCN的开放车间调度算法。实验结果表明,该方法能有效求解不同规模的OSSP实例,与元启发式算法相比,在求解大规模OSSP实例时该方法表现出更优秀的求解质量和效率。

    Abstract:

    Due to the lower efficiency found in traditional metaheuristic algorithms for a solution of a large-scale open workshop scheduling problems (OSSP), a method based on graph convolution network (GCN) has thus been proposed to solve OSSP. Firstly, an open workshop scheduling model based on GCN has been designed, which incorporates the process node features of OSSP into the graph, to be followed by a multi-layer convolution operation on it, thus effectively obtaining the complex dependency relationships between process nodes. Next, in view of an improvement of efficiency and quality of solving large-scale OSSP, an open workshop scheduling algorithm has been proposed based on GCN. The experimental results show that this method can effectively solve OSSP instances of different scales. Compared with metaheuristic algorithms, the proposed method is characterized with a better solution quality and higher efficiency in solving large-scale OSSP instances.

    参考文献
    相似文献
    引证文献
引用本文

赵昊鑫,万烂军,崔雪艳,李长云.基于图卷积网络求解开放车间调度问题的方法[J].湖南工业大学学报,2024,38(4):34-39.

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:2023-06-21
  • 最后修改日期:
  • 录用日期:
  • 在线发布日期: 2024-05-24
  • 出版日期: