6.1 結論
本研究建立生產一般產品及再生產品的利潤最大化經濟批量排程問題之模 式，並透過 TVLS 最佳解搜尋演算法進行求解，該題目為一個新的問題，從文 獻中搜尋並無同時探討利潤最大化及回收商品的經濟批量排程問題。
針對求解此問題，本研究提出 TVLS 最佳解搜尋演算法。該方法分為前、
中及後段三個部分，前段是以 BP-based 模式求出基本週期乘數ki與基本週期 B，
本研究分別使用共同週期法(CC)、基因演算法(GA)、接合點搜尋法(JP)三種方 法進行求解。
中段進行排程建立，本研究使用最長操作時間派工法(LPT)進行建立，將產 品以乘數小及總生產時間大的品項優先排入各基期排程，再將各基期排程整合 為 TVLS 用的排程，並用基本週期 B 乘以最大乘數作為 TVLS 週期 T。
後段為 TVSL 求解，又分別考慮三種情況，情況一僅用 LPT 排程及週期 T 計算出滿足限制式的 TVLS 模式目標值；而情況二使用二分搜尋法，針對上下 界進行給定排程下的最佳週期搜尋，改善了文獻中求解 TVLS 並未對週期 T 進 行搜尋的求解方式；情況三再針對排程進行改善，本研究使用鄰域搜尋法進行 排程的微調與重新求解，找出 TVLS 模式下的近似最佳解及其排程。
從數值分析的結果，可以判斷本研究提出之三種方法中以接合點演算法求 出之解的品質最好，然而本研究延續傳統 ELSP 問題之假設－不考慮一般產品 原料成本，故無法顯著的看出生產一般產品與再生產品在利潤上帶來的差異。
模式的求解時間與方法並於絕對關係，而是由排程長度 l 影響求解的變數數量，
進而影響到求解時間。
6.2 建議
1. 本研究在 TVLS 最佳解求解演算法中，針對改善排程使用了鄰域搜尋法，
從結果來看確實是有較未修改排程前稍為在提升些許品質，但這未必是 唯一可用的演算法，而鄰域的定義也會大大的影響其結果品質，故可以 試用不同的演算法對排程進行改善。
2. 本研究使用二分搜尋法進行 TVLS 中週期 T 的搜尋，但僅提出產品整備 時間加總作為合理的下界，及數理上合理之上界，並未提出據合理管理 意涵之上界，由於推導該項上界在數理上十分複雜，故未來針對此題目 進行延伸時可以嘗試提出合理的故定排程下週期搜尋上界。
3. 本研究在與共同週期法之數理上改善值較不為顯著，推斷原因是由於限 制住再生產品的售價必須小於一般產品的售價，然而若進一步將一般產 品的原料成本考慮進模式中，將有機會突顯出再生產品因為取得成本較 一般產品原料成本為低，而又較明顯的改善值。
參考文獻
外語參考文獻：
[1] Absi, N. and Kedad-Sidhoum, S., "The Multi-Item Capacitated Lot-Sizing Problem with Safety Stocks And Demand Shortage Costs," Computers &
Operations Research, vol. 36, pp. 2926-2936, Nov 2009.
[2] Boctor, F. F., "the 2-Product, Single-Machine, Static Demand, Infinite Horizon Lot Scheduling Problem," Management Science, vol. 28, pp. 798-807, 1982.
[3] Bomberger, E., E, "a Dynamic Programming Approach to a Lot Size Scheduling Problem," Management Science, vol. 12, pp. 778-784, 1966.
[4] Brander, P., Leven, E., and Segerstedt, A., "Lot Sizes in a Capacity Constrained Facility - a Simulation Study of Stationary Stochastic Demand," International Journal of Production Economics, vol. 93-4, pp. 375-386, Jan 2005.
[5] Carreno, J. J.,”Economic Lot Scheduling for Multiple Products on Parallel Identical Processors,” Management Science, 36, 348-358, 1990.
[6] Davis, S. G., "Scheduling Economic Lot Size Production-Runs," Management Science, vol. 36, pp. 985-998, Aug 1990.
[7] Delporte, C. M. and Thomas, L. J., "Lot Sizing and Sequencing for N-Products on One Facility," Management Science, vol. 23, pp. 1070-1079, 1977.
[8] Elmaghraby, S. E., "Economic Lot Scheduling Problem (ELSP) - Review and Extensions," Management Science, vol. 24, pp. 587-598, 1978.
[9] Gallego, G., "Scheduling the Production of Several Items with Random Demands in a Single Facility," Management Science, vol. 36, pp. 1579-1592, Dec 1990.
[10] Gascon, A. and Leachman, R. C., et al., "Multiitem, Single-Machine Scheduling Problem with Stochastic Demands - a Comparison of Heuristics," International Journal of Production Research, vol. 32, pp. 583-596, Mar 1994.
[11] Giri, B. C., Moon, I., and Yun, W. Y., "Scheduling Economic Lot Sizes in Deteriorating Production Systems," Naval Research Logistics, vol. 50, pp. 650-661, Sep 2003.
[12] Hanssmann, F., Opeation Research in Production and Inventory. New York:
John Wiley & Sons, 1962.
[13] Hsu, W. L., "on the General Feasibility Test of Scheduling Lot Sizes for Several Products on One Machine," Management Science, vol. 29, pp. 93-105, 1983.
[14] Khouja, M., Michalewicz, Z., and Wilmot, M., "the Use of Genetic Algorithms to Solve the Economic Lot Size Scheduling Problem," European Journal of Operational Research, vol. 110, pp. 509-524, Nov 1 1998.
[15] Khoury, B. N., Abboud, N. E., and Tannous, M. M., "the Common Cycle
Approach to the ELSP Problem with Insufficient Capacity," International Journal of Production Economics, vol. 73, pp. 189-199, Sep 2001.
[16] Leachman, R. C. and Gascon, A., "A Heuristic Scheduling Policy for Multi-Item, Single-Machine Production Systems with Time-Varying, Stochastic Demands,"
Management Science, vol. 34, pp. 377-390, Mar 1988.
[17] Li, Y. J., Chen, J., and Cai, X. Q., "Heuristic Genetic Algorithm for Capacitated Production Planning Problems with Batch Processing and Remanufacturing,"
International Journal of Production Economics, vol. 105, pp. 301-317, Feb 2007.
[18] Maxwell, W., "The scheduling of economic lot sizes," Naval Research Logistics Quarterly, vol. 11, p. 35, 1964.
[19] McClain, J. O., Perations Management: Production of Goods and Services, 3rd ed.: Prentice Hall, 1992.
[20] Moon, I., Gallego, G., and Simchilevi, D., "Controllable Production-Rates in a Family Production Context," International Journal of Production Research, vol.
29, pp. 2459-2470, Dec 1991.
[21] Pan, Z. D., Tang, J. F., and Liu, O., "Capacitated Dynamic Lot Sizing Problems in Closed-Loop Supply Chain," European Journal of Operational Research, vol.
198, pp. 810-821, Nov 2009.
[22] Rogers, J., "A Computational Approach to the Economic Lot Scheduling Problem," Management Science, vol. 4, pp. 264-291, 1958.
[23] Tang, O. and Teunter, R., "Economic Lot Scheduling Problem with Returns,"
Production and Operations Management, vol. 15, pp. 488-497, Win 2006.
[24] Teunter, R., Kaparis, K., and Tang, O., "Multi-Product Economic Lot Scheduling Problem with Separate Production Lines for Manufacturing and Remanufacturing," European Journal of Operational Research, vol. 191, pp.
1241-1253, Dec 16 2008.
[25] Teunter, R., Tang, O., and Kaparis, K., et al., "Heuristics for the Economic Lot Scheduling Problem with Returns," International Journal of Production
Economics, vol. 118, pp. 323-330, Mar 2009.
[26] Yao, M. J., “The Economic Lot Scheduling Problem under Power-of-Two
Policy,“ Computer and Operations Research, 28, 1441-1460,2001.
[27] Zanoni, S., Segerstedt, A., Tang, O., and Mazzoldi, L., "Multi-Product
Economic Lot Scheduling Problem with Manufacturing and Remanufacturing Using a Basic Period Policy," Computers & Industrial Engineering, vol. 62, pp.
1025-1033, 2012.
[28] Zhou, S. X., Tao, Z., and Chao, X., "Optimal Control of Inventory Systems with Multiple Types of Remanufacturable Products," Manufacturing & Service Operations Management, vol. 13, pp. 20-34, Win 2011.
[29] Zhou, S. X. and Yu, Y., "Optimal Product Acquisition, Pricing, and Inventory Management for Systems with Remanufacturing," Operations Research, vol. 59, pp. 514-521, Mar-Apr 2011.
中文參考文獻：
[1]王俊傑, "求解不完美系統下允許回收再製造之經濟批量排程問題," 國立成功 大學, 碩士, 民 99.
[2]李翔豐, "以共同週期法求解製造與再製造系統下允許變動生產速率之經濟批 量排程問題," 國立成功大學, 碩士, 民 100.
[3]傅俊源, "週期需求的批量製造與再製造之生產規劃問題," 國立清華大學, 碩士, 民 100.
[4]黃志強, "再製造過程中使用努力值下之最佳回收量研究," 國立中央大學, 碩士, 民 100.
[5]鄧喻心, "考慮再製造的兩階層供應鏈最佳存貨策略," 國立臺灣科技大學, 碩士, 民 98.
簡歷
姓名：蔡季軒 出生地：台北市
出生日期：民國 77 年 07 月 04 日
聯絡地址：台北市信義區忠孝東路五段 372 巷 27 弄 59 號 4 樓 電子信箱：julyforth.tsai@nctu.edu.tw
學歷：
民國 101 年 7 月 國立交通大學 運輸科技與管理學系 碩士班畢業 民國 99 年 6 月 國立交通大學 運輸科技與管理學系 學士班畢業 民國 95 年 6 月 台北市立中崙高級中學 畢業