• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

基于卷积二维变换的作业车间问题混合深度神经网络调度器。

Hybrid Deep Neural Network Scheduler for Job-Shop Problem Based on Convolution Two-Dimensional Transformation.

机构信息

College of Computer Science and Technology, Zhejiang University of Technology, Hangzhou 310027, China.

College of Science, Changchun University of Science and Technology, Changchun 130022, China.

出版信息

Comput Intell Neurosci. 2019 Jul 10;2019:7172842. doi: 10.1155/2019/7172842. eCollection 2019.

DOI:10.1155/2019/7172842
PMID:31379935
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC6652087/
Abstract

In this paper, a hybrid deep neural network scheduler (HDNNS) is proposed to solve job-shop scheduling problems (JSSPs). In order to mine the state information of schedule processing, a job-shop scheduling problem is divided into several classification-based subproblems. And a deep learning framework is used for solving these subproblems. HDNNS applies the convolution two-dimensional transformation method (CTDT) to transform irregular scheduling information into regular features so that the convolution operation of deep learning can be introduced into dealing with JSSP. The simulation experiments designed for testing HDNNS are in the context of JSSPs with different scales of machines and jobs as well as different time distributions for processing procedures. The results show that the MAKESPAN index of HDNNS is 9% better than that of HNN and the index is also 4% better than that of ANN in ZLP dataset. With the same neural network structure, the training time of the HDNNS method is obviously shorter than that of the DEEPRM method. In addition, the scheduler has an excellent generalization performance, which can address large-scale scheduling problems with only small-scale training data.

摘要

本文提出了一种混合深度神经网络调度器(HDNNS)来解决作业车间调度问题(JSSP)。为了挖掘调度处理的状态信息,将作业车间调度问题划分为几个基于分类的子问题,并使用深度学习框架来解决这些子问题。HDNNS 应用卷积二维变换方法(CTDT)将不规则的调度信息转换为规则的特征,以便将深度学习的卷积操作引入到处理 JSSP 中。为了测试 HDNNS 而设计的模拟实验是在机器和作业规模不同以及处理过程时间分布不同的 JSSP 背景下进行的。结果表明,与 HNN 相比,HDNNS 的 MAKESPAN 指标提高了 9%,在 ZLP 数据集上也比 ANN 提高了 4%。在相同的神经网络结构下,HDNNS 方法的训练时间明显短于 DEEPRM 方法。此外,调度器具有出色的泛化性能,可以仅使用小规模训练数据解决大规模调度问题。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/ca0c/6652087/b141412293a9/CIN2019-7172842.alg.001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/ca0c/6652087/36a3676b4839/CIN2019-7172842.001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/ca0c/6652087/93e12fa39656/CIN2019-7172842.002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/ca0c/6652087/9ce4a4b03ebd/CIN2019-7172842.003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/ca0c/6652087/f83bc28ceef2/CIN2019-7172842.004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/ca0c/6652087/5846ff0fcb0e/CIN2019-7172842.005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/ca0c/6652087/35d40de53778/CIN2019-7172842.006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/ca0c/6652087/06e43ab120f9/CIN2019-7172842.007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/ca0c/6652087/fed210e66350/CIN2019-7172842.008.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/ca0c/6652087/3b3e58d065ff/CIN2019-7172842.009.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/ca0c/6652087/b7fc14d40f59/CIN2019-7172842.010.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/ca0c/6652087/9518a61d0770/CIN2019-7172842.011.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/ca0c/6652087/1a5b23715cd2/CIN2019-7172842.012.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/ca0c/6652087/070a0dd6506f/CIN2019-7172842.013.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/ca0c/6652087/b141412293a9/CIN2019-7172842.alg.001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/ca0c/6652087/36a3676b4839/CIN2019-7172842.001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/ca0c/6652087/93e12fa39656/CIN2019-7172842.002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/ca0c/6652087/9ce4a4b03ebd/CIN2019-7172842.003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/ca0c/6652087/f83bc28ceef2/CIN2019-7172842.004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/ca0c/6652087/5846ff0fcb0e/CIN2019-7172842.005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/ca0c/6652087/35d40de53778/CIN2019-7172842.006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/ca0c/6652087/06e43ab120f9/CIN2019-7172842.007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/ca0c/6652087/fed210e66350/CIN2019-7172842.008.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/ca0c/6652087/3b3e58d065ff/CIN2019-7172842.009.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/ca0c/6652087/b7fc14d40f59/CIN2019-7172842.010.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/ca0c/6652087/9518a61d0770/CIN2019-7172842.011.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/ca0c/6652087/1a5b23715cd2/CIN2019-7172842.012.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/ca0c/6652087/070a0dd6506f/CIN2019-7172842.013.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/ca0c/6652087/b141412293a9/CIN2019-7172842.alg.001.jpg

