臺灣博碩士論文加值系統

環境快速變化的衝擊使得傳統的產能規劃在無法有效提供企業決策支援。例如物料需求規劃(Material Requirements Planning；MRP)，並沒有將企業的產能限制納入考慮，雖會經由產能需求規劃(Capacity Requirements Planning；CRP)評估其可行性，但產能需求規劃僅能指出產能不足的現象。並且目前研究當中除了考慮有限資源，尚缺考慮較完整之現場生產特性。
因此本研究針對有限資源下，參考較完整之現場作業特性，發展出推移式有限負載產能規劃(pull-push finite capacity production planning)模式。並利用流程式生產環境，測試本論文所提出之規劃模式可求解出較佳排程解。並利用四種情境以驗證本研究可有效解決作業特性問題。

Due to the rapid changes in the production environment, hence the traditional capacity planning can not provide decisions to enterprise effectively. For example, Material Requirements Planning (MRP) does not consider the capacity constraints, although the loading status of manufacturing system can be obtained by CRP, CRP can not provide load shifting/unloading suggestion to the planner in order to prevent overloading. Previous studies considered their production planning approach with finite capacity constraints, but production feature, i.e. depended setup time, were not available to consider.
In this study, a new production planning approach, called pull-push finite capacity production planning, will be developed with considering the finite capacity constraint and more production features. A shop flow manufacture environment is also be built to show the performance of pull-push finite capacity production planning can obtain the better solution than previous studies, and use four scenarios to verify the method that this research proposed.

摘要 I
ABSTRACT II
致謝 III
目錄 IV
圖目錄 VI
表目錄 VII
第一章 緒論 1
1.1 研究背景與動機 1
1.2 研究目的與範圍 2
1.3 研究方法與步驟 2
1.4 論文架構 3
第二章 文獻討論 5
2.1 排程問題描述 5
2.1.1 排程問題分類 5
2.2 排程之相關研究 6
2.2.1國內外產能規劃研究 10
2.3 商用先進規劃與排程軟體於規劃與排程上之探討 12
2.3.1 i2 Factory Planner 有限產能規劃 12
2.1.2. Adexa的MCP 14
2.4 結論 15
第三章 推移式有限負載產能規劃模式說明 16
3.1模式特性與分析 16
3.2規劃概念 17
3.3案例說明 23
第四章 推移式有限負載產能規劃模式建構 31
4.1相關變數說明 31
4.2需求確認模組 32
4.3向上游排程規劃模組 33
4.3.1 時間設定 33
4.3.2 主規劃方案排程 34
4.3.3 替代方案規劃排程 38
4.4向下游排程規劃模組 40
4.4.1 搜尋不合理製令 41
4.5組裝協調排程規劃模組 43
4.5.1 選取規劃製令 43
第五章 實驗結果與分析 46
5.1 實驗情境設計 46
5.2 實驗結果與分析 52
5.3 實驗小結 58
第六章 結論與未來建議 60
6.1. 結論 60
6.2. 未來發展方向 60
參考文獻 61
附錄A 63
附錄B 65
附錄C 66

