Quantification-Based Scheduling for Heterogeneous Platform in Industrial Internet

Meeting the deterministic demands of industrial tasks can be quite challenging due to the diversity of devices and the unclear relationship between tasks and platforms in industrial edge computing scenarios. To tackle this issue, this study introduces an entropy-weighted scheduling method grounded in resource quantification. First, we scrutinized the affinity challenge when tasks operate across different platforms and broadened the scope of scheduling evaluation criteria within existing real-time systems. This expansion was accomplished by examining the alignment between various task attributes and platform characteristics through resource quantification. Subsequently, we employed the entropy weight method to handle the information entropy of all scheduling evaluation criteria and calculated the weighted sums to allocate the optimal scheduling device for each task. Ultimately, the entropy-weighted scheduling algorithm, which relies on resource quantification, was formulated to assess the algorithm’s scheduling performance under various parameter configurations. The experimental analysis indicated that the scheduling method based on resource quantification could effectively optimize the resource demand relationship between tasks and platforms, and the scheduling success rate of the proposed algorithm was 5.1%, 7.7%, and 34.5% higher than those of multitarget tracking sensor scheduling algorithm, D-Quantify, and RRA algorithms, respectively.