• 沒有找到結果。

結論與未來研究

5.1 結論

本研究針對雙流線型工廠排程,加入等候時間限制之考量,同時進行加工途程與加 工順序之決策。在進行排程預排時,考量等候時間限制可確保工件之良率,但卻會降低 機台之產能利用,增加總完工時間並降低產出。因此,本研究建構一基因演算法,考量 各工件之等候時間限制,以兩廠最長總完工時間之最小化為目標,同時決策工件之加工 途程與加工順序。

針對雙流線型工廠排程之加工途程決策,本研究之基因演算法可同時分析跨廠與不 跨廠兩種加工途程。並且,根據生產情境之不同,提供滿足等候時間限制及維持產出能 力之加工途程建議。

對於加工順序之決策,本研究結合三種單一派工法,產生組合派工法則。透過四種 不同生產情境之實驗得知,除了本研究提出之組合派工法,其餘方法皆有績效極差之情 境,驗證了組合派工法之排程穩健性。在不知現實生產情境適用何種派工法時,可建議 使用本研究之組合派工法。雖未必可得到最佳之排程,但能產生不錯之可行解,避免最 差之排程結果。此外,組合派工法之求解時間,在工件數多時,亦為預排排程之可接受 時間。

本研究提出之組合派工法包含三種單一派工法,除了具有較為穩健之排程績效外,

選擇那些派工法進行結合,亦是本研究之貢獻。如果目標式為總完工時間,但卻選考量 交期之派工法來進行權重組合,對排程績效之改善將無幫助。因此,找出三種派工法使 總完工時間能有效降低,為本研究之另一貢獻。

本研究對雙流線型工廠排程之貢獻,在於加工途程與加工順序之決策上,除了滿足 等候時間限制確保良率,並同時維持產能利用及產出,最小化兩廠之總完工時間,使能 答覆客戶之訂單交期縮短,提升企業競爭力。並且,透過跨廠加工途程之考量,整合兩 廠產能,進行生產排程規劃。

5.2 未來研究

在本研究中,工件如具等候時間限制,其限制之時間皆假設相同。但現實生產環境 中,各工件之等候時間限制,可能因批量大小,產品特性等因素,有長短之分。若等工 件之等候時間限制低於跨廠運輸之時間,則此工件便不適合跨廠加工,否則便會於運輸 過程產生良率問題。因此,可針對等候時間限制與跨廠運輸時間長短之不同,擴充本研 究之問題模型,分析這些因素對加工途程與加工順序決策之影響。

除了等候時間限制與兩廠加工效率之外,影響跨廠決策之因素相當多,例如各工件 之加工時間變異、各工作站之加工時間變異、等候時間限制長短、運輸時間長短等等。

這些因素可能單一項即對加工途程決策產生影響,亦有可能多項因素結合起來產生不同 的影響。因此,可建議為未來研究延伸之方向,分析跨廠決策與各項加工資訊的相關性 與適合情境。

另一個延伸方向,是將本研究維持產出之單一目標,加入交期之考量。在完成排程 預排後,可得知各工件之確定交期。根據此交期,在實際現場進行排程,考量機台當機、

插單、等候時間限制等因素。修正本研究基因演算法之加工途程與加工順序之解讀,使 之能滿足交期、良率及產出能力,並且在不同情境下亦能具備排程穩健性。

參考文獻(英文部分)

Allahverdi A., Gupta J.N.D. and Aldowaisan T. (1999). A review of scheduling research involving setup considerations. Omega-International Journal of Management Science 27:

219-239.

Allaoui H. and Artiba A. (2004). Integrating simulation and optimization to schedule a hybrid flow shop with maintenance constraints. Computers & Industrial Engineering 47: 431-450.

Allahverdi A., Ng C.T. and Cheng T.C.E. (2008). A survey of scheduling problems with setup times or costs. European Journal of Operational Research 187: 985-1032.

Cheng T.C.E., Gupta J.N.D. and Wang G.Q. (2000). A review of flowshop scheduling research with setup times. Production and Operations Management 9: 262-282.

Dabbas R.M., Chen H.N., Arora G. and McCarville D.R. (1999). An approach for combining multiple dispatching criteria at motorola MEMSI semiconductor fabrication facility. Sumer Computer Simulation Conference.

