In this paper, a real-time scheduling problem of a dual-resource flexible job shop with robots is studied. Multiple independent robots and their supervised machine sets form their own work cells. First, a mixed integer programming model is established, which considers the scheduling problems of jobs and machines in the work cells, and of jobs between work cells, based on the process plan flexibility. Second, in order to make real-time scheduling decisions, a framework of multi-task multi-agent reinforcement learning based on centralized training and decentralized execution is proposed. Each agent interacts with the environment and completes three decision-making tasks: job sequencing, machine selection, and process planning. In the process of centralized training, the value network is used to evaluate and optimize the policy network to achieve multi-agent cooperation, and the attention mechanism is introduced into the policy network to realize information sharing among multiple tasks. In the process of decentralized execution, each agent performs multiple task decisions through local observations according to the trained policy network. Then, observation, action, and reward are designed. Rewards include global and local rewards, which are decomposed into sub-rewards corresponding to tasks. The reinforcement learning training algorithm is designed based on a double-deep Q-network. Finally, the scheduling simulation environment is derived from benchmarks, and the experimental results show the effectiveness of the proposed method.

To improve the accuracy of rolling-bearing fault diagnosis and solve the problem of incomplete information about the feature-evaluation method of the single-measurement model, this paper combines the advantages of various measurement models and proposes a fault-diagnosis method based on multi-measurement hybrid-feature evaluation. In this study, an original feature set was first obtained through analyzing a collected vibration signal. The feature set included time- and frequency-domain features, and also, based on the empirical-mode decomposition (EMD)-obtained time-frequency domain, energy and Lempel–Ziv complexity features. Second, a feature-evaluation framework of multiplicative hybrid models was constructed based on correlation, distance, information, and other measures. The framework was used to rank features and obtain rank weights. Then the weights were multiplied by the features to obtain a new feature set. Finally, the fault-feature set was used as the input of the category-divergence fault-diagnosis model based on kernel principal component analysis (KPCA), and the fault-diagnosis model was based on a support vector machine (SVM). The clustering effect of different fault categories was more obvious and classification accuracy was improved.

This paper studied a class of coupling problems of material assignment, part nesting, kit delivery and parallel machine scheduling. The aim of this paper was to solve the scheduling problem of metal structural part processing and welding assembly with eligibility constraints. A two-stage mixed-integer programming model was constructed. The eligibility constraints took into account the material type of parts and nesting. The objectives were to minimize the makespan, maximize material utilization and minimize the kit delivery metrics (kitting time and numbers of earliness and tardiness of kits). A hierarchical optimization approach was proposed. The scheduling model was solved by using the Gurobi solver in the first stage, and the results were used to constrain the second stage. The second stage of the scheduling model was solved using an improved multi-objective genetic algorithm. Due to the strong coupling relationships among the sorting of parts, the sorting of each profile and the sorting of each material, a hybrid encoding and decoding mode was designed for part sorting with eligibility constraints. Finally, the proposed scheduling approach was applied to actual production cases. The data showed that when the number of components exceeded 300 (the number of parts was about 1500), the material utilization reached 95%. Choosing a suitable number of machines, machine utilization reached 90%. The results demonstrated the effectiveness of the proposed scheduling model and algorithm.