【正文】 hms and make the improvement on it. Through the research on mathematics model of JSP and optimized algorithm, theimproved adaptive geic algorithm (IAGA) obtained by applying the improved sigmoidfunction to adaptive geic algorithm is proposed. And in IAGA for JSP, the fitness ofalgorithm is represented by pletion time of jobs. Therefore, this algorithm making thecrossover and mutation probability adjusted adaptively and nonlinearly with the pletiontime, can avoid such disadvantages as premature convergence, low convergence speed andlow stability. Experimental results demonstrate that the proposed geic algorithm does notget stuck at a local optimum easily, and it is fast in convergence, simple to be implemented. the job shop scheduling system based on IAGA and GASH is designed andrealized, and the functions and operations of the system modules are introduced detailedly. In the end ,according to the code with improved carries on the geic algorithms desing, this paper offer one improved geic algorithms about soloving to the job shop scheduling problem, and the simulated example has indicated that this algorithm is valid. Keywords: jop shop scheduling。 improvement chromosome code。盡我所知，除文中特別加以標(biāo)注和致謝的地方外，不包含其他人或組織已經(jīng)發(fā)表或公布過的研究成果，也不包含我為獲得 及其它教育機(jī)構(gòu)的學(xué)位或?qū)W歷而使用過的材料。 作 者 簽 名： 日 期： 指導(dǎo)教師簽名： 日 期： 使用授權(quán)說明 本人完全了解 大學(xué)關(guān)于收集、保存、使用畢業(yè)設(shè)計(jì)（論文）的規(guī)定，即：按照學(xué)校要求提交畢業(yè)設(shè)計(jì)（論文）的印刷本和電子版本；學(xué)校有權(quán)保存畢業(yè)設(shè)計(jì)（論文）的印刷本和電子版，并提供目錄檢索與閱覽服務(wù)；學(xué)?？梢圆捎糜坝　⒖s印、數(shù)字化或其它復(fù)制手段保存論文；在不以贏利為目的前提下，學(xué)?？梢怨颊撐牡牟糠只蛉績?nèi)容。除了文中特別加以標(biāo)注引用的內(nèi)容外，本論文不包含任何其他個(gè)人或集體已經(jīng)發(fā)表或撰寫的成果作品。本人完全意識到本聲明的法律后果由本人承擔(dān)。本人授權(quán) 大學(xué)可以將 本學(xué)位論文的全部或部分內(nèi)容編入有關(guān)數(shù)據(jù)庫進(jìn)行檢索，可以采用影印、縮印或掃描等復(fù)制手段保存和匯編本學(xué)位論文。 作者簽名： 日期： 年 月 日 導(dǎo)師簽名： 日期： 年 月 日 遼寧科技大學(xué)本科生畢業(yè)設(shè)計(jì) 第 V 頁 目 錄 摘 要 ......................................................................................................................................... I Abstract .................................................................................................................................... II 1 緒論 ......................................................................................................................................1 課題來源 .....................................................................................................................1 作業(yè)車間調(diào)度問題表述 .............................................................................................1 車間作業(yè)調(diào)度問題研究的假設(shè)條件及數(shù)學(xué)模型 .....................................................2 車間作業(yè)調(diào)度問題研究的假設(shè)條件 ...............................................................2 車間作業(yè)調(diào)度問題的數(shù) 學(xué)模型 .......................................................................3 課題研究內(nèi)容及結(jié)構(gòu)安排 .........................................................................................4 2 遺傳算法相關(guān)理論與實(shí)現(xiàn)技術(shù) ..................................................................................6 自然進(jìn)化與遺傳算法 .................................................................................................6 基本遺傳算法 .............................................................................................................7 遺傳算法的基本思路 .......................................................................................7 遺傳算法的模式定理 .......................................................................................7 遺傳算法的收斂性分析 ...................................................................................9 基本遺傳算法參數(shù)說明 ................................................................................. 10 遺傳算法的優(yōu)缺點(diǎn) ................................................................................................... 11 遺傳算法的優(yōu)點(diǎn) ............................................................................................. 11 遺傳算法的缺點(diǎn) ............................................................................................. 11 遺傳算法的進(jìn)展 ....................................................................................................... 12 小結(jié) ........................................................................................................................... 15 3 用遺傳算法對具體問題的解決與探討 .................................................................. 16 研究過程中的幾個(gè)關(guān)鍵問題 ................................................................................... 16 設(shè)備死鎖現(xiàn)象 ................................................................................................. 16 參數(shù)編碼 ......................................................................................................... 16 初始種群的生成 ............................................................................................. 19 個(gè)體的適應(yīng)度函數(shù) ......................................................................................... 20 遼寧科技大學(xué)本科生畢業(yè)設(shè)計(jì) 第 VI 頁 算法參數(shù) ......................................................................................................... 20 遺傳算子的設(shè)計(jì) ............................................................................................. 21 遺傳算法終止條件 ................................................................................................... 24 遺傳算法解決車間調(diào)度問題的改進(jìn) ....................................................................... 24 系統(tǒng)仿真 ................................................................................................................... 24 小結(jié) ........................................................................................................................... 29 結(jié) 論 ....................................................................................................................................... 30 致 謝 .......................................................................................................................................