Study on Data Storage of Dynamic Integrated Scheduling

Abstract Aiming at the problem that current dynamic integrated scheduling algorithms haven’t considered the effect on scheduling efficiency by scheduling time, a method which is Data Storage of Dynamic Integrated Scheduling is proposed. This method sets a queue in buffer zone which is employed to dynamically store procedures which have been sequenced. Then procedures which have been processed out of sequence. So the scale of data storage can be reduced dynamically, and the accessing efficiency of data can be improved. And design Procedure Name Adjusted Strategy Based on Dynamic Adjacent Matrix Storage to store new product and remaining products in adjacent matrix unified. Analysis and example show that this method can obtain quicker data access speed and lower data storage space than sequential storage style and linkage storage style which are adopted usually.