相似文献

1
Hybrid Deep Neural Network Scheduler for Job-Shop Problem Based on Convolution Two-Dimensional Transformation.基于卷积二维变换的作业车间问题混合深度神经网络调度器。
Comput Intell Neurosci. 2019 Jul 10;2019:7172842. doi: 10.1155/2019/7172842. eCollection 2019.
2
Solving flexible job shop scheduling problems with transportation time based on improved genetic algorithm.基于改进遗传算法的带运输时间的柔性作业车间调度问题求解
Math Biosci Eng. 2019 Feb 20;16(3):1334-1347. doi: 10.3934/mbe.2019065.
3
Multiagent scheduling method with earliness and tardiness objectives in flexible job shops.柔性作业车间中具有提前和拖期目标的多智能体调度方法
IEEE Trans Syst Man Cybern B Cybern. 2005 Apr;35(2):293-301. doi: 10.1109/tsmcb.2004.842412.
4
A novel method-based reinforcement learning with deep temporal difference network for flexible double shop scheduling problem.一种基于新型方法的强化学习,结合深度时间差分网络用于柔性双车间调度问题。
Sci Rep. 2024 Apr 20;14(1):9047. doi: 10.1038/s41598-024-59414-8.
5
Research on multi-agent genetic algorithm based on tabu search for the job shop scheduling problem.基于禁忌搜索的多智能体遗传算法在作业车间调度问题中的研究。
PLoS One. 2019 Sep 27;14(9):e0223182. doi: 10.1371/journal.pone.0223182. eCollection 2019.
6
A Hyper-Heuristic Ensemble Method for Static Job-Shop Scheduling.一种用于静态作业车间调度的超启发式集成方法。
Evol Comput. 2016 Winter;24(4):609-635. doi: 10.1162/EVCO_a_00183. Epub 2016 Apr 27.
7
Application-aware deadline constraint job scheduling mechanism on large-scale computational grid.大规模计算网格上的面向应用的截止时间约束作业调度机制。
PLoS One. 2018 Nov 20;13(11):e0207596. doi: 10.1371/journal.pone.0207596. eCollection 2018.
8
Constraint satisfaction adaptive neural network and heuristics combined approaches for generalized job-shop scheduling.用于广义作业车间调度的约束满足自适应神经网络与启发式相结合的方法
IEEE Trans Neural Netw. 2000;11(2):474-86. doi: 10.1109/72.839016.
9
Day Surgery Scheduling and Optimization in Large Public Hospitals in China: A Three-Station Job Shop Scheduling Problem.中国大型公立医院日间手术调度与优化:一个三工位作业车间调度问题。
J Healthc Eng. 2022 Jul 30;2022:1149657. doi: 10.1155/2022/1149657. eCollection 2022.
10
Improved scheduling algorithm for signal processing in asynchronous distributed ultrasonic total-focusing-method system.异步分布式超声全聚焦法系统中信号处理的改进调度算法。
PLoS One. 2019 Feb 14;14(2):e0212285. doi: 10.1371/journal.pone.0212285. eCollection 2019.

引用本文的文献

1
GAILS: an effective multi-object job shop scheduler based on genetic algorithm and iterative local search.GAILS:一种基于遗传算法和迭代局部搜索的高效多目标作业车间调度器。
Sci Rep. 2024 Jan 24;14(1):2068. doi: 10.1038/s41598-024-51778-1.
2
Library-Based Raman Spectral Identification Using Multi-Input Hybrid ResNet.基于库的多输入混合残差神经网络拉曼光谱识别
ACS Omega. 2023 Sep 27;8(40):37482-37489. doi: 10.1021/acsomega.3c05780. eCollection 2023 Oct 10.

本文引用的文献

1
DeepFix: A Fully Convolutional Neural Network for Predicting Human Eye Fixations.DeepFix:一种用于预测人眼注视点的全卷积神经网络。
IEEE Trans Image Process. 2017 Sep;26(9):4446-4456. doi: 10.1109/TIP.2017.2710620.
2
Deep Convolutional Neural Network for Inverse Problems in Imaging.基于深度卷积神经网络的医学影像反问题研究
IEEE Trans Image Process. 2017 Sep;26(9):4509-4522. doi: 10.1109/TIP.2017.2713099. Epub 2017 Jun 15.