As a well-known NP-hard problem, the dynamic job shop scheduling problem has significant practical value, so this paper proposes an Improved Heuristic Kalman Algorithm to solve this problem. In Improved Heuristic Kalman Algorithm, the cellular neighbor network is introduced, together with the boundary handling function, and the best position of each individual is recorded for constructing the cellular neighbor network. The encoding method is introduced based on the relative position index so that the Improved Heuristic Kalman Algorithm can be applied to solve the dynamic job shop scheduling problem. Solving the benchmark example of dynamic job shop scheduling problem and comparing it with the original Heuristic Kalman Algorithm and Genetic Algorithm-Mixed, the results show that Improved Heuristic Kalman Algorithm is effective for solving the dynamic job shop scheduling problem. The convergence rate of the Improved Heuristic Kalman Algorithm is reduced significantly, which is beneficial to avoid the algorithm from falling into the local optimum. For all 15 benchmark instances, Improved Heuristic Kalman Algorithm and Heuristic Kalman Algorithm have obtained the best solution obtained by Genetic Algorithm-Mixed. Moreover, for 9 out of 15 benchmark instances, they achieved significantly better solutions than Genetic Algorithm-Mixed. They have better robustness and reasonable running time (less than 30 s even for large size problems), which means that they are very suitable for solving the dynamic job shop scheduling problem. According to the dynamic job shop scheduling problem applicability, the integration-communication protocol was presented, which enables the transfer and use of the Improved Heuristic Kalman Algorithm optimization results in the conventional Simio simulation environment. The results of the integration-communication protocol proved the numerical and graphical matching of the optimization results and, thus, the correctness of the data transfer, ensuring high-level usability of the decision-making method in a real-world environment.
The integrated pipe gallery, also known as urban lifeline, is a significant content of the smart city. While the video surveillance system is a crucial part of the integrated pipe gallery, which provides a basis for the construction of smart city. Due to the large amount of video data, manual monitoring is a time-consuming and laborious task. To address the above problems, we propose a neural network-based method that incorporates the concept of area under curve (AUC) with the multiple-instance learning (MIL) approach. We formulate the multiple-instance AUC (MIAUC) model that predicts high anomaly scores for anomalous segments. Furthermore, sparsity and temporal smoothness constraints are utilized in the loss function to better detect anomaly. To verify the effectiveness of our proposed method, a new database is established based on the video surveillance system, which consists of 110 real-world surveillance videos with a total length of 24 h. The experimental results on the real-world database show that our method achieves better performance as compared to the baselines methods. Moreover, we design a MIAUC-based video surveillance system and the practical effect reveals the prospect of utilizing the MIL method for person anomaly detection in the integrated pipe gallery.
This paper proposes an Improved Multi-phase Particle Swarm Optimization (IMPPSO) to solve a Dynamic Job Shop Scheduling Problem (DJSSP) known as an non-deterministic polynomial-time hard (NP-hard) problem. A cellular neighbor network, a velocity reinitialization strategy, a randomly select sub-dimension strategy, and a constraint handling function are introduced in the IMPPSO. The IMPPSO is used to solve the Kundakcı and Kulak problem set and is compared with the original Multi-phase Particle Swarm Optimization (MPPSO) and Heuristic Kalman Algorithm (HKA). The results show that the IMPPSO has better global exploration capability and convergence. The IMPPSO has improved fitness for most of the benchmark instances of the Kundakcı and Kulak problem set, with an average improvement rate of 5.16% compared to the Genetic Algorithm-Mixed (GAM) and of 0.74% compared to HKA. The performance of the IMPPSO for solving real-world problems is verified by a case study. The high level of operational efficiency is also evaluated and demonstrated by proposing a simulation model capable of using the decision-making algorithm in a real-world environment.
The employees’ knowledge level is crucial because it ensures the long-term social, environmental, and financial sustainability of a company’s operations on the global market. In doing so, there is a problem of how to measure the employees’ knowledge level within the segment, and improve it based on performed measures. In our research, we proposed the use of real-world problem solving for the purpose of determining and improving the employees’ knowledge level potential. In the study, we present a numerical modeling approach to evaluate real-world problem-solving capabilities and find out how the captured data influence the important parameters for determining the employee’s knowledge level. We have measured seven parameters (number of solutions, technological feasibility of the proposed solutions, team thinking activities, age, prior knowledge about sustainable production methods, and education level). By using linear regression, we have defined general forms of functional dependencies that enable the individual company to calculate and, if necessary, increase the employees’ knowledge level for their team. The results of the research show the correlation dependence of individual parameters, in which we found a close relationship between the employees’ knowledge level and age, as well as the technological feasibility of proposed solutions and educational level. In the final phase of the research, we conducted an experiment with mixed groups consisting of participants from different age groups, with the results showing a high degree of intergenerational integration importance.
29 July 2025 in Advances in Production Engineering & Management
With the intensification of China’s aging society, improving the health management and emergency response capabilities of the elderly at home has become an urgent issue that needs to be addressed. To meet this challenge, an Emergency Home Monitoring System (EHMS) that utilizes real-time data and wearable device monitoring is developed to optimize the Emergency Medical Transport Vehicle and Hospital Scheduling Problem (EMTVHSP) for elderly people at home. The patient's condition classification and waiting time are effectively combined to establish an Emergency Medical Transport Vehicle and Hospital Scheduling Model (EMTVHSM). Specifically, the optimization objective of the model is to minimize the maximum rescue time, thereby improving the allocation efficiency of medical resources and the efficiency of patient transfer. To solve this model, an Improved Quantum-behaved Particle Swarm Optimization (IQPSO) is proposed. The algorithm significantly improves the ability to solve complex scheduling problems by introducing neighborhood structure, improving constraint processing, introducing mutation operations and designing innovative resource reallocation strategies. Simulation results show that the dynamic resource scheduling method based on the IQPSO has significant advantages over traditional algorithms in reducing the maximum patient transfer time and improving scheduling efficiency and the optimization effect is improved by an average of 6.1 %. The emergency home monitoring system, scheduling model, and optimization algorithm designed effectively provide a more efficient emergency medical resource scheduling solution for elderly people at home and offer strong technical support and a practical basis for addressing health management challenges in an aging society.
About Me
Beijing Technology and Business University Higher Education Garden, Liangxiang, Beijing.
Beijing Technology and Business University Higher Education Garden, Liangxiang, Beijing.