Dabbas R.M., Chen H.N., Fowler J.W. and Shunk D. (2001). A combined dispatching criteria approach to scheduling semiconductor manufacturing systems. Computers & Industrial Engineering 39: 307-324.

Dabbas R.M. and Fowler J.W. (2003). A new scheduling approach using combined dispatching criteria in wafer fabs. IEEE Transactions on Semiconductor Manufacturing 16:

501-510.

Dabbas R.M., Fowler J.W., Rollier D.A. and McCarville D. (2003). Multiple response optimization using mixture-designed experiments and desirability functions in semiconductor scheduling. International Journal of Production Research 41: 939-961.

FranÇa P.M., Tin G. and Buriol L.S. (2006). Genetic algorithms for the no-wait flowshop sequencing problem with time restrictions. International Journal of Production Research

44: 939-957.

Goldberg D.E. (1989). Genetic algorithms in search, optimization and machine learning.

Addison-Wesley, Boston.

Guinet A. (2001). Multi-site planning: A transshipment problem. International Journal of Production Economics 74: 21-32.

Holland J.H. (1975). Adaptation in Neural and Artificial Systems. University of Michigan Press, Ann Arbor.

Janiak A., Kozan E., Lichtenstein M. and Oguz C. (2007). Metaheuristic approaches to the hybrid flow shop scheduling problem with a cost-related criterion. International Journal of Production Economics 105: 407-424.

Jungwattanakit J., Reodecha M., Chaovalitwongse P. and Werner F. (2008). Algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria.

The International Journal of Advanced Manufacturing Technology 37: 354-370.

Low C. (2005). Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines. Computers & Operations Research 32: 2013-2025.

Montgomery D.C. (2001). Design and Analysis of Experiments, fifth ed., John Wiley & Sons, Inc., NJ, 427-510.

Reeves C.R. (1995). A genetic algorithm for flowshop sequencing. Computer Operation Research 22: 5–13.

Scheffe H. (1958). Experiments with mixtures. J. Roy. Statist. Soc. Ser. B. 20: 344-360

Scholl W. and Domaschke J. (2000). Implementation of Modeling and Simulation in Semiconductor Wafer Fabrication with Time Constraints between Wet Etch and Furnace Operations. IEEE Transactions on Semiconductor Manufacturing 13: 273-277.

Sambasivan M. and Yahya S. (2005). A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers.

Computers & Operations Research 32: 537-555.

Toba H., Izumi H., Hatada H. and Chikushima T. (2005). Dynamic load balancing among

multiple fabrication lines through estimation of minimum inter-operation time. IEEE Transactions on Semiconductor Manufacturing 18: 202-213.

Tu Y.M. and Liou C.S. (2006). Capacity Determination Model with Time Constraints and Batch Processing in Semiconductor Wafer Fabrication. Journal of the Chinese Institute of Industrial Engineers 23: 192-199.

Tajan J.B.C., Sivakumar A.I. and Gershwin,S.B. (2007). Control of Job Arrivals with Processing Time Windows into Batch Processor Buffer. Manufacturing Systems and Technology.

Wang L. and Zheng D.Z. (2003). An effective hybrid heuristic for flowshop scheduling.

International Journal of Advanced Manufacturing Technology 21: 38-44.

Wu M.C. and Chang W.J. (2007). A short-term capacity trading method for semiconductor fabs with partnership. Expert Systems with Applications 33: 476-483.

Wu M.C., Chen C.F. and Shih C.F. (2008). Route Planning for Two Wafer Fabs with Capacity-Sharing Mechanisms. International Journal of Production Research DOI:

10.1080/00207540802172029.

Yang D.L. and Chern M.S. (1995). A two-machine flowshop sequencing problem with limited waiting time constraints. Computers and Industrial Engineering 28: 63-70.

參考文獻(中文部分)

古庭諭 (2006),「多廠區多階製程之訂單分配─以半導體晶圓針測與 IC 封測產業為例」,

碩士論文,元智大學。

張美滿 (2002),「多廠區跨廠產能規劃之探討」,碩士論文,元智大學。

陳建宇 (2006),「以基因演算法結合層級分析法求解多廠區訂單分配問題」,碩士論文,

國立政治大學。

黃俊嘉 (2005),「多廠整合型生產指派與排程系統之最佳化」,碩士論文,東海大學。

劉謹銘 (2009),「以基因演算法求解雙流線型工廠排程」,碩士論文,國立交通大學。