臺灣博碩士論文加值系統

供應鏈的產品經由多階段加工作業，計算採購或生產批量的最低總成本即為多階動態經濟批量問題。文獻上對於求解大型產品結構的最佳經濟批量，早已證明是一個具NP-complete複雜度的問題，並且對於24計劃期需求量、50加工階段以上的批量問題，會因為計算過程太過於複雜而有主記憶體空間不足的困擾，因而採取近似解法。文中建立二進制演算法令電腦自動產生全部可行解以及求算可行解總成本，可以尋求單階與多階動態經濟批量問題的整體最佳解、繪製不同批量情形最佳解所構成的總成本變動情形；並且建立了遞迴模式減化演算過程，電腦可以自動尋求緊鄰前後加工階段的所有合理可行解存放於資料庫，由原先需要進行(2t-1)2× (m-1)次的搜尋演算，大幅減化至2t-1次。經由資料庫的建立，僅動用硬碟空間，減少電腦主記憶體需求。本文可以求解30計劃期需求量、不限加工階段的多階多期動態經濟批量問題，尋求各個加工階段的不同批量情形最佳解。最後以Visual Basic 6.0開發演算系統求解批量問題，經由電腦演算多組數據後，驗證出不論單階多期或多階多期動態經濟批量問題，在整體最佳解附近會出現一段扁平的總成本曲線，並且對於上述特性的存在，我們稱之為DLS zone與MLLS zone。文中的研究結果有助於制定批量決策者如：生管經理、採購經理等，在日後制定批量決策時，除了整體最佳解之外，有更廣泛的批量選擇。

The products are manufactured through multi-stages in supply chain, computing the minimum total costs of purchase or production is a multilevel dynamic lot-sizing problem. In the past literatures, the lot-sizing problem of large complex product structures has been proved to be an NP-complete problem. The literatures adopt heuristic approach to overcome the shortage of computer’s main memory when the lot-sizing problems are more than 50 operation levels and 24 planning periods. This paper develops a binary algorithm to generate all the feasible solutions and compute their total costs automatically by the computer. This algorithm can show the variations of total costs of different lot-sizing conditions and find the optimal solution in both single level and multilevel dynamic lot-sizing problem. In addition we develop a recursive model to simplify the computation. The computer can automatically generate all the feasible solutions between the adjacent operation levels and save that into a database.
Applying the recursive model, the search times of computer are obviously reduced from (2t-1)2× (m-1) times to 2t-1 times. Using the database established in the hard disk can decrease the demand of main memory. Therefore, this paper can solve the multilevel lot-sizing problem with unconstrained operation levels and 30 planning periods and find out the optimal solution of different lot-sizing conditions in each stage. Finally, we adopt the Visual Basic 6.0 to develop an operation system and solve the lot-sizing problems. After generating a large number of data by the computer, we prove that the total cost curve is relatively flat near the optimal solution in single level and multilevel lot-sizing problem. The characteristics are called DLS zone and MLLS zone in this paper.
The results in the thesis will be useful for the lot-sizing decision makers, such as, the production managers or the inventory managers. Besides considering the optimal solution, they will have more extensive lot-sizing choices in DLS zone and MLLS zone.

