本文關(guān)鍵詞：綜合調(diào)度數(shù)據(jù)存儲(chǔ)方式的研究　出處：《哈爾濱理工大學(xué)》2012年碩士論文　論文類型：學(xué)位論文

  更多相關(guān)文章： 調(diào)度 數(shù)據(jù)存儲(chǔ) 鄰接矩陣 動(dòng)態(tài)綜合調(diào)度 復(fù)雜柔性綜合調(diào)度

【摘要】：目前對(duì)調(diào)度問題的研究大多著眼于調(diào)度算法的調(diào)度結(jié)果更優(yōu)和算法復(fù)雜度更低，雖然降低算法復(fù)雜度可以提高調(diào)度效率，但是被處理數(shù)據(jù)的存取速度也影響調(diào)度效率；另一方面，當(dāng)調(diào)度問題的信息量較大時(shí)，處理問題數(shù)據(jù)所占用的空間也是需要考慮的問題。 針對(duì)一般綜合調(diào)度問題提出的調(diào)度算法，本文提出了提高一般綜合調(diào)度系統(tǒng)數(shù)據(jù)存取效率的方法：一般綜合調(diào)度數(shù)據(jù)存儲(chǔ)方法。該方法為每一個(gè)加工設(shè)備建立鄰接矩陣，并為所有的鄰接矩陣設(shè)計(jì)了順序存儲(chǔ)結(jié)構(gòu)和鏈?zhǔn)酱鎯?chǔ)結(jié)構(gòu)相結(jié)合的線鏈?zhǔn)酱鎯?chǔ)結(jié)構(gòu)，以減少數(shù)據(jù)存儲(chǔ)所占空間并提高數(shù)據(jù)的訪問速度，同時(shí)，設(shè)計(jì)了矩陣路徑法，可通過有限次數(shù)的矩陣路徑運(yùn)算，迅速獲得加工樹模型的所有路徑及路徑長度，，降低基于擬關(guān)鍵路徑法的綜合調(diào)度算法的運(yùn)算時(shí)間。 在一般綜合調(diào)度數(shù)據(jù)存儲(chǔ)方法研究的基礎(chǔ)上，針對(duì)動(dòng)態(tài)復(fù)雜綜合調(diào)度問題，進(jìn)一步提出了動(dòng)態(tài)復(fù)雜綜合調(diào)度數(shù)據(jù)存儲(chǔ)方法。在內(nèi)存中開辟一動(dòng)態(tài)存儲(chǔ)區(qū)，用于動(dòng)態(tài)存儲(chǔ)當(dāng)前未加工工序和新到產(chǎn)品工序信息，這樣隨著產(chǎn)品加工的進(jìn)行，動(dòng)態(tài)縮小了數(shù)據(jù)存儲(chǔ)規(guī)模，節(jié)約了存儲(chǔ)空間，提高數(shù)據(jù)的存取效率。同時(shí)，考慮到對(duì)所有產(chǎn)品統(tǒng)一存儲(chǔ)并調(diào)度以保證產(chǎn)品加工的并行性，設(shè)計(jì)了基于動(dòng)態(tài)鄰接矩陣存儲(chǔ)的工序名調(diào)整策略，使新產(chǎn)品與剩余產(chǎn)品按統(tǒng)一形式存入動(dòng)態(tài)鄰接矩陣中并同時(shí)處理。 最后，針對(duì)目前一般綜合調(diào)度存儲(chǔ)方法的研究中，沒有考慮工序間存在特殊約束關(guān)系和工序可選加工設(shè)備不唯一的情況，使得調(diào)度存儲(chǔ)空間和調(diào)度時(shí)間需求較多的問題，提出了復(fù)雜柔性綜合調(diào)度數(shù)據(jù)存儲(chǔ)方法。該方法依據(jù)柔性加工問題的簡化策略，確定工序唯一加工設(shè)備，以設(shè)備名命名的鄰接矩陣分組存儲(chǔ)工序信息；設(shè)置虛擬設(shè)備鄰接矩陣存放設(shè)備無關(guān)延遲工序和固定延遲工序；設(shè)置指針表示工序緊密銜接關(guān)系。該方法合理的表示復(fù)雜問題柔性綜合調(diào)度問題的數(shù)據(jù)結(jié)構(gòu)，加快了數(shù)據(jù)的存取速度、降低了數(shù)據(jù)的存儲(chǔ)空間。
[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 .

【學(xué)位授予單位】：哈爾濱理工大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2012
【分類號(hào)】：TP333

【參考文獻(xiàn)】

相關(guān)期刊論文 前5條

1 謝志強(qiáng),劉勝輝,李樹生;關(guān)鍵設(shè)備工序緊湊的調(diào)度算法[J];哈爾濱理工大學(xué)學(xué)報(bào);2003年01期

2 熊禾根;李建軍;孔建益;楊金堂;蔣國璋;;考慮工序相關(guān)性的動(dòng)態(tài)Job shop調(diào)度問題啟發(fā)式算法[J];機(jī)械工程學(xué)報(bào);2006年08期

3 王凌,鄭大鐘;基于遺傳算法的Job Shop調(diào)度研究進(jìn)展[J];控制與決策;2001年S1期

4 趙巍,王萬良;改進(jìn)遺傳算法求解柔性job-shop調(diào)度問題[J];東南大學(xué)學(xué)報(bào)(自然科學(xué)版);2003年S1期

5 龔雨兵,李泉永;螞蟻算法在工件排序問題中的應(yīng)用[J];桂林電子工業(yè)學(xué)院學(xué)報(bào);2004年02期

本文編號(hào)：1369675