啟發式演算法用於流程型工廠之排程研究─以觸控面板之觸控感應器生產為例

Heuristic Algorithm Method for Flowshop Scheduling Problems -A Case of Touch Sensor Product Line

簡志昌(Chih-Chang Chien)

指導教授 ： 蘇玲慧

中原大學/工學院/工業工程研究所/碩士(2012年)

https://doi.org/10.6840/cycu201200519

摘要

本研究主要在探討Touch Sensor之生產流程，在不同製程條件下之總完工時間最小化、總生產流程時間最小化、總延遲時間最小化、關鍵權重總完工時間最小化等問題。本研究應用簡單派工模式將工作重新排列組合，在考量產品交期、流程時間、延遲時間、顧客權重之生產狀況下，發展出相較於傳統派工法則更具生產效益之啟發式排程法則。最後證實所提出之起發式演算法相較於傳統FCFS與SPT之派工法則更具實質之生產效益。

關鍵字

啟發性排程演算法 ； 派工法則 ； 觸控感應器

並列摘要

This study aimed to explore the Touch Sensor of production processes to minimize the total completion time, the sum of flow time, the tardiness, and the weight total completion time. Four heuristics are developed to achieve each objective. Computational experiments show that the heuristic algorithm methods are more efficient, compared to traditional dispatching rules such as FCFS and SPT dispatching rule.

並列關鍵字

Dispatching Rule ； Heuristic Algorithm ； Touch Sensor

參考文獻

【1】 Barrett R. and Kadipasaoglu, S. N. Evaluation of Dispatching Rules in a Dynamic Flow Shop. Production and Inventory Management Journal, 31, 54-58.(1999)

【2】 Blackstone, J.H., Phillips, D.T. and Hogg, G.L., A state-of-the-art survey of dispatching rules for manufacturing job shop operations. International Journal of Production Research, Vol. 20(1), 27-45.(1982)

【3】 Campbell, H.G., Dudek, R.A. and Smith, M.L. A heuristic algorithm for the n-job m-machine sequencing problem. Management Science, 16, 630-637. (1970)

【4】 Chang, S. Suang, Young, H. K., and Sang, H. K., A problem reduction and decomposition approach for scheduling for flowshop of batch processing machines, European Journal of Operational Research, 121, 179-192. (2000)

【5】 Johnson, S. M., Optimal two and three stage production schedules with set-up time included, Naval Research Quarterly, 61-68. (1954)