[1].Armentano, Vinicius A., and Debora P. Ronconi, 1999, “Tabu search total tardiness minimization in flowshop scheduling problems,”Computers & Operations Research, 26, 219-235.
[2].Armentano, Vinicius A., and Scrich Cintia Rigao, 2000, “Tabu search for minimizing total tardiness in a job shop,” International Journal of Production Economics, 63, 131-140.
[3].Atabakhsh, H., 1991 “A survey of Constraint based scheduling systems using an artificial intelligence approach”, Artificial Intelligence in Engineering, 6, No. 2.
[4].Brah, S. A., and Hunsucker, J. L., 1991, “Branch and bound algorithm for the flow shop with multiple processors,” European Journal Operational Research, 51, 88-99.
[5].Chen, Chuen-Lung, Vempati, Venkateswara S., and Nasser, Aljaber, 1995, “An application of genetic algorithms for flow shop problems,”European Journal of operational Research, 80, 389-396.
[6].Cheng, R., M. Gen, and Y. Tsujimura, 1999, “A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: hybrid genetic search strategies,” Computers and Industrial engineering, 36, 343-364.
[7].D. R. Sule, 1997, “Industrial Scheduling”, PWS publishing Company.
[8].Garey MR, Johnson DS, Sethi R, 1976, “The complexity of flow-hop and job-shop scheduling”, Math Oper Res, 1, 117-129.
[9].Graves, S. C., 1981, “ A Review of Production Scheduling”, Operation Research, 29, 646-670.
[10].Hung, Y. F., and Leachman, R. C., 1996, “A production planning methodology for semiconductor manufacturing based on iterative simulation and linear programming calculations,” IEEE Transactions on Semiconductor Manufacturing, 9, No. 2, 257-269.
[11].i2,1999, RHYTHM Factory Planner User Manual.
[12].Joel D. Wisner, 1995,"A Review of the Order Release Policy Research", International journal of operations & production management, 15, No. 6, 25-40.
[13].Jospeh Y-T. Leung, 2004, Handbook of Scheduling :Algorithms, Models,and Performance Analysis, Boca Raton :Chapman & Hall/CRC.
[14].Kimt, YD., 1993, “A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshop,” Computers and Operations Research, 20, 391-401.
[15].Kimt, Yeong-Dae, 1995 “ A backward approach in list scheduling algorithms for multi-machine tardiness problems,”Computers and Operations Research, 22, No.3, 307-319.
[16].Leachman, R. C., and Carmon, T. F., 1992, “On capacity modeling for production planning with alternative machines,” IIE Transactions, 24, No. 4, 62-72.
[17].Lomnicki, Z. A., 1965, “A branch and bound algorithm for the exact solution of the three-machine scheduling problem,” Operation Research Quarterly, 16/1, 89-100.
[18].Matsurra , H., Tsubone, H., and Kataoka, K., “Comparision between simple infinite loading considering a workload satus under uncertainty in job operation times,” International Journal of Production.
[19].Mellor, P., 1966, “A review of job shop scheduling “, Operational Research Quarterly, 17, No.2, 161-170.
[20].Michael Pinedo, Xiuli Chao, 1999, Operations Scheduling with Applications in Manufacturing and Services, rwin/McGraw-Hill, Boston.
[21].Moon, C., J. Kim, and S. Hur, 2002, “Integrated process planning and scheduling with minimizing total tardiness in multi plants supply chain,” computers & Industrial Engineering.
[22].Stevenson, W. T., 1988, Production and Operation Management, 2nd. Edition, Irwin.
[23].V.Suresh, Dipak Chaudhuri, 1993, “Dynamic scheduling-A survey of research”, International Journal of Production Economics, 32, 53-63.
[24].V.Suresh, Dipak Chaudhuri, 1993, “Dynamic scheduling-A survey of research”, International Journal of Production Economics, 32, 53-63.
[25].Wein L. M., 1988, “Scheduling Semiconductor Wafer FABRICATION”, IEEE Trans. Semicond. Manufact, 1, NO.3, 155-130.
[26].Wortmann, J. C., Euwe, M. J., Taal, M., and Wiers, V. C. S., 1996, “A review of capacity planning techniques within standard software package,” Production Planning and Control, 7, No. 2, 117-128.
[27].王立志，2006，系統化運籌管理與供應鏈管理-企業營運新典範，滄海書局。
[28].林我聰，現場排程專家系統—應用個體導向技術建立之研究，第1版，資訊與電腦。
[29].周世杰，林我聰，王立志，1993，"物件導向式現場排程專家系統之建立"，中國工業工程學會八十二年度論文集，479-484。
[30].莊世宗, 1997, FAB之即時模擬台成語控制，雲林科技大學，碩士論文。
[31].陳建良，1995年12月號，排程概述，機械工業雜誌，l22-137。