中文摘要 ....................................................... i
英文摘要 ....................................................... ii
誌謝 ........................................................... iv
目錄 ........................................................... v
表目錄 ......................................................... vii
圖目錄 ......................................................... viii
符號說明 ....................................................... ix
第一章 緒 論 ............................................................ 1
1.1 研究動機與目的 ....................................... 1
1.2 研究範圍與限制 ....................................... 3
1.3 研究架構與流程 ....................................... 3
第二章 文獻回顧 ............................................... 5
2.1 單階多期動態經濟批量模式簡介........................... 5
2.2 多階多期動態經濟批量模式簡介........................... 6
2.3 相關文獻探討......................................... 8
第三章 單階多期動態經濟批量總成本曲線特性探討..................... 11
3.1 單階多期動態經濟批量總成本曲線說明...................... 11
3.2 二進制演算法......................................... 12
3.3 單階多期動態經濟批量總成本曲線......................... 15
3.4 單階多期動態經濟批量總成曲線與EOQ總成本曲線之比較........ 17
3.4.1 EOQ模式預測單階多期動態經濟批量總成本曲線........ 17
3.4.2 範例說明..................................... 18
3.5 單階多期動態經濟批量總成本扁平區........................... 21
第四章 多階多期動態經濟批量總成本曲線特性探討..................... 23
4.1 多階多期動態經濟批量總成本曲線說明..................... 23
4.2 緊鄰前後加工階段可行解關聯性…......................... 24
4.3 遞迴模式............................................ 25
4.3.1 建立初始運算先行解集合…....................... 25
4.3.2 緊鄰前後加工階段可行解遞迴模式…................ 26
4.3.3 供應鏈系統之最佳經濟.批量演算過程規則性.......... 28
4.3.4 尋求多重加工階段之合理先行解比較項數探討.......... 29
4.3.5 範例說明…..................................... 31
4.4 多階多期動態經濟批量總成本扁平區......................... 33
第五章 結論與未來研究建議 ....................................... 34
5.1 結論 ................................................ 34
5.2 未來研究建議 ......................................... 35
參考文獻 ....................................................... 36
附 錄 ........................................................ 39
作者簡介 ....................................................... 48

