数据—模型混合驱动的车间动态调度理论与方法
项目来源
项目主持人
项目受资助机构
立项年度
立项时间
项目编号
研究期限
项目级别
受资助金额
学科
学科代码
基金类别
关键词
参与者
参与机构
项目受资助省
项目结题报告(全文)
1.A data-driven proactive scheduling approach for hybrid flow shop scheduling problem
- 关键词:
- Manufacture;Machine shop practice;COVID-19;Comparative experiments;Dynamic scheduling;Hybrid flow shop problem;Hybrid flow shop scheduling;Intelligent Manufacturing;Intelligent optimization algorithm;Manufacturing industries;Proactive scheduling
- Han, Dong;Li, Wangming;Li, Xinyu;Gao, Liang;Li, Yang
- 《ASME 2021 16th International Manufacturing Science and Engineering Conference, MSEC 2021》
- 2021年
- June 21, 2021 - June 25, 2021
- Virtual, Online
- 会议
As we all know, the COVID-19 pandemic brought a great challenge to manufacturing industry, especially for some traditional and unstable manufacturing systems. It reminds us that intelligent manufacturing certainly will play a key role in the future. Dynamic shop scheduling is also an inevitable hot topic in intelligent manufacturing. However, traditional dynamic scheduling is a kind of passive scheduling mode which takes measures to adjust disturbed scheduling processes after the occurrence of dynamic events. It is difficult to ensure the stability of production because of lack of proactivity. To overcome these shortcomings, manufacturing big data and data technologies as the core driving force of intelligent manufacturing will be used to guide production. Thus, a data-driven proactive scheduling approach is proposed to deal with the dynamic events, especially for machine breakdown. In this paper, the overall procedure of the proposed approach is introduced. More specifically, we first use collected manufacturing data to predict the occurrence of machine breakdowns and provide reliable input for dynamic scheduling. Then a proactive scheduling model is constructed for the hybrid flow shop problem, and an intelligent optimization algorithm is used to solve the problem to realize proactive scheduling. Finally, we design comparative experiments with two traditional rescheduling strategies to verify the effectiveness and stability of the proposed approach.Copyright © 2021 by ASME...2.Knowledge Graph-guided Convolutional Neural Network for Surface Defect Recognition
- 关键词:
- Convolution;Knowledge graph;Cost functions;Deep learning;Learning systems;Extraction;Surface defects;Benchmark datasets;Defect recognition;Extracting features;Intra-class variation;Knowledge graphs;Learning-based methods;Prediction accuracy;Recognition time
- Wang, Yucheng;Gao, Liang;Gao, Yiping;Li, Xinyu;Gao, Lili
- 《16th IEEE International Conference on Automation Science and Engineering, CASE 2020》
- 2020年
- August 20, 2020 - August 21, 2020
- Hong Kong, Hong kong
- 会议
Automatic surface defect recognition is very important to ensure product quality in modern manufacturing. In recent studies, deep learning-based methods develop rapidly because of its end-to-end training, but the difficult in collecting massive samples limits the application of these methods. Due to the intra-class variations and inter-class similarities in surface defect, it is difficult for the methods to extract features precisely. The knowledge graph can represent the relations of defect samples to improve the ability of extracting features. Therefore, this paper proposes a knowledge graph-guided convolutional neural network (KCNN) for surface defect recognition. Firstly, KCNN defines a knowledge graph by computing cosine distance of defect samples, which can represent the relations of defect samples. Secondly, KCNN uses the knowledge graph to define an extra cost function to guide the training of CNN, which can improve the abilities of extracting features of defect samples. The proposed method is tested on a benchmark dataset and the results show that KCNN achieves as high as 99.79% of the prediction accuracy on small sample training dataset (300 samples) without increasing the recognition time. Compared with other deep learning methods, KCNN achieves the best performances.
...
© 2020 IEEE.3.An improved q-learning based rescheduling method for flexible job-shops with machine failures
- 关键词:
- Job shop scheduling;Manufacture;Learning algorithms;Dispatching rules;Dynamic environments;Flexible job shops;Flexible job-shop scheduling problem;Machine failure;Optimal rescheduling;Q-learning algorithms;Scheduling schemes
- Zhao, Meng;Li, Xinyu;Gao, Liang;Wang, Ling;Xiao, Mi
- 《15th IEEE International Conference on Automation Science and Engineering, CASE 2019》
- 2019年
- August 22, 2019 - August 26, 2019
- Vancouver, BC, Canada
- 会议
Scheduling of flexible job shop has been researched over several decades and continues to attract the interests of many scholars. But in the real manufacturing system, dynamic events such as machine failures are major issues. In this paper, an improved Q-learning algorithm with double-layer actions is proposed to solve the dynamic flexible job-shop scheduling problem (DFJSP) considering machine failures. The initial scheduling scheme is obtained by Genetic Algorithm (GA), and the rescheduling strategy is acquired by the Agent of the proposed Q-learning based on dispatching rules. The agent of Q-learning is able to select both operations and alternative machines optimally when machine failure occurs. To testify this approach, experiments are designed and performed based on Mk03 problem of FJSP. Results demonstrate that the optimal rescheduling strategy varies in different machine failure status. And compared with adopting a single dispatching rule all the time, the proposed Q-learning can reduce time of delay in a frequent dynamic environment, which shows that agent-based method is suitable for DFJSP. © 2019 IEEE.
...4.Iterated local search for steelmaking-refining-continuous casting scheduling problem
- 关键词:
- Refining;Scheduling;Continuous casting;Local search (optimization);Combinatorial optimization;Scheduling algorithms;Steelmaking;Acceptance criteria;Combinatorial optimization problems;Initial solution;Iterated local search;Local search;Scheduling methods;Scheduling problem;Termination condition
- Peng, Kunkun;Pan, Quan-Ke;Wang, Ling;Deng, Xudong;Li, Congbo;Gao, Liang
- 《15th IEEE International Conference on Automation Science and Engineering, CASE 2019》
- 2019年
- August 22, 2019 - August 26, 2019
- Vancouver, BC, Canada
- 会议
Steelmaking-refining-Continuous Casting (SCC) scheduling is an important industrial scheduling problem, which is also a NP-hard combinatorial optimization problem. Efficient SCC scheduling methods can significantly improve the productivity efficiency. In this paper, an efficient Iterated Local Search (ILS) algorithm is devised for SCC scheduling. The ILS starts from an initial solution with certain quality, then executes a multiswap-based local search, subsequently carries out a cycle of perturbation with probability, neighborhood changing, Simulated Annealing (SA)-based local search, and acceptance criterion until termination condition is reached. The SA-based local search is devised to enhance the local search ability of the ILS, while the perturbation with probability is designed to guide the search to a promising area. Comparison experiments with several scheduling algorithms have shown the strength and effectiveness of the ILS.
...
© 2019 IEEE.5.A new joint data-model driven dynamic scheduling architecture for intelligent workshop
- 关键词:
- Inverse problems;Data Analytics;Memory architecture;Manufacture;Computation theory;Dynamic programming;Deep learning;Scheduling algorithms;Dynamic events;Dynamic scheduling;Intelligent Manufacturing;Intelligent workshop;Model-driven
- Peng, Kunkun;Li, Xinyu;Gao, Liang;Wang, Xi Vincent;Gao, Yiping
- 《ASME 2019 14th International Manufacturing Science and Engineering Conference, MSEC 2019》
- 2019年
- June 10, 2019 - June 14, 2019
- Erie, PA, United states
- 会议
Intelligent manufacturing plays a significant role in Industry4.0. Dynamic shop scheduling is a key problem and hot researchtopic in the intelligent manufacturing systems, which is NP-hard.However, traditional shop scheduling mode, dynamic eventprediction approach, scheduling model and schedulingalgorithm, cannot cope with increasingly complicated problemsunder kinds of scales production disruptions in the real-worldproduction. To deal with these problems, this paper proposes anew joint data-model driven dynamic scheduling architecture forintelligent workshop. The architecture includes four new and keycharacteristics in the aspects of scheduling mode, dynamic eventprediction, scheduling model and algorithm. More specifically,the new scheduling mode introduces data analytics methods toquickly and accurately deal with the dynamic events encounteredin the production process. The new prediction model improvesthe deep learning method, and further applies it predict thedynamic events accurately to provide reliable input to thedynamic scheduling. The new scheduling model proposes a newhybrid rescheduling and inverse scheduling model, which cancope with almost scales of abnormal production problems. Thenew scheduling algorithm hybridizes dynamic programming andintelligent optimization algorithm, which can overcome thedisadvantages of the two methods based on the analysis ofsolution space. The dynamic programming is employed toprovide high-quality initial solutions for the intelligentoptimization algorithm by reducing the computation timegreatly. To sum up, the presented architecture is a new attempt to understand the problem domain knowledge and broaden thesolving idea, which can also provide new theories andtechnologies to manufacturing system optimization and promotethe applications of the theoretical results. © ASME 2019 14th International Manufacturing Science and Engineering Conference. All rights reserved.
...6.Fault diagnosis using unsupervised transfer learning based on adversarial network
- 关键词:
- Fault detection;Signal processing;Learning systems;Deep neural networks;Adversarial networks;Case Western Reserve University;Comparison methods;Domain adaptation;Fault diagnosis method;Fault diagnosis model;Prediction accuracy;Unsupervised transfer learning
- Zhang, Zhao;Li, Xinyu;Wen, Long;Gao, Liang;Gao, Yiping
- 《15th IEEE International Conference on Automation Science and Engineering, CASE 2019》
- 2019年
- August 22, 2019 - August 26, 2019
- Vancouver, BC, Canada
- 会议
The fault diagnosis is very important for the modern industry. Due to machine working conditions changing frequently, most of current fault diagnosis models built on the training (source) domain can't perform well in test (target) domain. In addition, in test domain, there are few labeled data to adjust model to be adaptive to test working conditions. Domain adaptation, as one type of transfer learning, can be used to solve this problem. This paper proposes a novel fault diagnosis method using unsupervised transfer learning based on adversarial network. In this method, deep neural network is used to extract feature of fault signal while the adversarial network is used to accomplish the transfer learning process. Firstly, the fault signal is converted into RGB images as inputs of networks. Then, the adversarial training methods are used, which includes three training processes: the regular training process using source data, the maximum discrepancy training process and the minimum discrepancy training process. These three steps are adversarial to each other to adjust the model to be more adaptive. The method is tested on motor bearing dataset provided by Case Western Reserve University (CWRU). The prediction accuracies are better than other four comparison methods. © 2019 IEEE.
...7.Using Iterated Greedy with a New Population Approach for the Flexible Jobshop Scheduling Problem
- 关键词:
- Job shop scheduling;Flexible job-shop scheduling problem;Iterated Greedy;Shop scheduling;Telescopic Population
- Aqel, G. Al;Li, X.;Gao, L.;Gong, W.;Wang, R.;Ren, T.;Wu, G.
- 《2018 IEEE International Conference on Industrial Engineering and Engineering Management, IEEM 2018》
- 2018年
- December 16, 2018 - December 19, 2018
- Bangkok, Thailand
- 会议
The flexible job-shop scheduling problem (FJSP) is known as an important problem in manufacturing systems. Many methods have been proposed to solve this problem. The iterated greedy (IG) is one of those algorithms that are widely used in simpler shop scheduling problems. This research proposes a new Telescopic Population approach (TP) to assist the IG in solving the FJSP. The use of TP approach with IG provides an effective method that is also easier to reproduce. The performance of TP with IG proves that the new population approach effectively improves the performance of IG.
...
© 2018 IEEE.8.Application of Generative Adversarial Networks for Intelligent Fault Diagnosis
- 关键词:
- Deep learning;Generative adversarial networks;Time domain analysis;Fault detection;Machinery;Neural networks;Adversarial networks;Image conversion;Intelligent fault diagnosis;Machinery equipments;Pre-processing method;Stability and reliabilities;Time frequency analysis;Time-domain signal
- Cao, Sican;Wen, Long;Li, Xinyu;Gao, Liang
- 《14th IEEE International Conference on Automation Science and Engineering, CASE 2018》
- 2018年
- August 20, 2018 - August 24, 2018
- Munich, Germany
- 会议
Fault diagnosis has attracted great attention on preventing the serious consequences from happening and guaranteeing the stability and reliability of machinery equipment. With the rapid development of artificial intelligence, Deep Learning (DL) based approaches begin to play great importance in the field of fault diagnosis. In this research, we proposed an image conversion pre-processing method to transform the time-domain signals of fault diagnosis into 2D images. And a designed structure of Generative Adversarial Networks (GAN) modeled by Convolutional Neural Network (CNN) is proposed to make the classification of fault. Datasets with different capacities are also experimented to study the performance of GAN on limited data. The results illustrate the potential of GAN on the small sample classification of fault diagnosis. © 2018 IEEE.
...9.A Jointed Signal Analysis and Convolutional Neural Network Method for Fault Diagnosis
- 关键词:
- Electric fault currents;Systems engineering;Deep learning;Neural networks;Condition monitoring;Mathematical transformations;Fault detection;Signal analysis;Vibration analysis;Convolution ;Image enhancement;Learning methods;S transforms;Time-frequency techniques;Vibration signal;Vibration signal analysis;Well-established techniques
- Wen, Long;Gao, Liang;Li, Xinyu;Wang, Lihui;Zhu, Jichu
- 《51st CIRP Conference on Manufacturing Systems, CIRP CMS 2018》
- 2018年
- May 16, 2018 - May 18, 2018
- Stockholm, Sweden
- 会议
Fault diagnosis plays a vital role in the modern industry. In this research, a joint vibration signal analysis and deep learning method for fault diagnosis is proposed. The vibration signal analysis is a well-established technique for condition monitoring, and deep learning has shown its potential in fault diagnosis. In the proposed method, the time-frequency technique, named as S transform, is applied to transfer the vibration signals to images, and then an improved convolutional neural network (CNN) is applied to classify these images. The results show the proposed method has achieved the significant improvement.
...
© 2018 The Authors. Published by Elsevier B.V.10.An Effective Hybrid Algorithm for Permutation Flow Shop Scheduling Problem with Setup Time
- 关键词:
- Manufacture;Scheduling;Benchmarking;Machine shop practice;Hybrid algorithms;Neighborhood structure;Permutation flow-shop scheduling;Processing time;Production modeling;Set-up time;Urgent problems;Variable neighborhood search
- Peng, Kunkun;Wen, Long;Li, Ran;Gao, Liang;Li, Xinyu
- 《51st CIRP Conference on Manufacturing Systems, CIRP CMS 2018》
- 2018年
- May 16, 2018 - May 18, 2018
- Stockholm, Sweden
- 会议
Permutation flow shop scheduling problem (PFSP) exists widely in the manufacturing system. The traditional researches often considered setup time as one part of processing time. However, this assumption does not meet the requirement of the "more varieties, small batches" production model. Therefore, the PFSP with setup time becomes an urgent problem to be solved. This paper proposes an effective hybrid algorithm combining genetic algorithm and variable neighborhood search together. Several neighborhood structures are employed. A set of benchmarks has been used to evaluate its performance. By comparing with some famous algorithms, the merits of proposed method can be shown clearly.
...
© 2018 The Authors. Published by Elsevier B.V.
