跳到主要內容

臺灣博碩士論文加值系統

(44.192.48.196) 您好!臺灣時間:2024/06/23 18:17
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

我願授權國圖
: 
twitterline
研究生:鄭雅云
研究生(外文):Ya-Yun Jheng
論文名稱:流程型生產系統下移轉批量於DBR排程方法之研究
論文名稱(外文):Drum-Buffer-Rope Scheduling for Transfer Batch in a Flow Shop System
指導教授:蘇純繒蘇純繒引用關係
指導教授(外文):Chwen-Tzeng Su
學位類別:碩士
校院名稱:國立雲林科技大學
系所名稱:工業工程與管理研究所碩士班
學門:工程學門
學類:工業工程學類
論文種類:學術論文
論文出版年:2009
畢業學年度:97
語文別:中文
論文頁數:80
中文關鍵詞:迴流移轉批量Drum-Buffer-Rope(DBR)限制理論(TOC)流程型生產系統
外文關鍵詞:Theory of Constraints (TOC)Flow shopReentryTransfer BatchDrum-Buffer-Rope(DBR)
相關次數:
  • 被引用被引用:1
  • 點閱點閱:437
  • 評分評分:
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
摘要
根據限制理論(TOC)的觀點所提出的Drum-Buffer-Rope(DBR),即是針對「限制資源」進行規劃的排程方法,而DBR強調以限制資源來決定適當的生產速度,特別在交期控制、在製品存貨以及產出率方面有明顯的助益。另外,在流程型(Flow shop)生產系統下由於各工件之製程具有完全一致性,故透過移轉批量(Transfer Batch)能使加工作業產生重疊(overlapping),達到縮短完工時間之目標。
過去文獻中可以發現,多數學者將移轉批量導入DBR排程方法時,皆單純針對限制資源進行移轉批量,卻無法在流程型生產系統下造成加工作業重疊,進而減少了縮短完工時間的效益。有鑑於此,本研究以DBR排程方法為基礎,在考慮瓶頸具迴流特性下,加入移轉批量的觀念,同時考慮系統全力配合,即瓶頸工作站前製與後製工作站生產排序問題,發展一適用於流程型生產系統下的改良式DBR排程方法。
經由求解品質測試可知,本研究所建構的改良式DBR排程方法,相較傳統只針對限制資源來壓縮緩衝時間的DBR排程方法,有較佳的排程績效,特別在總延遲時間方面其改善效果是更勝最大完工時間。另外,經由實驗結果得知在流程型生產系統下進行移轉批量可有效縮短系統之最大完工時間與總延遲時間,然而縮短之幅度以兩等批之效益為最大,且隨著移轉批量數之增加,縮短之幅度則逐漸趨緩。
ABSTRACT
Drum-buffer-rope (DBR) scheduling proposed by theory of constraints (TOC), it is mainly planed the scheduling aimed at resource constraint, among of due date, work in process, and throughput had conspicuous benefit especially in Drum-Buffer-Rope scheduling. By the way, because of any job’s processes are the same in a flow shop system; therefore application of transfer batch can resulted in jobs overlapping and shorten the makespan.
In last papers, many authors only used transfer batch with resource constraint in drum-buffer-rope scheduling, but that could not resulted in jobs overlapping and reduced short the makespan’s benefit. However, in this study, discussing the transfer batch based on drum-buffer-rope scheduling; moreover, consider the reentry, transfer time, buffer time, and coordination in the flow shop system to propose a modified drum-buffer-rope scheduling.
According to the example test, the modified drum-buffer-rope scheduling in this study was better than others, especially the objective function of total tardiness time. By the way, the experimentation results showed that using transfer batch had a great effect upon the objective function of makespan and total tardiness time in flow shop system. Two equal sublots made the largest benefit; however, the benefits were gradually reduced with increasing the number of sublots.
目錄
中文摘要 i
英文摘要 ii
誌謝 iii
目錄 iv
表目錄 vi
圖目錄 vii
第一章 緒論 1
1.1 研究背景與動機 1
1.2 研究目的 3
1.3 研究範圍與假設 3
1.4 研究流程 4
第二章 文獻探討 7
2.1 限制理論 7
2.2 DBR排程方法 8
2.2.1 DBR排程方法名詞及相關定義 9
2.2.2 DBR排程方法的執行方式與步驟 12
2.2.3瓶頸迴流下生產節奏之設計 16
2.2.4 DBR排程方法相關文獻探討 18
2.3 移轉批量 21
2.3.1 移轉批量對完工時間的影響 21
2.3.2 移轉批量相關文獻探討 25
第三章 研究方法 30
3.1 問題描述 30
3.2 排程方法建構 32
3.2.1 第一階段 33
3.2.2 第二階段 39
3.3 範例說明 47
第四章 實驗結果與分析 54
4.1問題描述與參數設定 54
4.2績效衡量指標 55
4.3 改良式DBR排程方法求解品質測試 55
4.4實驗結果與分析 57
4.5敏感度分析 68
4.5.1敏感度分析-生產批量 68
4.5.2敏感度分析-搬運時間 71
4.5.3敏感度分析-緩衝時間 73
第五章 結論與建議 75
5.1結論 75
5.2建議 76
參考文獻 77
參考文獻
一、中文部份
[1]吳宗典,2006,彈性流程式生產系統下多產品最適批量分割之研究,屏東科技大學,工業管理系碩士論文。
[2]吳鴻輝,2000,“瓶頸迴流前後作業之最佳作業間隔模式研究”,工業工程學刊,第17卷,第4期,第349~358頁。
[3]吳鴻輝、李榮貴,2007,限制驅導式現場排程與管理技術,全華科技圖書,台北。
[4]周德華,2001,多目標迴流環境下之限制驅導式排程系統,國立中央大學,工業管理研究所碩士論文。
[5]張志輝,2004,雙產能限制資源下限制驅導式生產排程,南台科技大學,工業管理研究所碩士論文。
[6]邱煥能、張仁輝,1996,“流程型工廠單產品批量流移運批量最佳配置與探索解模式之研究”,工業工程學刊,第13卷,第4期,第329~341頁。
[7]陳邑鑫,2004,考慮瓶頸作業下的排成方法,南台科技大學,工業管理研究所碩士論文。
[8]諶承正,2001,運用系統模擬與基因演算法執行限制理論於流線型生產,國立台北科技大學,生產系統工程與管理研究所碩士論文。
[9]駱景堯,1999,“零工型生產系統下批量流研究”,工業工程學刊,第16卷,第6期,第671~680頁。
[10]駱景堯、葉進儀、許瑞麟,2004,“批量分割零工型排程之影響分析”,工業工程學刊,第21卷,第2期,第193~202頁。
[11]陳傳旺,2004,輸送機製造廠產品交期控制方法之研究,國立台灣科技大學,工業管理系碩士論文。
二、英文部份
[12]Blackstone, J.H., 2001, “Theory of Constraints-A Status Report”, International Journal of Production Research, Vol.39, pp.1053-1080.
[13]Bogasehewsky, R.W., Buscher, U.D. and Lindner, G., 2001, “Optimizing multi-stage production with constant lot size and varying number of unequal sized batches” , OMEGA, Vol.29, pp.183-191.
[14]Chang, J.H. and Chiu, H.N., 2005, “A Comprehensive Review of Lot Streaming” , International Journal of Production Research, Vol.43, No.8, pp.1515-1536.
[15]Chen, J. and Steiner, G., 1997, “Approximation methods for discrete lot streaming in flow shops” , Operations Research Letters, Vol.21, pp.139-145.
[16]Goldratt, E.M., 1990, Theory of constraints, North River Press, Inc.
[17]Goldratt, E.M. and Cox, J., 1986, The Goal, North River Press, Inc.
[18]Godfrey, C. O., 2001, “Tabu Search-Based Algorithm For The TOC Product Mix Decision” , International Journal of Production Research, Vol.39, No.10, pp.2065-2076.
[19]Guide Jr. V.D.R., 1996, “Scheduling Using Drum-Buffer-Rope in A Remanufacturing Environment” , International Journal of Production Research, Vol.34, No.4, pp.1081-1091.
[20]Huff, 2001, “Using Drum-Buffer-Rope Scheduling Rather Than Just-In-Time Production” , Table contents of management Winter 2001.
[21]Jin, B., Luh, P.B. and Thakur, L.S.,1999, “An effective optimization-based algorithm for job shop scheduling with fixed-size transfer lots” , Journal of Manufacturing Systems, Vol.18, pp.284-300.
[22]Kalir, A.A. and Sarin, S.C., 2001, “A near-optimal heuristic for the sequencing problem in multiplebatch flow-shops with small equal sublots” , OMEGA, Vol.29, pp.577-584.
[23]Kumar, S., Bagchi, T.P. and Sriskandarajah, C., 2000, “Lot streaming and scheduling heuristics for m-machine no-wait flowshops” , Computers and Industrial Engineering, Vol.38, pp.149-172.
[24]Lawrence, S. R. and Buss, A. H., 1994, “Shifting Production Bottlenecks: Causes, Cures, and Conundrums” , Production and Operations Management, Vol. 3, No. 1.
[25]Liu, S.C., Chen, E.C. and Liu, H. T., 2006, “A Heuristic Method for Multi-Product Variable Lot Streaming in A Flow Shop“ , Journal of the Chinese Institute of Industrial Engineers, Vol.23, No.1, pp.65-79.
[26]Lundrigan, R., 1986, “What is This Thing Called OPT?” , Production and Inventory Management, vol. 27, No.2, pp.2-12.
[27]Marimuthu, S., Ponnambalam, S.G. and Jawahar, N., 2007, “Tabu search and simulated annealing algorithms for scheduling in flow shops with lot streaming” , Proc. IMechE, Vol.221 Part B: J. Engineering Manufacture.
[28]Ranga, V.R., Haizhen, F., Duncan. K.H.F. and Jack, C.H., 2000, “Lot streaming in multistage production systems” , International Journal of Production Economics, Vol.66, pp.199-211.
[29]Ronen, B. and Spector, Y., 1992, “Managing System Constraint: A Cost/Utilization Approach,” International Journal of Production Research, Vol. 30, No.9, pp.2045-2061.
[30]Schragenheim, E. and Ronen, B., 1990, “Drum-Buffer-Rope Shop Floor Control” , Production and Inventory Management Journal, Vol.31, No.3, pp.18-22.
[31]Sirikrai, V. and Yenradee, P., 2006, “Modified drum–buffer–rope scheduling mechanism for a non-identical parallel machine flow shop with processing-time variation” , International Journal of Production Research, Vol.44, No.17, pp.3509-3531.
[32]Sridharan, V., William, L. B. and Udayabhanu, V., 1992, “Freezing the Master Production Schedule under Rolling Planning Horizon” , Management Science, Vol.33, pp.1137-1149.
[33]Stephane, D. P. and Lasserre, J. B., 1993, “An iterative procedure for lot-streaming in job shop scheduling” , Computers and Industrial Engineering, Vol.25, No.1, pp.231-234.
[34]Trietsch, D. and Baker, K. R., 1993, “Basic techniques for lot streaming” , Operations Research, Vol.41, No.6, pp.1065-1076.
[35]Umble, M. and Srikanth, M. L., 1996, Synchronous Manufacturing, The Spectrum Publishing, Inc.
[36]Vickson, R. G. and Alfredson,B. E., 1992, “Two and three machine flow shop scheduling problem with equal sized transfer batch” , International Journal of Production Research, Vol.30, No.10, pp.1551-1574.
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top