跳到主要內容

臺灣博碩士論文加值系統

(44.222.189.51) 您好!臺灣時間:2024/05/26 21:05
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

我願授權國圖
: 
twitterline
研究生:黃琦欽
研究生(外文):Cin-Chin Huang
論文名稱:彈性流程式生產系統批量分割排程問題之研究
論文名稱(外文):Lot-Splitting Scheduling Problem on Flexible Flow Shop Research
指導教授:吳忠敏吳忠敏引用關係
指導教授(外文):Chung-Min Wu
口試委員:邱志洲陳春龍
口試委員(外文):Chih-Chou ChiuChuen-Lung Chen
口試日期:2008-06-25
學位類別:碩士
校院名稱:國立臺北科技大學
系所名稱:商業自動化與管理研究所
學門:商業及管理學門
學類:企業管理學類
論文種類:學術論文
論文出版年:2008
畢業學年度:96
語文別:中文
論文頁數:116
中文關鍵詞:批量分割派工法則彈性流程式生產
外文關鍵詞:Lot-SplittingDispatching RuleFlexible Flow Shop
相關次數:
  • 被引用被引用:0
  • 點閱點閱:239
  • 評分評分:
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
  企業為了提升競爭力及滿足顧客的需求,同時生產多樣化的產品,每項產品也經由不同的流程加工。為了能夠達成交貨的目標,採取多部機器同時生產產品,而形成彈性流程式生產方式,且工件分割為數個子批同時在不同的機器上操作也在實務上經常發生,過去研究在此較少著墨,考慮的因素經常過於簡化。因此本研究將探討在彈性流程式的生產系統下考慮將工件分割同時操作,其中考量完全相同平行機器、相依整備時間及整數解。
  派工法則使用的難易度低及在求解的時間上有良好的表現,實務上也經常使用,而在考慮工件分割的情況下,並無一套方式來決定派工法則之後應該使用機器數量。本研究將使用派工法則及發展決定適當的機器使用數方法。目標為降低工件延遲比率。實驗經由大量數據模擬,考慮不同的工件數量、跳站率、工作站數量、工作站內機器數、生產單位數量、單位處理時間、產品種類、整備時間及交期鬆緊因子,使用18個派工法則上配合不同工件機器使用數量方式,以C#程式語言撰寫模擬程式,每一情境組合均進行30次的模擬,將結果轉換成相對績效指標進行分析。
  在經由大量數據模擬後,得到以派工法則STSLACK/OP配合變動式分割方式,在大部分的情況下,平均為最佳的結果,而變動式分割相較於固定機器使用上限的方法上,有較良好的表現。在求解速度方面也相當迅速平均為155.63毫秒。本研究結果相信能提供理論研究者、現場工程師及生產管理系統開發商參考價值。
In order to enhance competitiveness, companies usually adopt diversified production strategies to fulfill the sundry demands of customers. Flow shop is a common manufacturing type. The products are processed via different procedures in the environment. In order to improve capacity and deliver goods on time, adding multiple machines at the same stage is a popular strategy adopted by manufacturers. For this reason, the manufacturing type is turning flow shop into flexible flow shop.
And a job is split apart into several lots and operated on multiple machines at the same time often taken place on the practice. However, the literature of lot-splitting is actually rare on this question. Therefore, this research studies the flexible flow shop scheduling problem with lot-splitting and sequence-dependent setup times.
Dispatching rules are easy to use and have good efficiencies. Hence, dispatching rules are often used in practice. But under the situation of lot-splitting, for my best knowledge, there are no methods can determine how many machines that must be used at present. Therefore, this research will use dispatching rules and develop one algorithm which can decide how many machines will be used at each scheduling decision. The objective is to optimize the number of tardy jobs. The experiment considers several factors such as number of jobs, skipping the stage rate, number of stages, number of machines in the stage, number of products, processing times, product types, setup time and due-date tightness. Eighteen dispatching rules are also examined in the research. All algorithms are implemented by C# program language.
The experiment results show the dispatching rule STSLACK/OP with the variation splitting method is the best algorithm in most conditions. In addition, the variation splitting method is the best number of machines deciding method. The algorithm is very efficient and the average computational time of the algorithm is 155.63 millisecond. We believe the results of research can help theory researchers, field engineers, developers of production management system to reference.
中文摘要 i
ABSTRACT ii
誌謝 iv
目錄 v
圖目錄 viii
表目錄 ix
第一章 緒論 1
1.1 研究背景 1
1.2 研究動機與目的 2
1.3 研究範圍與限制 4
1.4 研究流程與步驟 4
第二章 文獻探討 6
2.1排程定義 6
2.2排程的類型 7
2.3排程方法 8
2.4派工法則 10
2.5常用的排程績效指標 12
2.6彈性流程式排程問題 14
2.6.1流程式排程問題 14
2.6.2平行機器排程問題 16
2.6.3彈性流程式排程問題 17
2.7整備時間的排程問題 19
2.8批量分割的排程問題 20
2.9小結 22
2.10 生產實例 23
第三章 研究方法 28
3.1 研究的問題與假設 28
3.2實驗模擬流程 29
3.3績效衡量準則 32
3.4選用之派工法則 32
3.5機器使用數的決定 35
3.6實驗設計 39
第四章 實驗結果與分析 42
4.1 模擬實驗分析 42
4.1.1派工法則 42
4.1.2工件數量 44
4.1.3跳站率 47
4.1.4工作站數量 49
4.1.5工作站內機器數 51
4.1.6工件單位生產數量 53
4.1.7單位工件處理時間 55
4.1.8產品種類 57
4.1.9整備時間 59
4.1.10交期鬆緊因子 61
4.1.11小結 63
4.2工件分割績效分析 64
4.3計算時間分析 69
參考文獻 72

