The Journal of China Universities of Posts and Telecommunications ›› 2023, Vol. 30 ›› Issue (2): 49-60.doi: 10.19682/j.cnki.1005-8885.2023.0001

Previous Articles     Next Articles

Accuracy optimization of virtual iterative reduction algorithm under time constraint

Luo Zhiyong, Liu Xintong, Xu haifeng, Xie Zhiqiang, Li Jie   

  • Received:2022-03-15 Revised:2022-12-06 Online:2023-04-30 Published:2023-04-27
  • Contact: Zhi-Yong LUO
  • Supported by:
    Natural Science Foundation of Heilongjiang Province


The factors like production accuracy and completion time are the determinants of the optimal scheduling of the complex products work-flow, so the main research direction of modern work-flow technology is how to assure the dynamic balance between the factors. Based on the work-flow technology, restraining the completion time, and analyzing the deficiency of traditional minimum critical path algorithm, a virtual iterative reduction algorithm (VIRA) was proposed, which can improve production accuracy effectively with time constrain. The VIRA with simplification as the core abstracts a virtual task that can predigest the process by combining the complex structures which are cyclic or parallel, finally, by using the virtual task and the other task in the process which is the iterative reduction strategy, determines a path which can make the production accuracy and completion time more balanced than the minimum critical path algorithm. The deadline, the number of tasks, and the number of cyclic structures were used as the factors affecting the performance of the algorithm, changing the influence factors can improve the performance of the algorithm effectively through the analysis of detailed data. Consequently, comparison experiments proved the feasibility of the VIRA.

Key words: work-flow| virtual iterative reduction| time constraint| accuracy optimization| optimized scheduling