An Approach of Flowshop Scheduling with Identical Parallel Machine Consideration 蔡碧芳、駱景堯
E-mail: [email protected]
ABSTRACT
In this research, an identical parallel machine flowshop scheduling problem in which the dependent setup time is taken into account is considered with minimization of total flowtime. The addressed flowshop scheduling problem is more complex than the traditional flowshop scheduling problems since in the addressed flowshop scheduling problem both machine assignment and job sequencing problems are considered simultaneously. To solve the addressed problem two different solving models are developed. First, a 0-1 integer programming model is constructed; however, the mathematical model is too time consuming to solve the medium or large size problem, thus, a hybrid heuristic which is combined with simulated annealing and tabu search is proposed to get an near optimal schedule in a reasonable computation time. During the research, the parameters used in the heuristics that affect the solution quality and efficiency are analyzed and designed; then for the constructed heuristic, a good parameter setting is suggested. The experimental results are reported, and provided for the references for the further research
Keywords : Identical parallel machine ; Flowshop ; Dependent setup time ; Total flowtime ; Simulated annealing Table of Contents
封面內頁 簽名頁 授權書………..……….iii 中文摘要...………
………iv 英文摘要………....v 誌謝………
………...vi 目錄……….….vii 圖目錄...…………
……….…x 表目錄………...xi 第一章 緒 論 1 1.1 研究動機 1 1.2 研究目的 2 1.3 研究範圍 2 1.4 研究方法 3 1.5 研究架構 5 第二章 文獻探討 6 2.1 考量整備時間之 排程問題 6 2.2 平行機台於排程問題之文獻回顧 8 2.2.1 數學規劃法之應用於平行機排程方面 8 2.2.2 啟發式演算法之應用於 平行機排程方面 9 2.3 模擬退火法( SA ) 11 第三章 數學規劃求解模式之建構 14 3.1 符號定義 14 3.2 考量獨立整備時間之排 程模式 16 3.2.1 線性化 18 3.3 考量相依整備時間之排程模式 22 第四章 啟發式演算法之建構 29 4.1 SATS演算法之建立 29 4.2 起始解 32 4.2.1 RE-NEH(FIFO)法之步驟 32 4.2.2 RE-NEH(FIFO)法之簡例說明 33 4.3 產生鄰近解 36 4.3.1 移步策略 36 4.3.2 移步之後階段上之工作選取 39 4.4 候選名單之建立與移步之選取 39 4.5 禁忌名單 41 第五章 實驗結果分析 42 5.1 實驗 數據與參數設定 42 5.2 起始解之選用結果分析 43 5.3 SATS演算法之參數分析 46 5.4 數學模式結果與啟發式演算法結果之 比較 52 5.5 SATS與SA、TS之比較分析 54 5.6 不同之初始解加SATS演算法之比較分析 56 第六章 結論與建議 58 6.1 研究總 結 58 6.2 未來研究建議 59 參考文獻 60 附錄一 64 附錄二 72 附錄三 82
REFERENCES
[1] 駱芳梧，「考量整備及拆卸時間之開放型工廠排程問題研究」，大葉大學工業工程學系碩士學位論文，民國91年。
[2] 田國興，「有設置時間之流程型工廠多階段平行機台總排程時 間最小問題」，中原大學工業工程學系碩士學位論文，民國88年。
[3] 莊舜智，「多目標決策之應用-整備時間考量下之零工式排程問 題探討」，大葉大學碩士學位論文，民國87年。
[4] Allahverdi, A. , Gupta, J. N. D. and Aldowaisan, T. ,“A review of scheduling research involving setup considerations,”Omega, The International Journal of Management Science, 27, 219-239(1999).
[5] Aldowaisan, T. , Allahverdi, A. ,“Total flowtime in no-wait flowshops with separated setup times,”Computers & Operations Research, Vol 25, 757-765(1998).
[6] Allahverdi, A. ,“Minimizing mean flowtime in a two-machine flowshop with sequence-independent setup times,”Computers & Operations Research, 24, 111-127(2000).
[7] Aldowaisan, T. and Allahverdi, A. ,“No-Wait and separate setup three-machine flowshop with total completion time criterion,”International Transactions in Operational Research, 7, 245-264 (2000).
[8] Armentano, V. A. and Yamashita, D. S. ,“Tabu search for scheduling on identical parallel machines to minimize mean tardiness,” Journal Inteligentl Manufacturing, 11, 453-460(2000).
[9] Balakrishnan, N. , Kanet, J. J. and Sridharan, S. V. ,“Early/tardy scheduling with sequence dependent setups on uniform parallel machines,
”Computers & Operations Research, 26, 127-141(1999).
[10] Brah, S. A. and Loo, L. L.,“Heuristics for scheduling in a flow shop with multiple processors,”European Journal of Operational Research, 113, 113-122(1999).
[11] Brucker, P. , Hurink, J. and Werner, F. ,“Improving local search heuristics for some scheduling problems. Part II,”Discrete Applied Mathematics, 72, 47-69(1997).
[12] Dessouky, M. M. , Dessouky, M. I. and Verma, S. K.,“Flowshop scheduling with identical jobs and uniform parallel machines,”European Journal of Operational Research, 109, 620-631(1998).
[13] Ho, J. C. and Chang, Y. L.,“Minimizing the number of tardy jobs for m parallel machines,”European Journal of Operational Research, 84, 343-355(1995).
[14] Hurink, J. and Knust, S. , “List scheduling in a parallel machine environment with precedence constraints and setup times,”Operations Research Letters, 29, 231-239(2001).
[15] Jozefowska, J. , Waligora, G. and Weglarz, J. ,“Tabu list management methods for a discrete-continuous scheduling problem,”European Journal of Operational Research, 137, 288-302(2002).
[16] Kamburowski, J. ,“On three-machine flow shops with random job processing times,”European Journal of Operational Research, 125, 440-449(2000).
[17] Koulamas C. ,“Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem,” Naval Research Logistics, 44, 105-125(1997).
[18] Norman, B. A. ,“Scheduling flowshops with finite buffers and sequence-dependent setup time,”Computers & Industrial Engineering, 36, 163-177(1999).
[19] Parthasarathy, S. and Rajendran, C. ,“An experimental evaluation of heuristics for scheduling in a real-life floeshop with sequence-dependent setup times of jobs,”International Journal of Production Economics, 49, 255-263(1997).
[20] Rios-Mercado R. Z. and Bard, J. F. ,“Heuristics for the flow line problem with setup costs,”European Journal of Operational Research, 110,) 76-98(1998).
[21] Schaller, J. E. , Gupta, J.N.D. and Vakharia, A. J. ,“Scheduling a flowline manufacturing cell with sequence dependent family setup times,
”European Journal of Operational Research,125, 324-339(2000).
[22] Stafford, J. E. F. and Tseng F. T. ,“Two models for a family of flowshop sequencing problems,”European Journal of Operational Research, 142, 282-293(2002).
[23] Suresh V. , Chaudhuri D. ,“Bicriteria scheduling problem for unrelated prarllel machines,” Comput Ind Eng, 30, 77-82(1996).
[24] Tamimi S.A. and Rajan V. N. ,“Reduction of total weighted tardiness on uniform machines with sequence dependent setups,”Industrial Engineering Research-Conference, 181-185(1997).
[25] T’kindt, V. , Monmarche, N. , Tercinet, F. and Laugt, D. ,“An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem,”European Journal of Operational Research, 142, 250-257(2002).
[26] Yang, D. L. and Chern, M. S. ,“A two-machine flowshop sequencing problem with limited waiting time constraints,”Computers industrial Engineering, Vol. 28, No. 163-70(1995).
[27] Yoshida, T., and Hitomi, K., “Optimal two-stage production scheduling with setup times separated,” AIIE Transactions, 11, 261-263(1979).
