综合调度数据存储方式的研究

发布时间：2018-01-02 14:41

本文关键词：综合调度数据存储方式的研究　出处：《哈尔滨理工大学》2012年硕士论文　论文类型：学位论文

【摘要】：目前对调度问题的研究大多着眼于调度算法的调度结果更优和算法复杂度更低，虽然降低算法复杂度可以提高调度效率，但是被处理数据的存取速度也影响调度效率；另一方面，当调度问题的信息量较大时，处理问题数据所占用的空间也是需要考虑的问题。针对一般综合调度问题提出的调度算法，本文提出了提高一般综合调度系统数据存取效率的方法：一般综合调度数据存储方法。该方法为每一个加工设备建立邻接矩阵，并为所有的邻接矩阵设计了顺序存储结构和链式存储结构相结合的线链式存储结构，以减少数据存储所占空间并提高数据的访问速度，同时，设计了矩阵路径法，可通过有限次数的矩阵路径运算，迅速获得加工树模型的所有路径及路径长度，，降低基于拟关键路径法的综合调度算法的运算时间。在一般综合调度数据存储方法研究的基础上，针对动态复杂综合调度问题，进一步提出了动态复杂综合调度数据存储方法。在内存中开辟一动态存储区，用于动态存储当前未加工工序和新到产品工序信息，这样随着产品加工的进行，动态缩小了数据存储规模，节约了存储空间，提高数据的存取效率。同时，考虑到对所有产品统一存储并调度以保证产品加工的并行性，设计了基于动态邻接矩阵存储的工序名调整策略，使新产品与剩余产品按统一形式存入动态邻接矩阵中并同时处理。最后，针对目前一般综合调度存储方法的研究中，没有考虑工序间存在特殊约束关系和工序可选加工设备不唯一的情况，使得调度存储空间和调度时间需求较多的问题，提出了复杂柔性综合调度数据存储方法。该方法依据柔性加工问题的简化策略，确定工序唯一加工设备，以设备名命名的邻接矩阵分组存储工序信息；设置虚拟设备邻接矩阵存放设备无关延迟工序和固定延迟工序；设置指针表示工序紧密衔接关系。该方法合理的表示复杂问题柔性综合调度问题的数据结构，加快了数据的存取速度、降低了数据的存储空间。
[Abstract]:At present , most researches on scheduling problem focus on scheduling algorithm scheduling results and lower complexity , while reducing the complexity of the algorithm can improve the scheduling efficiency , but the access speed of the processed data also affects the scheduling efficiency ; on the other hand , when the amount of information of the scheduling problem is large , the space occupied by the processing problem data is also a problem to be considered . In order to reduce the occupied space of data storage and improve the access speed of data , the paper designs a matrix path method , which can quickly obtain all the paths and the path length of the processing tree model and reduce the computation time of the comprehensive scheduling algorithm based on the quasi - critical path method . On the basis of the research of general comprehensive scheduling data storage method , a dynamic complex comprehensive scheduling data storage method is proposed for dynamic complex integrated scheduling problem . A dynamic storage area is opened up in memory to dynamically store the current unprocessed process and new product process information . As the product processing progresses , the data storage size is reduced dynamically , the storage space is saved , and the access efficiency of data is improved . Finally , in the research of the general comprehensive scheduling storage method , there is no special constraint relation between the working procedures and the fact that the process alternative processing equipment is not unique , so that the scheduling storage space and the scheduling time need more problems , and the complex flexible comprehensive scheduling data storage method is proposed . According to the simplification strategy of the flexible processing problem , the process unique processing equipment is determined , the device name is named as the neighborhood matrix grouping storage process information , the setting pointer represents the close connection relation of the process , the method reasonably represents the data structure of the flexible comprehensive scheduling problem of complex problems , and the access speed of the data is accelerated , and the storage space of the data is reduced .

【学位授予单位】：哈尔滨理工大学
【学位级别】：硕士
【学位授予年份】：2012
【分类号】：TP333

【参考文献】