Research On Data Storage Method For Integrated Scheduling

Currently, people keep eyes on better scheduling results and lower algorithmcomplexity. Though reducing algorithm complexity can improve schedulingeffective, the accessing speed of data which need to be delt also will impact onscheduling efficiency. On the other hand, when the quantity of information ofscheduling problem is large, the space occupied is also a problem which needs to beconsidered when dealing scheduling data.Aiming at the problem that the scheduling efficiency is not considered byintegrated scheduling algorithm currently, it proposes data storage method based onadjacent matrix. In this paper, adjacent matrix is constructed for each processingmachine, and sequential-linked storage structure which combines the features ofsequential storage structure and linked storage structure is designed for all adjacentmatrixes. In this way, the space where procedure’s attributes are saved can bereduced and searching procedures will be quick. At the same time, matrix-pathmethod is designed to obtain all paths’ length through limited calculating. And thenreduce the calculation time of integrated scheduling algorithm.For dynamic complex integrated scheduling problem, it proposes a methodwhich can improve efficiency of dynamic complex integrated scheduling. Thismethod opens up a dynamic storage area in internal storage which is used to storeprocedures which haven’t been processed by now and new product informationdynamically. So the scale of data storage can be reduced dynamically along withproduct processing, which can save storage space and improve the data storageefficiency. Considering storing and scheduling all products to guarantee theprocessing parallel, procedure name adjusted strategy is designed. The adjacentmatrix of products which are being processed will be updated in this paper when newproduct comes, which can store new products and remaining products in adjacent matrix unified.At last, in current studies on integrated scheduling data storage, morescheduling storage space and scheduling time are needed which caused by notconsidering the situation that there are special constraint relationship amongprocedures and selectable machine is not sole. Aiming at this problem, this paperproposes flexible integrated scheduling data storage method of complex problem.This method determines unique machine for procedure according to thesimplification strategy of flexible processing problem, and store procedureinformation by adjacent matrixes which are named by machine name. Set virtualadjacent matrix to store device-independent deferred procedures and fixed deferredprocedures, and set pointer to express close-joint relationship among procedures.This method can express the data structure of integrated scheduling problem ofcomplex problem, highlight data’s accessing speed, and reduce data’s storage spaceat the same time.