Digital-twin-based job shop multi-objective scheduling model and strategy

Job scheduling is an important part of production management and an effective method for increasing productivity, improving enterprise competitiveness, and reducing production energy consumption. However, in traditional scheduling, some problems, such as low information transparency, response lag, poor accuracy, and poor optimisation, affect the scheduling performance. Therefore, this study presents a digital-twin-based (DT-based) job shop scheduling strategy to address these problems. First, energy consumption is introduced, and a job shop scheduling model that minimises the completion time, tardiness, and energy consumption is established. Then, a scheduling decision framework based on cloud-edge computing is proposed, and the DT-based job shop system composition and operating mechanism are described. In addition, a DT-based shop scheduling strategy, comprising an overall scheduling mechanism, an accurate processing time determination method that uses a time and space compression ratio simulation, and a data comparison and abnormality determination method, is designed. Moreover, the non-dominated sorting genetic algorithm (NSGA-II) is improved by incorporating a multi-mode crossover and random variation method, along with a variable proportion elite retention strategy. Finally, the effectiveness of the improved algorithm and proposed strategy is verified using a standard dataset and practical processing problem.

Automated summary

Job scheduling is crucial for production management, and a digital-twin-based strategy is proposed to overcome the limitations of traditional scheduling methods. This strategy includes the introduction of energy consumption, establishment of a scheduling model, proposal of a cloud-edge computing decision framework, and design of a DT-based shop scheduling strategy. The non-dominated sorting genetic algorithm is also improved to enhance the scheduling performance. Experimental results demonstrate the effectiveness of the proposed strategy and algorithm.