臺灣博碩士論文加值系統

經濟批量排程問題是指單一機器生產多種產品時，對產品的生產順序進行排序，並決定生產批量的大小以及何時該開始生產，目標為得到最小的總生產成本，且生產排程必須為合理可行。而為了貼近現實的生產情況，學者們陸續將經濟排程問題分成各種情境來討論，其中一種考量許多企業生產完產品時，都需要進入儲藏的過程，就會有倉儲租賃成本。因此總成本不可能只去計算存貨持有成本和整備成本，期間的倉儲的租賃成本也該納入考量；本研究假設企業需要租借外部倉儲空間，建立數學模式，求解經濟批量排程問題的倉儲空間與總成本(包括租賃成本)，目標為求得最佳總成本。
傳統上，經濟批量排程問題皆假設機台以最大的生產速率來進行生產，有學者研究發現在機器有閒置時間下，有效的降低生產速率進行生產，可減少存貨持有成本，平均總成本因而下降。因此本研究考慮多個產品的經濟批量排程問題，假設機器在共同週期法下，挑選產品中存貨持有成本最高的產品，使用閒置時間進行彈性速率法來變更生產速率，並求解所需的倉儲空間的大小。
求解此問題的關鍵因素為利用蟻群系統演算法搜尋較佳化的生產順序以求得較佳的可行解。數據結果顯示共同週期法下運用彈性速率法可以比共同週期法下運用固定速率法求解出更低的成本，有明顯的改善程度。本研究提出在共同週期法下速率變更的數學模式可以做為其他相關研究的參考。

The ELSP is concerned with the scheduling of cyclical production of n≥2 products on a single facility in equal lots over an infinite planning horizon, assuming stationary and known demands for each product. The objective of the ELSP is to determine the lot size and the schedule of production of each product so as to minimize the total cost incurred per unit time. When a company does not have enough storage space, it must rent an outsourcing warehouse space from other companies to store products. If this condition happening, a manager will need to consider following: (1) how to calculate the exact warehouse size and (2) how does the rent cost affect the average total cost. Therefore, this study discusses the above two issues as a company must rent an outsourcing warehouse space from other companies. This research uses the flexible rate method to solve the warehouse size and average total cost of the economic lot scheduling problem under the common cycle approach.
Our approach applied the extra idle time for changing the production rate of one product in order to reduce the holding cost and warehouse rental cost. This study uses the flexible rate method to pick a particular product with the highest holding cost and change its production rate. In this study, as applying the flexible rate method to adjust the production rate of a product, it does not only affect the holding costs, but also impacts the warehouse rent sizes.
This study will investigate how to apply the ant colony system to find a the optimal production sequence and solution under the common cycle approach. The numerical experiment shows our flexible rate method can obtain better solutions than the fixed rate method. Our study can help decision makers to schedule all products sequence, compute the related costs and rent the exact outsourcing warehouse space.

第一章 緒論 1
1.1 研究背景與動機 1
1.2 研究目的 4
1.3 研究方法與步驟 4
1.4 論文架構 5
第二章 文獻探討 7
2.1 經濟批量排程問題 7
2.1.1 經濟批量排程問題常見的求解方法 8
2.1.2 經濟批量排程問題延伸研究 12
2.2 倉儲相關文獻 13
2.3 變更速率生產方法的相關文獻 14
2.4 解決順序性問題常見的方法 16
2.5 小結 21
第三章 ELSP數學模式建立與求解 22
3.1 ELSP的符號定義與基本假設 22
3.1.1 符號定義 22
3.1.2 基本假設 22
3.1.3 在共同週期法下的倉儲空間推導 23
3.2 彈性速率變更下ELSP模式 26
3.2.1 基本假設與數學符號 26
3.2.2 本研究數學符號定義 26
3.2.3 在共同週期法下運用彈性速率之公式建立 27
3.2.4 成本項分析 28
3.2.5 彈性速率下倉儲的租賃成本 29
3.2.6 數學模式建構 41
3.3 以螞蟻演算法求解生產順序 42
3.3.1 螞蟻系統介紹 42
3.3.2 蟻群系統介紹 45
3.3.3 ACS求解ELSP問題 47
3.4 小結 51
第四章 數值範例與數據實驗 53
4.1 數值範例 53
4.2 隨機實驗 67
4.3 小結 70
第五章 結論與未來研究方向 71
5.1 結論 71
5.2 未來研究方向 71
參考文獻 73

