OPEN SHOP SCHEDULING PROBLEM WITH SETUP, PROCESSING AND REMOVAL TIMES SEPARATED
駱芳梧、駱景堯,蕭育如
E-mail: [email protected]
ABSTRACT
AN OPEN SHOP SCHEDULE HAS NO RESTRICTIONS ON THE PROCESSING ORDER OF THE JOBS. BECAUSE OPEN SHOP SCHEDULING PROBLEMS HAVE BEEN PROVED AS NP-HARD PROBLEMS TO SIMPLIFY THE STUDI -ES, THE MAJORITY OF SCHEDULING RESEARCH ASSUMES SETUP AND REMOVAL AS NEGLIGIBLE OR PART OF THE PROCESSING TIME. IN THIS RESEARCH, WE CONSTRUCT A MATHEMATICAL MODEL FOR OPEN SHOP SCHEDULING PROBLEM WITH SETUP, PROCESSING, AND REMOVAL TIMES SEPARATED. THE
OBJECTIVE IS MINIMIZING TOTAL TARDINESS. HOWEVER, THE MATHEMATICAL MODEL CANNOT GET AN OPTIMAL SOLUTION FOR THE PROBLEM WITH LARGE SIZE. THUS, WE PROPOSE ONE HEURISTIC
ALGORITHM THAT BASED ON THE SIMULATED ANNEALING ALGORITHM. THE EXAMPLE ILLUSTRATIONS SHOWS THAT THE HEURISTIC PERF -ORMS WELL BOTH IN SOLUTION QUALITY AND EFFICIENCY.
Keywords : OPEN SHOP,SEQUENCE-INDEPENDENT SETUP TIME,SEQUENCE-DEPENDENT REMOVAL TIME,SIMULATED ANNEAL -ING ALGORITHM
Table of Contents
封面內頁 簽名頁 授權書 iii 中文摘要 v 英文摘要 vi 誌謝 vii 目錄 viii 圖目錄 x 表目錄 xi 第一章 緒論 1 1.1 研究動機與背景 1 1.2 研究目的 2 1.3 研究問題與假設 3 1.4 研究方法與架構 4 第二章 文獻探討 7 2.1 開放型工廠排程問題 7 2.2 考量整備時間
、拆卸時間之排程問題 9 2.3 小結 12 2.4 模擬退火演算法 12 第三章 模式的建立 16 3.1 符號定義 16 3.2 延遲最小之開放型工 廠問題模式 18 3.3 獨立整備時間與相依拆卸時間延遲最小開放型工廠排程問題模式 19 3.3 模式範例 22 第四章 開放型工廠 排程問題求解方法 25 4.1 模擬退火演算法 25 4.2 符號定義 27 4.3 起始解 27 4.4 移步 41 4.5 演算法停止準則 43 第五章 演算 結果與分析 44 5.1 實驗參數設定 44 5.2 啟發式演算法結果分析 46 5.3 數學模式結果與啟發式演算法結果之比較 56 第六章 結論與建議 58 6.1 結論 58 6.2 建議 59 參考文獻 61 附錄一 數學模式求解結果 66 附錄二 各規模問題之ANOVA分析表 68 圖 目錄 圖1.1 研究架構圖 6 圖2.1 工作之整備作業為可分割與不可分割示意圖 10 圖2.2 模擬退火演算法流程圖 15 圖3.1 3工件3 機器範例甘特圖 24 圖4.1 啟發式演算法架構圖 26 圖4.2 起始解選取步驟流程圖 29 圖4.3 6工件4機器範例甘特圖 41 圖4.4 隨 機移步示意圖 42 圖4.5 最大延遲作業移步示意圖 42 圖5.1 到期日組合示意圖 45 圖5.2 5工件5機器馬可夫鏈長度與求解品質 關係圖 48 圖5.3 10工件5機器馬可夫鏈長度與求解品質關係圖 49 圖5.4 10工件10機器馬可夫鏈長度與求解品質關係圖 50 圖5.5 10工件10機器降溫率與求解品質關係圖 51 圖5.6 30工件5機器起始溫度與求解品質關係圖 51 圖5.7 30工件10機器起始 溫度與求解品質關係圖 52 圖5.8 30工件20機器馬可夫鏈長度與求解品質關係圖 53 圖5.9 30工件20機器降溫率與求解品質關 係圖 53 圖5.10 50工件5機器起始溫度與求解品質關係圖 54 圖5.11 50工件10機器起始溫度與求解品質關係圖 55 圖5.12 50工 件20機器起始溫度與求解品質關係圖 56 表目錄 表3.1 與 之關係表 21 表3.2 與 之關係表 22 表3.3 3工件3機器資料表 23 表3.4 工件之機器處理順序表 24 表3.5 機器之工件處理順序表 24 表4.1 6工件4機器資料表 30 表4.2 6工件4機器起始解選取 表(迭次一) 33 表4.3 6工件4機器起始解選取表(迭次二) 34 表4.4 6工件4機器起始解選取表(迭次三) 35 表4.5 6工件4機器起始 解選取表(迭次四) 35 表4.6 6工件4機器起始解選取表(迭次五) 36 表4.7 6工件4機器起始解選取表(迭次六) 37 表4.8 6工件4機 器起始解選取表(迭次七) 37 表4.9 6工件4機器起始解選取表(迭次八) 38 表4.10 6工件4機器起始解選取表(迭次九) 38 表4.11 6 工件4機器起始解選取表(迭次十) 39 表4.12 工件之機器處理順序表 40 表4.13 機器之工件處理順序表 40 表5.1 3工件2機器求 解品質之ANOVA分析表 46 表5.2 3工件2機器求解時間之ANOVA分析表 47 表5.3 最佳解與啟發式求解比較表 57 表6.1 各 種規模問題之建議參數設定彙整表 59
REFERENCES
[ 1 ] 施大維，"開放工廠加權完工時間最小化問題之研究"，朝陽大學碩士學位論文，民國89年。
[ 2 ] 呂紹煌，"以塔布搜尋法求解開放工廠排程問題"，朝陽大學碩士學位論文，民國88年。
[ 3 ] 林安祥，"開放工廠加權延遲最小化排程問題之研究"，朝陽大學碩士學位論文，民國89年。
[ 4 ] 楊文華，"考慮設置時間下之相關排程問題研究"國立台灣工業技術學院，管理技術研究所博士 論文，民國85年。
[ 5 ] 莊舜智，"多目標決策之應用─整備時間考量下之零工式排程問題探討"，大葉大學碩士學位論 文，民國87年。
[ 6 ] 柯惠雯，"結合模擬退火法與禁忌搜尋法在流程式生產排程之應用"，大葉大學碩士學位論文， 民國90年。
[ 7 ] GONZALEZ, T., AND SAHNI, S.,"OPEN SHOP SCHEDULING TO MINIMIZE FINISH TIME,"JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY, 23(4), 665-679 (1976).
[ 8 ] DU, J.Z., AND LEUNG, Y.T.,"MINIMIZING MEAN FLOW TIME IN TWO-MACHINE OPEN SHOPS AND FLOW SHOPS,"JOURNAL OF ALGORITHMS, 14, 24-44 (1993).
[ 9 ] PINEDO, M., SCHEDULING: THEORY, ALGORITHM AND SYSTEMS, PRENTICE-HALL, ENGLEWOOD CL -IFFS, NJ (1995).
[ 10 ] ACHUGBUE, J.O., AND CHIN, F.Y.,"SCHEDULING THE OPEN SHOP TO MINIMIZE MEAN FLOW TIM -E,"SIAMJ.
COMPUT., 11, 709-720 (1982).
[ 11 ] KYPARISIS, G.J., AND KOULAMAS, C.,"OPEN SHOP SCHEDULING WITH MAKESPAN AND TOTAL CO -MPLETION TIME CRITERIA"COMPUTERS & OPERATIONS RESEARCH, 27(1), 15-27 (2000).
[ 12 ] LIAW, C.,"AN ITERATIVE IMPROVEMENT APPROACH FOR THE NONPREEMPTIVE OPEN SHOP SCHEDUL -ING PROBLEM,"EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 111(3), 509-517 (1999).
[ 13 ] LIAW, C.,"A TABU SEARCH ALGORITHM FOR THE OPEN SHOP SCHEDULING PROBLEM,"COMPUTERS &
OPERATIONS RESEARCH, 262(2), 109-126 (1999).
[ 14 ] LIAW, C.,"A HYBRID GENETIC ALGORITHM FOR THE OPEN SHOP SCHEDULING PROBLEM,"EUROPEA -N JOURNAL OF OPERATIONAL RESEARCH, 124(1), 28-42 (2000).
[ 15 ] BRUCKER, P., JOHANN, H., BERND, J., AND BIRGIT, W.,"A BRANCH & BOUND ALGORITHM FOR THE OPEN SHOP PROBLEM,"DISCRETE APPLIED MATHEMATICS, 76, 43-59 (1997).
[ 16 ] LIAWLER, E.L., LENSTRA, J.K., AND RINNOOY KAN, A.H.G.,"MINIMIZING MAXIMUM LATENESS IN A TWO-MACHINE OPEN SHOP,"MATHEMATICS OF OPERATIONS RESEARCH, 6(1), 153-158 (198 1).
[ 17 ] LIU, C.Y., AND BULFIN, R.L.,"SCHEDULING OPEN SHOPS WITH UNIT EXECUTION TIMES TO MI -NIMIZE FUNCTIONS OF DUE DATES,"OPERATION REASEARCH, 36, 553-559 (1988).
[ 18 ] SULE, D.R., INDUSTRIAL SCHEDULING, PWS. PUBLISHING COMPANY, 187-218 (1996).
[ 19 ] LIN, H.F.,"A HEURISTIC SOLUTION TO THE TOTAL TARDY COST OF AN M MACHINE NON-PREEMP -TIVE OPEN SHOP SCHEDULING,"SUN YAT SEN MANAGEMENT REVIEW, 3(4), 122-143 (1995).
[ 20 ] LIN, H.F., LIU, C.Y., AND LIU, P.Y.,"A HEURISTICS APPROACH TO THE TOTAL TARDINESS IN NONPREEMPTIVE OPEN SHOP SCHEDULING,"INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEE -RING, 2(1), 25-33 (1995).
[ 21 ] LIN, H.F.,"A HEURISTICS SOLUTION TO THE TOTAL TARDINESS AND EARLINESS PENALTIES OF AN M-MACHINE NONPREEMPTIVE SCHEDULING,"JOURNAL OF THE CHINESE INSTITUE OF INDUSTR -IAL ENGINEERING, 15(2), 159-167 (1995).
[ 22 ] GILMORE, P.C., AND GOMORY, R.E.,"SEQUENCING A ONE-STATE VARIABLE MACHINE; A SOLVAB -LE CASE OF THE TRAVELING SALESMAN PROBLEM,"OPERATION RESEARCH, 12, 655-679 (1964) [ 23 ] LEE, Y.H., BHASKARAN, K., AND PINEDO, M.,"A HEURISTIC TO MINIMIZE THE TOTAL WEIGHT -ED TARDINESS WITH SEQUENCE DEPENDENT SETUPS,"IIE TRANSACTIONS, 29, 45-52 (1997).
[ 24 ] YOSHIDA, T., AND HITOMI, K.,"OPTIMAL TWO-STAGE PRODUCTION SCHEDULING WITH SETUP TIM -ES SEPARATED,"AIIE TRANSACTIONS, 11, 261-263 (1979).
[ 25 ] SULE, D.R.,"SEQUENCING N JOBS ON TWO MACHINES WITH SETUP, PROCESSING AND REMOVAL T -IMES SEPARATED,"NAVAL RESEARCH LOGISTICS QUARTERLY, 29, 517-519 (1982).
[ 26 ] SULE, D.R., AND HUANG, K.Y.,"SEQUENCY ON TWO AND THREE MACHINES WITH SETUP,PROCESS -ING AND REMOVAL TIMES SEPARATED," INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH,21 ,723-732 (1983).
[ 27 ] PROUST, C., GUPTA, J.N.D., AND DESCHAMPS, V.,"FLOWSHOP SCHEDULING WITH SET-UP,PROC -ESSING AND REMOVAL TIMES SEPARATED," INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 29, 479-493 (1991).
[ 28 ] KIM, S.C.,AND BOBROWSKI, P.M.,"IMPACT OF SEQUENCE-DEPENDENT SETUP TIMES ON JOB SHO -P SCHEDULING PERFORMANCE," INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 32, 1503 -1520 (1994).
[ 29 ] GUPTA, S.K.,"N JOBS AND M MACHINES JOB-SHOP PROBLEMS WITH SEQUENCE-DEPENDENT SET- UP TIMES,"INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 20(5), 643-656 (1982).
[ 30 ] STRUSEVICH, V.A.,"TWO MACHINE OPEN SHOP SCHEDULING PROBLEM WITH SETUP, PROCESSING AND REMOVAL TIMES SEPARATED,"COMPUTATIONAL OPERATION RESEARCH, 20, 597-611 (1993).
[ 31 ] ALLAHVERDI, A., GUPTA, J.N.D., AND ALDOWAISAN, T.,"A REVIEW OF SCHEDULING RESEARCH INVOLVING SETUP CONSIDERATIONS"OMEGA,THE INTERNATIONAL JOURNAL OF MANAGEMENT SCIEN -CE, 27, 219-239 (1999).
[ 32 ] HISO, I., SHINTA, M., AND HIDEO, T.,"MODIFIED SIMULATED ANNEALING ALGORITHMS FOR T -HE FLOW SHOP SEQUENCING PROBLEM,"EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 81, 388 -398 (1995).
[ 33 ] ARMENTANO, V.A., RONCONI, D.P.,"TABU SEARCH FOR TOTAL TARDINESS MINIMIZATION IN FL -OWSHOP SCHEDULING PROBLEMS,"COMPUTERS & OPERATIONS RESEARCH, 26, 219-235 (1999).
