(18.204.227.34) 您好!臺灣時間:2021/05/17 05:51
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果

詳目顯示:::

我願授權國圖
: 
twitterline
研究生:陳柏廷
研究生(外文):Po-ting Chen
論文名稱:雙機流程式生產具有批次整備時間之製造與組裝排程
論文名稱(外文):Manufacture and Assembly Scheduling with Batch Setup Times in a Two-Machine Flowshop
指導教授:廖慶榮廖慶榮引用關係
指導教授(外文):Ching-Jong Liao
學位類別:碩士
校院名稱:國立臺灣科技大學
系所名稱:工業管理系
學門:商業及管理學門
學類:其他商業及管理學類
論文種類:學術論文
論文出版年:2008
畢業學年度:96
語文別:英文
論文頁數:30
中文關鍵詞:排程兩階段組裝設置時間共同元件
外文關鍵詞:SchedulingTwo-stage assemblySetup timeCommon components
相關次數:
  • 被引用被引用:0
  • 點閱點閱:121
  • 評分評分:
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
在兩階段組裝排程的相關文獻中,通常不考慮設置時間 (Setup time)。然而,在很多實際的製造環境中,第一階段常牽涉到設置時間。此論文將焦點放在兩階段組裝且包含設置時間之問題,且更進一步討論多個共同元件的問題,目標式設定為最小化最大完工時間。因為此問題已被證明為NP-hard,所以我們提出一個啟發法求解此問題,並以下限值評估啟發法之績效。實驗結果證明,此啟發法可在極短的時間內得到近似最佳解,其平均誤差為0.714%。
In the scheduling literature about the two-stage assembly, the setup time is often ignored. However, an explicit consideration of setup time in the first stage is usually required in many practical manufacturing environments. This thesis considers a two-stage assembly scheduling of product problem with setup time to minimize the makespan (or maximum completion time). In this problem, the product consists of one or more common components. Since the problem is NP-complete, we propose a heuristic to solve the problem and evaluate the performance of the heuristic by a tight lower bound. Computational results show that the heuristic can obtain a near optimal solution in almost zero time and the average percentage deviation is only 0.714.
CHINESE ABSTRACT i
ENGLISH ABSTRACT ii
ACKNOWLEDGEMENTS iii
LIST OF FIGURES vi
LIST OF TABLES vii
Chapter 1. INTRODUCTION 1
1.1. Research motivation and objectives 1
1.2. Problem description 2
1.3. Research process and thesis organization 4
Chapter 2. LITERATURE REVIEW 7
2.1. Two-stage assembly scheduling problem without setup 7
2.2. Two-stage assembly scheduling problem with setup 8
Chapter 3. PROPOSED HEURISTIC 10
3.1. The proposed heuristic 10
3.2. An illustrated example 13
Chapter 4. BRANCH AND BOUND ALGORITHM 16
4.1. Development of a lower bound 16
4.2. Development of a branch and bound algorithm 17
Chapter 5. COMPUTATIONAL RESULTS 19
5.1. Generation of test problems 19
5.2. Performance of the proposed heuristic 20
5.3. Performance of the lower bound 25
Chapter 6. CONCLUDING REMARKS AND FUTURE RESEARCH 27
6.1. Concluding remarks 27
6.2. Future research 28
REFERENCES 29
Allahverdi, A., Al-Anzi, F. S. (2006). Evolutionary heuristics and an algorithm for the two-stage assembly scheduling problem to minimize makespan with setup times. International Journal of Production Research, 44, 4713-4735.
Al-Anzi, F. S., Allahverdi, A. (2007). A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times. European Journal of Operational Research, 182, 80-94.
Cheng, T. C. E., Wang, G. (1999). Scheduling the fabrication and assembly of components in a two-machine flowshop. IIE Transactions, 31, 135-143.
Hariri, A. M. A., Potts, C. N. (1997). A branch and bound algorithm for the two-stage assembly scheduling problem. European Journal of Operational Research, 103, 547-556.
He, D., Babayan, A., Kusiak, A. (2001). Scheduling manufacturing systems in an agile environment. Robotics and Computer Integrated Manufacturing, 17, 87-97.
He, D., Babayan, A. (2002). Scheduling manufacturing systems for delayed product differentiation in agile manufacturing. International Journal of Production Research, 40, 2461-2481.
Johnson, S. M. (1954). Optimal two-and three-stage production schedules with setup times included. Naval Research Logistics Quarterly, 1, 61-68.
Kusiak, A. (1989). Aggregate scheduling of a flexible machining and assembly system. IEEE Transactions on Robotics and Automation, 5, 451-459.
Li, K. Y., Willis, R. J. (1992). An iterative scheduling technique for resource-constrained project scheduling. European Journal of Operational Research, 56, 370-379.
Lee, C. Y., Cheng, T. C. E., Lin, B. M. T. (1993). Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem. Management Science, 39, 616-625.
Lin, B. M. T., Cheng, T. C. E. (2002). Fabrication and assembly scheduling in a two-machine flowshop. IIE Transactions, 34, 1015-1020.
Liao, C. J., Liao, L. M., Tseng, C. T. (2006). A performance evaluation of permutation vs. non-permutation schedules in a flowshop. International Journal of Production Research, 44, 4297-4309.
Liao, C. J., Liao, C. C. (2007). An ant colony optimisation algorithm for scheduling in agile manufacturing. International Journal of Production Research, 46, 1813-1824.
Potts, C. N., Sevast'janov, S. V., Strusevich, V. A., Van Wassenhove, L. N., Zwaneveld, C. M. (1995). The two-stage assembly scheduling problem: complexity and approximation. Operations Research, 43, 346-355.
Tandon, M., Cummings, P. T., LeVan, M. D. (1991). Flowshop sequencing with non-permutation schedules. Computers & Chemical Engineering, 15, 601-607.
Yokoyama, M. (2004). Scheduling for two-stage production system with setup and assembly operations. Computers & Operations Research, 31, 2063–2078.
Yokoyama, M. (2008). Flow-shop scheduling with setup and assembly operations. European Journal of Operational Research, 187, 1184-1195.
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top