1.林禎樺（2014），《以固定速率法求解經濟批量排程問題的倉儲大小與成本》，東海大學資訊管理學系碩士論文，未出版。
2.郭育瑋（2014），《以簡單固定速率法求解在基本週期下有保存期限制的經濟批量排程問題》，東海大學資訊管理學系碩士論文，未出版。
3.陳世杰、張育仁、黃裕舜、黃晞臨（2012），〈應用固定生產速率求解生產系統下經濟批量排程與檢驗問題〉，發表於2012工業工程學會年會暨學術研討會，大葉大學。
4.張孝裕（2006），《倉儲受限下可變動生產速率之兩產品經濟批量排程問題》，國立成功大學工業與資訊管理學系碩士論文，未出版。
5.張育仁、陳世杰、黃晞臨、郭再添（2014），〈以簡單固定速率法求解在基本週期法下經濟批量排程問題〉，發表於第十二屆（2014）產業管理創新研討會-精實創新與創意思考，修平科技大學。
6.許柏彥（2012），《經濟批量排程問題之倉儲空間與成本的探討》，東海大學資訊管理學系碩士論文，未出版。
7.鄭舜維（2009），《庫存空間受限下最佳損毀率與儲存量決策問題之研究》，東吳大學會計學系碩士論文，未出版。
8.蔣其軒（2007），《利用共同週期法求解不完美生產系統下可變動生產速率之經濟批量排程問題》，國立成功大學工業與資訊管理學系碩士論文，出版。
9.賴阮明 (2009)，《整合粒子群最佳化與蜂群演算法求解彈性零工式生產排程問題之研究》，國立台北科技大學工業工程與管理研究所碩士論文，未出版。
10.Ai and Kachitvichyanukul (2009). A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery, Computers and Operations Research, 36, 1693-1702.
11.Bomberger, E. (1966). A dynamic programming approach to a lot size scheduling problem, Management Science, 12, 778-784.
12.Boctor, F.F. (1987). The g-group heuristic for dingle machine lot scheduling, International Journal of Production Research, 25, 363-379.
13.Buzacott, J.A. and I.A. Ozkarahan (1983). One- and two-stage scheduling of two products with distributed inserted idle time: the benefits of a controllable productions rate, Naval Research logistics Quarterly, 30, 675-696.
14.Bullnheimer, R.F. Hartl and C, Strauss (1997). An improved ant system algorithm for the vehicle routing problem, Meta-Heuristics：Advances and Trends in Local Search Paradigms for Optimization, 109.
15.Bullnheimer B., R. F. Hartl,, and C. Strauss (1999). A new rank based version of the ant system- A computational study, European Journal for Operations Research and Economics, 7, 25-38
16.Carreno, J.J. (1990). Economic lot scheduling for multiple products on parallel identical processors, Management Science, 36, 348-358.
17.Chang, Y.J. and M.J. Yao (2011). New heuristics for solving the economic lot scheduling problem with reworks, Journal of Industrial Management Optimization, 7, 229-251.
18.Chang Y.C., C.Li. Vincent and Chia-Ju Chiang (2014). An ant colony optimization heuristic for an integrated production and distribution scheduling problem, Engineering Optimization, 46, 503-520.
19.Davis, S.G. (1990). Scheduling economic lot size production runs, Management Science, 36, 985-998.
20.Dobson, G. (1992). The cyclic lot scheduling problem with sequence-dependent setups, Operations Research, 40, 736-749.
21.Dorigo, M., and T. Stützle (2002). The ant colony optimization metaheurristic：Algorithms, application and advances, In Glover, F., & G Kochenberger.(Eds.), Handbook of Metaheuristics, Kluwer Academic Publishers.
22.Dorigo, M., and L.M Gambardella (1997). Ant colony system: a cooperative learning approach to the traveling salesman problem, IEEE Transactions on Evolutionary Computation, 1, 53-66.
23.Dorigom, M. (1992). Optimization, learning and natural algorithms, PH.D. Thesis, Dip. Elettronicae Informaztion, Politecnico di Milano, Italy.
24.Dorigom, M.,and L.M. Gambardella (1997). Ant colonies for the traveling salesman problem.BioSystems,43, 73-81.
25.Elmaghraby, S.E. (1978). The economic lot scheduling problem (ELSP): review and extension, Management Science, 24, 587-597.
26.Eynan, A. (2003). The benefits of flexible production rates in the economic lot scheduling problem, IIE Transactions, 35, 1057-1064.
27.Eberhart, R.C. and Y Shi (1998). Comparison between genetic algorithms and particle swarm optimization, Annual Conference on Evolutionary Programming, San Diego.
28.Eberhart, R.C. and J Kennedy (1995). New optimizer using particle swarm theory, Proc. Sixth International Symposium on Nagoya, Japan, 39-43.
29.Emanuel T., M Efr´en, and A Carlos (2007). An ant system with steps counter for the job shop scheduling problem, IEEE Congress on Evolutionary Computation, September, 19, 477-484.
30.Geng, P. C. and R. G. Vickson (1988). Two heuristics for the economic lot scheduling problem: an experimental study, Naval Research Logistics, 35, 605-617.
31.Gallego, G. (1993). Reduced production rates in the economic lot scheduling problem, International Journal of Production Research, 31, 1035-1046.
32.Gallego, G. and I. Moon (1996). How to avoid stocks when producing several items in a single facility? What to do if you can't. Computers & Operations Research, 23, 1-12.
33.Hsu, W. L. (1983). On the general feasibility test of scheduling lot sizes for several products on one machine, Management Science, 29, 93-105.
34.Hanssmann, F. (1962). Operation research in production and inventory control, Wiley, New York.
35.Haessler, R.W. and S.L. Hogue (1976). A note on the single machine multi-product lot scheduling problem, Management Science, 22, 909-912.
36.Haessler, R.W. (1979). An improved extended basic period procedure for solving the economic lot scheduling problem, AIIE Transactions, 11(4), 336-340.
37.Holland, J.H. (1975). Adaptation in natural and artificial systems, University of Michigan Press, Ann Arbor, MI.
38.Jones, P. C. and R. R. Inman (1989). When Is The Economic Lot Scheduling Problem Easy?, IIE Transaction, 21, 11-20.
39.Jaruphongsa, W., S. Cetinkaya and C. Lee (2004). Warehouse space capacity and delivery time window considerations in dynamic lot-sizing for a simple supply chain, International Journal of Production Economics, 92, 169–180.
40.Khouja, M., Z. Michalewicz and M. Wilmot (1998). The use of genetic algorithms to solve the economic lot size scheduling problem, European Journal of Operation Research, 110, 509-524.
41.Khouja, M. (1999). A note on ‘Deliberately slowing down output in a family production context’, International Journal of Production Research, 37, 4067-4077.
42.Khouja, M. (1997). The economic lot scheduling problem under volume flexibility, forthcoming, International Journal of Production Economics, 48 73-86.
43.Liang, Yanlai and Fangming Zhou (2011). A two-warehouse inventory model for deteriorating items under conditionally permissible delay in payment, Applied Mathematical Modelling, 35, 2221-2231.
44.Lima, M.F., L.D.H. Sampaio, B.B. Zarpelao, J.J.P.C. Rodrigues, T Abrao. and M.L Proenca (2010). Networking anomaly detection using dsns and particle swarm optimization with re-clustering, Global Telecommunications Conference, 1-6.
45.Lian Zhigang, Jiao Bin and Gu Xingsheng (2011). A similar particle swarm optimization algorithm for job-shop scheduling to minimize makespan, Applied Mathematics and Computation, 183, 1008-1017.
46.Minner, S. (2009). A comparison of simple heuristics for multi-product dynamic demand lot-sizing with limited warehouse capacity, International Journal of Production Economics, 118, 305-310.
47.Moghadam, B.F., S.J. Sadjadi and S.M Seyedhosseini (2010). Comparing mathematical and heuristic methods for robust vehicle routing problem. International Journal of Research and Reviews in Applied Science, 2(2),108-116.
48.Moon, I., E.A. Silver and S. Choi (2002). Hybrid genetic algorithm for the economic lot-scheduling problem, International Journal of Production Research, 40, 809-824.
49.Merwe, D.W. and A.P Engelbrecht (2003). Data clustering using particle swarm optimization, Proceedings of IEEE Congress on Evolutionary Computation, 215-220.
50.Moon, I.K., B.C. Cha and H.C. Bae (2006). Hybrid genetic algorithm for group technology economic lot scheduling problem, International Journal of Production Research, 44, 4551-4568.
51.Moon, D. H. and P. D. Christy (1998). Determination of optimal production rates on a single facility with dependent mold lifespan, International Journal of Production Economics, 54(1), 29-40.
52.Merwe, D.W. and A.P. Engelbrecht (2003). Data clustering using particle swarm optimization, Proceedings of IEEE Congress on Evolutionary Computation 2003, 215-220.
53.Maniezzo, V. (1999).Exact and approximate nondeterministic tree-search procedires for the quadratic assignment problem. INFORMS Journal on Computing, 11, 358-369.
54.Mcmullen, P. R. (2001). An ant colony optimization approach to addressing a JIT sequencing problem with multiple objectives. Artificial Intelligence in Engineering, 15, 309-317.
55.Maier, H.R., , A. R. Simposon, A. C. Zecchin, W. K. Foong, K. Y. Phang, H. Y. Seah, and C. L. Tan (2003). Ant Colony optimization for water distribution system. J. Water Resour. Plng. And Mgmt., ASCE, 129(3), 200-209.
56.Öner, S. and T. Bilgiç (2008). Economic lot scheduling with uncontrolled co-production, European Journal of Operational Research, 188, 793-810.
57.Park, K.S. and D.K. Yun (1987). Feasibility test for multi-product lot size scheduling on one machine, Policy and Information, 11, 101-108.
58.Rogers, Jack (1958). A computational approach to the economic lot scheduling problem, Management Science, 4, 264-291.
59.Soman, C.A., D.P. van Donk and G.J.C. Gaalman (2004). A basic period approach to the economic lot scheduling problem with shelf life considerations, International Journal of Production Research, 42(8), 1677-1689.
60.Sheldon, R. (1986). The lot scheduling problem in the hierarchy of decision models. Ph.D. dissertation. School of OR & IE, Cornell University, Ithaca, NY 14850, USA.
61.Silver, E.A. (1990). Deliberately slowing down output in a family production context, International Journal of Production Research, 28, 17-27.
62.StÄutzle, T., and M Dorigo (1999). ACO algorithms for the traveling salesmanproblem, Evolutionary Algorithms in Engineering and Computer Science, 3,163-183.
63.Tang, O. and R.H. Teunter (2006). Economic lot scheduling problem with returns, Production and Operations Management, 15(4), 488-497.
64.Tang, O. and R.H. Teunter (2006). Economic lot scheduling problem with returns, Production and Operations Management, 15(4), 488-497.
65.Teunter, R.H., K. Kaparis and O. Tang (2008). Multi-product economic lot scheduling problem with separate production lines for manufacturing and remanufacturing, European Journal of Operational Research, 191, 1241-1253.
66.Transchel, S. and S. Minner (2009). Dynamic pricing and replenishment in the warehouse scheduling problem – A common cycle approach, International Journal of Production Economics, 118, 331-338.
67.Wangner, B.J. and D.J. Davis (2002). A search heuristic for the sequence-dependent economic lot scheduling problem, European Journal of Operational Research, 141, 133-146.