附錄A 工件數不同情境下派工法則與分割方式工件延遲比率RDI 81
附錄B 跳站率不同情境下派工法則與分割方式工件延遲比率RDI 85
附錄C 工作站數不同情境下派工法則與分割方式工件延遲比率RDI 89
附錄D 站內機器數不同情境下派工法則與分割方式工件延遲比率RDI 93
附錄E 單位生產數量不同情境下派工法則與分割方式工件延遲比率RDI 97
附錄F 單位處理時間不同情境下派工法則與分割方式工件延遲比率RDI 101
附錄G 產品種類不同情境下派工法則與分割方式工件延遲比率RDI 105
附錄H 整備時間不同情境下派工法則與分割方式工件延遲比率RDI 109
附錄I 交期鬆緊因子不同情境下派工法則與分割方式工件延遲比率RDI 113
英文部分
1.Allahverdi, A. & Gupta, J. N. D. & Aldowaisan, T., 1999. “A review of scheduling research involving setup considerations,” Omega, Vol.27, pp.219-239.
2.Allaoui, H. & Artiba, A., 2004. “Integrating simulation and optimization to schedule a hybrid flow shop with maintenance constraints,” Computers and Industrial Engineering Vol.47, Issue: 4, pp.431-450.
3.Anghinolfi, D. & Paolucci, M., 2007. “Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach,” Computers and Operations Research, Vol.34, pp.3471-3490.
4.Azizoglu, M. & Kirca, O., 1998. “Tardiness minimization on parallel machines,” International Journal of Production Economics, Vol.55, Issue: 2, pp.163-168.
5.Azizoglu, M. & Kirca, O., 1999. “On the minimization of total weighted flow time with identical and uniform parallel machines,” European Journal of Operational Research, Vol.113, Issue: 1, pp.91-100.
6.Brucker, P. 2007. Scheduling Algorithms, Fifth Edition, pp1-2.
7.Baker, K. R.& Kanet, J. J., 1983. “Job shop scheduling with modified due dates,” Journal of Operations Management, Vol.4, pp. 11-22.
8.Baker, K.R., 1974. Introduction to Sequencing and Scheduling. Wiley, New York.
9.Barmafn, S., 1997. “Simple priority rule combinations: an approach to improve both flow time and tardiness,” International Journal Production Research, Vol. 35(10), pp.2857-2870.
10.Brucker, P., 2007. Scheduling Algorithms, Fifth Edition, pp1-2.
11.Chandrasekharan, R. & Oliver, H., 1999.” A comparative study of dispatching rules in dynamic flowshops and jobshops,” European Journal of Operational Research, Vol.116, pp.156-170.
12.Chandrasekharan, R. &, Knut A., 2007. “Dispatching in flowshop with bottlence machines,” Computers & Industrial Engineering. Vol 52, pp89-186.
13.Chang, F. C. R., 1996, ”A study of due-date assignment rules with constrained tightness in a dynamic job shop,” Computer and Industrial Engineering, Vol.31(1/2), 205-208.
14.Chinyao, L., 2005. “Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines,” Computers & Operations Research, Vol.32, pp.2013-2025.
15.Choi, S.-W. & Kim, Y.-D. & Lee, G.-C., 2005. “Minimizing total tardiness of order with reentrant lots in a hybrid flowshop,” International Journal of Production Research. Vol.34, No.11, pp.2149-2167.
16.Dessouky, M. I. & Marcellus, R. L. & Zhang, L., 1998. “Scheduling Identical Jobs on Uniform Parallel Machines with Random Processing Times,” Computers & Industrial Engineering, Vol.35, Issue: 1-2, pp.109-112.
17.Framinan, J. M., 2007. “An adaptive branch and bound approach for transforming job shops into flow shops,” Computers & Industrial Engineering, Vol.52, Issue: 1, pp.1-10
18.French, S., 1982. Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop, Ellis Horwood, Chichester, UK.
19.Ghaith, R. & Moraga, R. J., 2006. “Heuristics for the unrelated parallel machine scheduling problem with setup times.” Journal of Intelligent Manufacturing, Vol.17, pp.85-97.
20.Gupta, J.N.D. & Ruiz-Torres, A. J., 2005. “Generating efficient schedules for identical parallel machines involving flow-time and tardy jobs,” European Journal of Operational Research, Vol.67, Issue: 3, pp. 679-695.
21.Haupt, R., 1989. “A survey of priority rule-based scheduling,” OR Spektrum, Vol.11, pp.3-16.
22.Holthaus, O. & Rajendran, C, 1997.”Efficient dispatching rules for scheduling in a job shop,” International journal of production economics, Vol.48, pp. 87-105.
23.Hurink, J. & Knust, S., 2001. “List scheduling in a parallel machine environment with precedence constraints and setup times,” Operations Research Letters Vol.29, Issue: 5, pp.231-239.
24.Inneke, V. N & Nico, V., 2004. “Determining the optimal number of sublots in a single-product, deterministic flow shop with overlapping operations,” International Journal of Production Economics, Vol.92, pp. 221-239.
25.Jacek, B. & Klua, H. E. & Erwin, P & Gunter, S & Jan, W., 2001. Scheduling Computer and Manufacturing Processes, Second Edition, pp247.
26.Jacobs, F. R. & Bragg, D.J., 1988. “Repetitive lots: Flow time reduction through sequencing and dynamic batch size,” Decision Sciences, Vol.19 (2), pp.281-194.
27.Jin, F. & Song, S & Wu, C., 2007. “An improved version of the NEH algorithm and its application to large-scale flow-shop scheduling problems,” IIE Transactions. Vol. 39, Iss. 2, pp.229.
28.Joseph, Y-T. L. & Hairong, Z., 2005. “Minimizing mean flowtime and makespan on master–slave systems,” Journal of Parallel and Distributed Computing, Vol.65, Issue 7, pp.843-856.
29.Kalczynski, P. J. & Kamburowski, J., 2005. “A heuristic for minimizing the makespan in no-idle permutation flow shops,” Computers & Industrial Engineering Vol.49, Issue: 1, pp.146-154.
30.Kalir, A. A. & Sarin, S. C., 2000 “Evaluation of the potential benefits of lot streaming in flow-shop systems,” International Journal of Production Economics, Vol. 66, Issue 2, pp.131-142.
31.Kim, D-W. & Kim, K-H. & Jang, W. & Chen, F. F., 2002. “Unrelated parallel machine scheduling with setup times using simulated annealing,” Robotics and Computer-Integrated Manufacturing, Vol.18, Issue: 3-4, pp.223-231.
32.Kim, D-W. & Na, D-G. & Chen, F. F., 2003. “Unrelated parallel machine scheduling with setup times and a total weighted tardiness objective,” Robotics and Computer-Integrated Manufacturing.Voo.19, Issue: 1-2, pp.173-181.
33.Kim, S.C. & Bobrowski, P.M., 1994. “Impact of sequence-dependent setup time on job shop scheduling performance,” International Journal of Production Research, Vol.32, Issue: 7, pp.1503-1520.
34.Kis, T. & Pesch, E., 2005. “A review of exact solution methods for the non-preemptive multiprocessor flowshop problem,” European Joumal of Operational Research, Vol.164 (3), pp.592-608
35.Kızıl, M. & Özbayrak, M. & Papadopoulou, T. C., 2006. “Evaluation of dispatching rules for cellular manufacturing,” ORIGINAL ARTICLE.
36.Koulamas, C. & Kyparisis, G. J., 2000. “Scheduling on uniform parallel machines to minimize maximum lateness,” Operations Research Letters, Vol.26, Issue: 4, pp. 175-179.
37.Koulamas, C. & Kyparisis, G. J., 2004. “Makespan minimization on uniform parallel machines with release times,” European Journal of Operational Research, Vol.157, Issue: 1, pp.262-266.
38.Kurz, M. E. & Askin, R. G., 2003. ” Comparing scheduling rules for flexible flow lines.” International Journal of Production Economics, Vol.85, Issue: 3, pp. 371-388.
39.Kurz, M. E. & Askin, R. G., 2004. “Scheduling flexible flow lines with sequence-dependent setup times,” European Journal of Operational Research Vol.159, Issue: 1, pp. 66-82
40.Kyparisis, G. J. & Koulamas, C., 2006. “Flexible flow shop scheduling with uniform parallel machines,” European Journal of Operational Research Vol.168, Issue: 3, February 1, pp.985-997
41.Lee, G-C. & Kim, Y-D. & Kim, J-G. & Choi, S-H., 2003. ”A dispatching rule-base approach to production scheduling in a printed circuit board manufacturing system,” Journal of the Operation Researrch Society, Vol.54, pp.1038-1049.
42.Leon, V.J. & Ramamoorthy, B., 1997. “An adaptable problem-space-based search method for flexible flow line scheduling,” IIE Transactions Vol.29, pp.115-125.
43.Li, X. & Liu, L. & Wu, C., 2006 “A Fast Method for Heuristics in Large-Scale Flow Shop Scheduling,” Tsinghua Science & Technology, Vol.11, Issue: 1, pp.12-18.
44.Liu, K. C., 1998. “Dispatching rules for stochastic finite capacity scheduling,”Computers and Industrial Engineering, Vol. 35(1), pp.113-116.
45.Marimuthu, S. & Ponnambalam, S.G. & Jawahar, N., 2008 “Evolutionary algorithms for scheduling m-machine flow shop with lot streaming,” Robotics and Computer Integrated Manufacturing, Vol.24, Issue: 1, pp.125-139.
46.Mary E. K. & Ronald G. A., 2003. ” Comparing scheduling rules for flexible flow lines,” Production Economics, Vol.85, pp.371-388.
47.Min, L. & Cheng, W., 1999. “A genetic algorithm for minimizing the makespan in the case of scheduling identical parallel machines,” Artificial Intelligence in Engineering, Vol.13, Issue: 4 , pp. 399-403.
48.Mohsen, Z. & Sadjadi, S. J., 2007. “Mixed binary integer programming formulations for the flow shop scheduling problems. A case study: ISD projects scheduling,” Applied Mathematics and Computation, Vol.185, Issue 1, pp.218-228.
49.Nessah, R. & Yalaoui, F. & Chu, C., 2008. “A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates,” Computers and Operations Research, Vol.35, Issue: 4, pp.1176-1190.
50.Nieuwenhuyse, I. V. & Vandaele, N., 2004. “Determining the optimal number of sublots in a single-product, deterministic flow shop with overlapping operations,” International Journal of Production Economics, Vol.92, Issue 3, Pages 221-239.
51.Paolo, S. 1996. “Scheduling jobs on on several machines with the job Splitting property.” Operations Research, Vol.44, NO.4, pp.617-628.
52.Pinedo, M., 1995. Scheduling Theory, Algorithms and Systems, Prentice Hall, Englewood Cliffs, NJ.
53.Pinedo, M., 2002. Scheduling Theory, Algorithms, And Systems, Second Edition, Prentice Hall, pp14-15.
54.Quadt, D. & Kuhn, H., 2007. “A taxonomy of flexible flow line scheduling procedures.” European Journal of Operational Research,Vol.178, Issue: 3, pp. 686-698
55.Quadt, D.& Kuhn, H., 2007 "Batch scheduling of jobs with identical process times on flexible flow lines" International Journal of Production Economics, pp. 385-401
56.Rajendran, C. & Alicke, K., 2007. “Dispatching in flowshops with bottleneck machines”, Computers & Industrial Engineering, Vol.52, 89-106.
57.Rajendran, C. & Holthaus, O., 1999. ”A comparative study of dispatching rules in dynamic flowshops and jobshops,” European Journal of Operational Research, Vol. 116, pp.156-170.
58.Ramasesh, R. V. & Fu, H. & Fong, D. K. H. & Hayya, J. C., 2000. ”Lot streaming in multistage production systems,” International Journal of Production Economics Vol.66, Issue: 3, pp.199-211
59.Reiter, S., 1966. “A system for managing job shop production,” Journal of Business, Vol.34, pp.371-393.
60.Ruben, R. A. & Mahmoodi, F., 1998. "Lot Splitting in unbalanced production systems", Decision Sciences, Vol.29, pp.921-949.
61.Rocha, P. L. & Ravetti, M. G. & Mateus, G. R. & Pardalos, P. M. 2008. “Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times” Computers and Operations Research, Vol.35, Issue: 4, pp.1250-1264.
62.Rocha, P. L. & Ravetti, M. G. & Mateus, G. R. & Pardalos, P. M., 2008. “Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times,” Computers and Operations Research, Vol.35, Issue: 4, pp.1250-1264.
63.Ruben, R, A. & Mahmoodi, F., 1998. “Lot Splitting in Unbalanced Production Systems,” Decision Sciences. Vol.29.
64.Sawik, T., 2002. “Balancing and scheduling of surface mount technology lines,” International Journal of Production Research, Vol.40(9), 1973-1991.
65.Shim, S-O. & Kim, Y-D., 2008. “A branch and bound algorithm for an identical parallel machine scheduling problem with a job Splitting property,” Computers and Operations Research. Vol.35, Issue: 3, pp. 863-875.
66.Stefan, V. & Witt, A., 2007. “Hybrid flow shop scheduling as a multi-mode multi-project scheduling problem with batching requirements: A real-world application,” International Journal of Production Economics. Vol.105, Issue: 2, pp. 445-458.
67.Subramaniam, V. & Lee, G. K. & Hong, G. S. & Wong, Y. S. & Ramesh, T., 2000. “Dynamic selection of dispatching rules for job shop scheduling,” Production Planning & Control, Vol.11 (1), pp.73-81.
68.Süer, G. A. & Aidsa, S., 2008. “Identical machine scheduling to minimize the number of tardy jobs when lot-Splitting is allowed,” Computers and Industrial Engineering, Vol.33, Issue 3-4, pp.277 – 280.
69.Trietsch, D. & Baker K. R., 1993. "Basic techniques for lot streaming", Operations Research,” Vol.41, pp.1065-1076.
70.Truscott, W., 1986. ”Production scheduling with capacity constrained transportation activities,” Journal of Operational Management, pp333-348.
71.Wagner, B. J. & Ragatz, G. L., 1994. “The impact of lot Splitting on due date performance,” Journal of Operations Management, Vol.12 (1), pp.13-25.
72.Waikar, A. M. & Sarker, B. R. & Lal, A. M., 1995. “A comparative study of some priority dispatching rules under different shop loads,” Production Planning & Control, Vol. 6(4), pp.301-310.
73.Wang, L. & Zhang, L. & Zheng, D-Z., 2006. “An effective hybrid genetic algorithm for flow shop scheduling with limited buffers,” Computers and Operations Research, Vol.33, Issue: 10, pp.2960-2971.
74.Yalaoui, F. & Chu, C., 2002. “Parallel machine scheduling to minimize total tardiness” International Journal of Production Economics, Vol.76, Issue: 3, pp.265-279.
75.Yoon, S-H & Ventura, J. A. 2002. “Minimizing the mean weighted absolute deviation from due dates in lot-streaming flow shop scheduling,” Computers & Operations Research, Vol.29, Issue 10, pp.1301-1315.
76.Young, H. L. & Pinedo, M., 1997. “Scheduling jobs on parallel machines with sequence-dependent setup times,” European Journal of Operational Research, Vol.100, Issue: 3, pp.464-474.
77.Zandieh, M. & Fatemi G. S. M. T. & Moattar H. S. M., 2006. “An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times,” Applied Mathematics and Computation. Vol.180, Issue: 1, pp.111-127.
78.Zhang, W. & Yin, C. & Liu, J. & Linn, R. j., 2005. “Multi-job lot streaming to minimize the mean completion time in m-1 hybrid flowshops,” International Journal of Production Economics. Vol.96, pp.189-200.

中文部分
1.曾毓文,2001,運用系統模擬與遺傳演算法從事非相關平行機器排程之研究,國立台北科技大學,生產系統工程與管理研究所碩士論文
2.湯璟聖,2003,動態平衡機群排程的探討,中原大學,工業工程學系碩士論文。
3.鄧紫文,2004,實際零工式生產派工法則之選擇:靜態系統,國立政治大學,資訊管理研究所碩士論文。
4.鍾承志,2004,多目標零工式平行機台排程之研究-應用蟻群最佳化演算法,東海大學,工業工程與經營資訊學系碩士論文。
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top