(3.238.130.97) 您好!臺灣時間:2021/05/15 13:08
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果

詳目顯示:::

我願授權國圖
: 
twitterline
研究生:張毓仁
研究生(外文):Yu-Jeng Chang
論文名稱:多階段不等效平行機之排程研究
論文名稱(外文):The Study on Multi-stage Non-Identical Parallel Machine Scheduling Problem
指導教授:蘇玲慧蘇玲慧引用關係
指導教授(外文):Ling-Huey Su
學位類別:碩士
校院名稱:中原大學
系所名稱:工業工程研究所
學門:工程學門
學類:工業工程學類
論文種類:學術論文
論文出版年:2001
畢業學年度:89
語文別:中文
論文頁數:34
中文關鍵詞:權重成本多階段排程不等效平行機
外文關鍵詞:costweightschedulingmulti-stagenon-identical parallel machine
相關次數:
  • 被引用被引用:4
  • 點閱點閱:75
  • 評分評分:
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
本論文主要研究多階段不等效平行機排程問題,針對所有工作在某些製程可選擇自製或外包機器加工的情況,在有交期時間的限制下,所產生的延遲懲罰成本與外包成本,將所此兩種成本總合視為總成本。而研究目標乃是最小化總成本。
首先,研究在某些製程方面,工作可選擇在自製或外包機器上加工,而在考慮各工作的延遲懲罰成本與具有不同外包情形下的成本下,如何對各工作加以排序,最後以在所有工作完成時的總成本最小化為績效指標。
由於本論文研究之問題屬於NP-Hard,基於求解效率,將提出啟發式演算法並建立數學規劃模式,以作為評估求解品質成效的基準。由實驗結果分析得知,第四個啟發式演算法能夠有效的求取排程順序解。
This paper addresses the multi-stage non-identical parallel machines scheduling problem. In some stages, there are two kinds of machines. One is out-sourcing and the other is self-manufactured.
Jobs are processed by out-sourcing or self-manufactured in some stages. The performance measure is the minimization of total cost, including the out-sourcing cost and the weighted tardiness cost.
This problem is known to be NP-hard, four heuristic algorithms are provided and an integer programming model is presented for benchmarking. Experimental results show that the proposed fourth heuristic algorithm is effective and efficient.
中文摘要I
英文摘要II
誌謝III
目錄IV
表目錄V
圖目錄VI
符號說明VII
第一章 緒論1
1-1 研究動機1
1-2 研究目的2
1-3 研究範圍2
1-4 研究方法與架構3
第二章 文獻探討5
2-1多階段不等效平行機排程概述5
2-2 排程問題的相關回顧6
第三章 研究方法9
3-1問題定義9
3-2數學規劃模式10
3-3啟發式演算法12
3-4範例說明19
第四章 結果分析24
4-1模式作業環境與資料設定24
4-2數學規劃模式之驗證分析24
4-3實驗設計25
第五章 結論與未來展望29
5.1結論29
5.2未來展望29
參考文獻31


表目錄
表3.1範例一中所需之工作之基本資料19
表4.1啟發式演算法第一階段實驗結果彙整表25
表4.2 TWO-WAY ANOVA分析表26
表4.3 DUNCAN TEST彙總表27