1.Awi, F. and Michal, T., 1991, “A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in O(n log n) or O(n) time”, Management Science, Vol. 31, No. 8, pp. 909-925.
2.Blackburn, J. D. and Millen, R. A., 1982, “Improved Heuristics for Multi-Stage Requirements Planning Systems”, Management Science, Vol. 28, pp. 44-56.
3.Bookbinder, J. H. and Koch, L. A., 1990, “Production Planning for Mixed Assembly Systems”, Journal of Operations Management, Vol. 9, pp. 7-23.
4.Cevriye, G., Serpil, E., and Yalcin, E., 1999, “A Decision Network Algorithm for Multistage Dynamic Lot Sizing Problems”, International Journal of production economics, Vol. 62, No. 3, pp. 281-285.
5.Chan, G. H., Xia, Z. H. and Choo, E. U., 1999, “The Critical Cut-Off Value Approach for Dynamic Lot Sizing Problems with Time Varying Cost Parameters”, Computers and Operations Research, Vol. 26, No. 2, pp. 179-188.
6.Charles, R. S., 1997, “Dynamic Lot Sizing with Random Demand and Non-Stationary Costs”, Operation Research Letters, Vol. 20, No. 4, pp. 155-164.
7.Chung, K. J. and Chyr, F. C., 1997, “From Wagner-Whitin’s Dynamic Lot Size Model towards Zero Inventory”, Production Planning and Control, Vol. 8, No. 7, pp. 670-677.
8.Chopra, S. and Peter M., 2001, Supply Chain Management-Strategy, Planning and Operation, Prentice-Hall, USA.
9.Chyr, F. C., 1990, “A New Approach to the Dynamic Lot Size Model”, International Journal of Engineering Costs and Production Economic, Vol. 20, pp. 255-263.
10.Coleman, B. J., Saydam, C. and Mcknew, M. A., 1991, “An Efficient Zero-One Formulation of the Multilevel Lot-Sizing Problem”, Decision Science, Vol. 22, pp. 280-295.
11.Crowston, W. B. and Wagner, H. M., 1973, “Dynamic Lot Size Models for Multi-Stage Assembly Systems”, Management Science, Vol. 20, pp. 14-21.
12.Dellaert, N. and Jeunet, J., 1998, A Genetic Algorithm to Solve Multilevel Lot-sizing Problems in MRP, Report 9808, Econometric Institute, Erasmus University of Michigan.
13.Dellaert, N. and Jeunet, J., 2000, “Solving Large Unconstrained Multilevel Lot-Sizing Problems Using a Hybrid Genetic Algorithm”, International Journal of Production and Research, Vol. 38, No. 5, pp. 1083-1099.
14.Denize, A., Kemal, A. and Suresh, C., 2003, “The Single-Item Lot-Sizing Problem with Immediate Lost Sales”, European Journal of Operation Research, Vol. 147, pp. 558-566.
15.Evans, J. R., 1985, “An Efficient Implementation of the Wagner-Whitin Algorithm for Dynamic Lot-Sizing”, Journal of Operations Management, Vol. 5, pp. 229-235.
16.Fordyce, J. M. and Webster, F. M., 1984, “The Wagner-Whitin Algorithm Made Simple”, Production and Inventory Management, Vol. 25, No. 2, pp. 21-30.
17.Garey, M. and Johnson, D., 1978, Computers, Complexity and Intractability: A Guide to Theory of NP-Completeness, W. H. Freeman, San Francisco.
18.Goffin, K., Szwejczewski, M. and New, C., 1997, “Managing Suppliers: When Fewer Can Mean More”, International Journal of Physical Distribution and Logistics Management, Vol. 27, No. 7, pp. 422-436.
19.Hall, J., 1991, “Distribution Function is Now, Supply Chain Integrator”, Industrial Engineering, Sep., pp 18-19.
20.Handfield C. M. and Nichols, E. L., 1999, Introduction to Supply Chain Management, Prentice-Hall, USA.
21.Harris, F. W., 1915, Operations and Cost Factory Management Series, A. W. Shaw Co., Chicago, pp. 48-52.
22.Heinrich, K., 1997, “A Dynamic Lot Sizing Model with Exponential Machine Breakdown”, European Journal of Operation Research, Vol. 100, pp. 514-536.
23.Hicks, D. A., 1996, “Enterprise Solutions: Back on the Supply Chain”, IIE Solutions, Vol. 28, No. 1, pp. 25-28.
24.Jizesf, V., 1995, “Setup Cost Stability Region for the Multi-Level Dynamic Lot Sizing Problem”, European Journal of Operation Research, Vol. 87, pp. 132-141.
25.Orlicky, J., 1975, Material Requirement Planning, McGraw-Hill, New York.
26.Pakath, R. and Zaveri, J. S., 1995, “Specifying Critical Inputs in a Genetic Algorithm-driven Decision Support System: An Automated Facility”, Decision Sciences, Vol. 26, pp. 749-779.
27.Seliver, E. A. and Meal, H. C., 1973, “A Heuristic for Selecting Lot Size Quantities for the Case of a Deterministic Time-Varying Demand Rate and Discrete Opportunistic for Replenishment”, Production and Inventory Management, Vol. 14, No. 1, pp 64-74.
28.Steinberg, E. and Napier, H. A., 1980, “Optional Multilevel Lot Sizing for Requirements Planning Systems”, Management Science, Vol. 26, pp. 1258-1271.
29.Stevenson, William J., 2002, Operations Management, McGraw-Hill, New York.
30.Tan, K. C., Kannan, V. J., Handfield, R. B. and Ghosh S., 1999, “Supply Chain Management: An Empirical Study of It’s Impact on Performance”, International Journal of Operation and Production Management, Vol. 19, No. 19, pp. 1034-1052.
31.Thomas, I. and Heinz, G., 1997, “Feasible Sequential Decision and a Flexible Lag Range an-based Heuristic for Dynamic Multi-Level Lot Sizing”, International Transactions in Operational Research, Vol. 4, pp. 327-340.
32.Verwijmeren, M., 1996, “Material Supply Chain Management”, International Journal of Physical Distribution & Logistics Management, Vol. 26, No. 6, pp. 16-31.
33.Wagner, H. M. and Whitin, T. M., 1958, “Dynamic Version of the Economic Lot Size Model”, Management Science, Vol. 5, No. 1, pp. 89-96.
34.Yelle, L. E., 1979, “Material Requirements Lot Sizing: A Multilevel Approach”, International Journal of Production Research, Vol. 17, pp. 223-232.
35.Zangwill, W. I., 1968, “Minimum Concave Cost Flows in Certain Networks”, Management Science, No. 14, pp. 429-450.
36.Zangwill, W. I., 1969, “A Backlogging Model and a Multi-Echelon Model of A Dynamic Lot Size Production System-A Network Approach”, Management Science, Vol. 15, pp. 506-527.