(3.230.76.48) 您好!臺灣時間:2021/04/12 14:33
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果

詳目顯示:::

我願授權國圖
: 
twitterline
研究生:游崑慈
研究生(外文):Yu, Kun-Ci
論文名稱:對隨機re-entrant系統,作有關排程政策的探討
論文名稱(外文):On the scheduling policy for stochastic re-entrain lines
指導教授:王家禮
指導教授(外文):Chia-Li Wang
學位類別:碩士
校院名稱:國立東華大學
系所名稱:應用數學研究所
學門:數學及統計學門
學類:數學學類
論文種類:學術論文
畢業學年度:84
語文別:中文
論文頁數:38
外文關鍵詞:.re-entrantFCFSLBFSFBFSmean waiting time
相關次數:
  • 被引用被引用:0
  • 點閱點閱:78
  • 評分評分:系統版面圖檔系統版面圖檔系統版面圖檔系統版面圖檔系統版面圖檔
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
Re-entrant lines are manufacturing system where parts may
return more than once to the same machine,for repeated stages of
processing.Example of such system are semiconductor
manufacturing plants.Scheduling problem arise to improve
performance measures such as mean waiting time,which is also
known as the mean "cycle time". In this paper, we use a
technique to obtain lower bound on the performance of re-entrant
lines, and improve Kumar's lower bound. We also analyze upper
bound of some typical policies.Especially for the FCFS policy,
we regard the system as a Kelly network. And takesome study, we
get a more easy method (tandem queues) to realize the system on
the mean waiting time. Moreover, we try to prove LBFS is better
than FCFS on the mean waiting time. We also present simulations
which confirm our intuition that W(LBFS) < W(FCFS) < W (FBFS).
Finally, some open problems are suggested.

QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top
系統版面圖檔 系統版面圖檔