圖目錄
圖1.1作業關系圖例1
圖1.2研究架構流程示意圖4
圖3.1工廠加工流程範例示意圖10
圖3.2啟發式演算法一之流程示意圖15
圖3.3啟發式演算法二之流程示意圖16
圖3.4啟發式演算法三之流程示意圖17
圖3.5啟發式演算法四之流程示意圖18
圖4.1啟發式演算法與不同工作數之交互作用關係圖26
1.Adamopoulos,G.I.,and C.P.Pappis,(1996)Scheduling with different, job- dependent earliness and tardiness penalties using the SLK method, European Journal of Operational Research,88,336-344.2.Avraham,S.,(1997)Project segementation-a tool for project management,International Journal of Project Management, 15(1), 15-19.3.Azizoglu,M., S.Kondakci and Ő.Kirca,(1991)Bicriteria scheduling problem involving total tardiness and total earliness penalties, International Journal of Production Economics,23,17-24.4.Bertraand,J.W.M.,(1983)The effect of workload dependent due-dates on job shop performance,Management Science,29(7),799-816.5.Chang,F.C.R.,(1996)A study of due-date assignment rules with constrained tightness in a dynamic job shop, Computer industrial Engineering 31,205-208.6.Dilip,C.,(1995)A fixed interval due-date scheduling problem with earliness and due date costs, European Journal of Operational Research, 84, 385 - 401.7.Ebru,D., S. Mehta, and R. Uzsoy,(1998)Benchmarks for shop scheduling problems, European Journal of Operational Research, 109,137-141.8.Edward ,W.D., and J. H. Patterson,(1976)A comparison of Heuristic and optimum solutions in resource-contrained project scheduling, Management Science,21(8).9.Fouad, R. , A.Artiba ,and S. E. Elmaghraby ,(1998)A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan, European Journal of Operational Research,109,321-329.10.Fulkerson,D.R.,(1961)A Network flow computation for project cost curves,Management Science,7,167-178.11.Gee,E.S.,and C. H. SMITH,(1993)Selecting allowance policies for improved job shop performance,International Journal of Production Research,31(8),1839-1852.12.Guient,A.G.P., and M. M. Solomon,(1996)Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time, International journal of production research,34(9),1643-1654.13.Gűndűz,U., and L. Őzdamar,(1989)Heuristic Performance and Network/ Resource Characteristics in Resource-constrained Project Scheduling, Journal of Operational Research Soc.,40(12),1145-1152.14.Graham, K. R.,(2000)Critical chain: the theory of constraints applied to project management, International Journal of Management,18, 173-177.15.Graves,S. C.,(1981)A review of production scheduling,Operations Research, 29(4),646-675.16.Huang,H. J., and G. Xu,(1998)Aggregate scheduling and network solvling of multi-stage and multi-item manufacturing systems,European Journal of Operational Research,105,52-65.17.Kamburowski,J.,(1995)On the Minimum Cost Project Schedule,Omega. Int. J. Mgmt Sci,23(4),463-465.18.Kenneth,R.,and Baker,(1984)Sequencing rules and due-date assignment in a job shop,Management Science,30(9),1093-1104.19.Linet,Ő., and G. Ulusoy,(1996)An iterative local constraint based analysis for solving the resource constrained project scheduling problem,Journal of Operations Management,14,193-208.20.Linet,Ő., and G. Ulusoy,(1994)A local constraint based analysis approach to project scheduling under general resource constraints, European Journal of Operational Research,79,287-298.21.Ruengsak,K., Y.Yanagawa, K. Ohashi, and S. Miyazaki,(1997)Scheduling in an automated flow shop to minimize cost:Backward-meta scheduling method,Interntional Journal of Production Ecnomics,49, 225-235.22.Shah,N.,(1996)Mathematical programming techniques for crude oil scheduling,Computer chemical Engineering,20,S1227-S1232.23.Suer,G.A.,and Z.Czajkiewicz,(1992),A heuristic procedure to minimize number of tardy jobs and total tardiness in single machine scheduling, Computer and Industrial Engineering,23(4),145-148.24.Taeho,S., and S.Erenguc,(1998)The resource constrained project scheduling problem with multiple crashable modes: A heuristic procedure,European Journal of Operational Research,107,250-259.25.Tandon,M., P. T. Cummings, and M. D. Levan,(1995)Scheduling of multiple production parallel unit with tardiness penalties using sumulated annealing,Computer chemical Engineering,19(10),1069-1076.26.Wu,Y., and C.Li,(1994)Minimal cost networks:the cut set parallel difference method,Omega,22,401-407.27.Xiang,S.,G.Tang,and T.C.E. Cheng,(2000)Solvable cases of permutation flowshop scheduling with dominating machines, International Journal of Production Economics,66,53-57.28.Yeong,D.K.,(1995)A backward approach in list scheduling algorithm formulti-machine tardiness problems,Computers Operational Research, 22(3),307-319.
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top
無相關期刊