單機(jī)下最小化最大延遲問題的滾動調(diào)度方法研究.pdf_第1頁
已閱讀1頁,還剩64頁未讀, 繼續(xù)免費(fèi)閱讀

下載本文檔

版權(quán)說明:本文檔由用戶提供并上傳,收益歸屬內(nèi)容提供方,若內(nèi)容存在侵權(quán),請進(jìn)行舉報或認(rèn)領(lǐng)

文檔簡介

1、 學(xué)校代碼:10255 學(xué) 號:2130854 單機(jī)下最小化最大延遲問題的滾動調(diào)度方法研究 單機(jī)下最小化最大延遲問題的滾動調(diào)度方法研究 ROLLING HORIZON ALGORITHMS FOR THE SINGLE MACHINE MAXIMAL DELAY TIME SCHEDULING PROBLEM WITH RELEASE DATES 學(xué)科專業(yè):物流工程 作者姓名:王鴿 指導(dǎo)教師:王長軍 答辯日期:2015.5.14

2、 單機(jī)下最小化最大延遲問題的滾動調(diào)度方法研究 II ROLLING HORIZON ALGORITHMS FOR THE SINGLE MACHINE MAXIMAL DELAY TIME SCHEDULING PROBLEM WITH RELEASE DATES ABSTRACT Production scheduling problem is widely concerned since the 1970s, and until n

3、ow still is the research challenge. In the final analysis is for its NP-hard attributes. Although genetic, taboos and other neighborhood algorithm, Job-based, Time-based and other rolling algorithm has a number of studie

4、s, this problems still have research value from the angle of realistic and academic research. This paper is from the perspective of the single machine scheduling problem. And discuss how to get the minimum of maximal del

5、ay time scheduling in a dynamic environment. The problem is a NP hard and it is the basis for the scheduling problem. On the basis of the job dynamic arrival and shortage of the existing rolling scheduling, this paper pr

6、oposes a Collision-Window Based rolling scheduling method. This scheduling strategy uses a new decomposition problem method to make the sub-problem to be a un NP-hard problem, and the scheduling performance is no longer

7、affected by the job release density. This paper proposes the specific algorithm steps of CWB rolling scheduling algorithm. It is to prove that the new algorithm result is more stable and more outstanding under different

8、job release density and different job number, comparing the new algorithm with EDD, 2 kinds of traditional rolling algorithms and other algorithms using C language programming and large-scale simulation. At the same time

9、 the computation speed of the new algorithm is faster compared with the two traditional rolling algorithms due to the polynomial solution of the sub-problem. KEY WORDS: single machine, rolling scheduling, dynamic, releas

溫馨提示

  • 1. 本站所有資源如無特殊說明,都需要本地電腦安裝OFFICE2007和PDF閱讀器。圖紙軟件為CAD,CAXA,PROE,UG,SolidWorks等.壓縮文件請下載最新的WinRAR軟件解壓。
  • 2. 本站的文檔不包含任何第三方提供的附件圖紙等,如果需要附件,請聯(lián)系上傳者。文件的所有權(quán)益歸上傳用戶所有。
  • 3. 本站RAR壓縮包中若帶圖紙,網(wǎng)頁內(nèi)容里面會有圖紙預(yù)覽,若沒有圖紙預(yù)覽就沒有圖紙。
  • 4. 未經(jīng)權(quán)益所有人同意不得將文件中的內(nèi)容挪作商業(yè)或盈利用途。
  • 5. 眾賞文庫僅提供信息存儲空間,僅對用戶上傳內(nèi)容的表現(xiàn)方式做保護(hù)處理,對用戶上傳分享的文檔內(nèi)容本身不做任何修改或編輯,并不能對任何下載內(nèi)容負(fù)責(zé)。
  • 6. 下載文件中如有侵權(quán)或不適當(dāng)內(nèi)容,請與我們聯(lián)系,我們立即糾正。
  • 7. 本站不保證下載資源的準(zhǔn)確性、安全性和完整性, 同時也不承擔(dān)用戶因使用這些下載資源對自己和他人造成任何形式的傷害或損失。

評論

0/150

提交評論