臺灣博碩士論文加值系統

在製造產業的領域中，生產排程及運送策略一直是生產管理或供應鏈管理上的重要議題。生產排程決定了工作順序及產能利用率，目的是為了達到總完工時間最小；而產品運送策略則影響到企業的物流成本。過去研究大多將上述二議題分開討論。
然而，一個企業會同時面臨兩個問題，一是如何在交期內準時達交至顧客端，降低遲到或早到的成本；二則是如何決定運送策略以達到運送成本最小。因此，若能同時考慮此兩階段問題，並發展一套模式求解，進而達到總成本最小化。本研究探討單機組裝排程、多點運送的生產排程及航空運輸的配送問題，期望透過生產排程、航空班次及運送量之決定，達到早到、晚到及運送等總成本最小化，並先以數學規劃建立整合訂單排程與運送排程之排程模式，本研究將此問題建構為一個非線性整數規劃模型，並以套裝軟體Lingo 10.0 求解。數值例測試顯示於合理數據之小規模下，Lingo 10.0皆可在合理時間內求得最佳解，並將此問題發展一混合啟發式演算法，其測試結果顯示演算法之求解品質及效率優於套裝軟體Lingo 10.0。

Production scheduling and transportation strategies in manufacturing systems are two important topics in the fields of production or supply chain management. Production scheduling is usually used to decide which job to schedule next when a work center becomes available so as to reduce the total time span, while transportation strategy usually focuses on the amount shipped between distribution channels so as to reduce logistics costs. These two decisions are usually separately discussed in previous works.
However, since a business may simultaneously face the problems of how to deliver goods to customers on time in order to reduce the sum of early and delay costs, and how to distribute goods between distribution channels to minimize the shipping costs, it needs to develop a model to simultaneously deal with these two problems so as to minimize the total costs. This paper deals with a production scheduling and air-transportation problem with a single-machine and multi-delivery destinations. The purpose of this paper is to develop the production scheduling and transportation strategies in order to minimize the sum of early cost, delay cost and transportation cost. The mathematic model established in this research is a constrained non-linear integer programming problem. Lingo 10.0 was used to obtain solutions. The illustrations show that Lingo 10.0 can get optimal solutions within a reasonable amount of time under small scales. A hybrid heuristic is developed to find solutions to this problem. Computational experiments show that the proposed approach is superior to the well-known Lingo 10.0 software in terms of both solution quality and computational effectiveness.

摘要 I
ABSTRACT II
誌謝 III
目錄 IV
圖目錄 VI
表目錄 VII
第一章　緒論 1
1.1　研究背景與動機 1
1.2　研究目的與範圍 2
1.3　研究方法 3
1.4　研究架構與流程 3
第二章　文獻回顧 6
2.1　生產排程之相關文獻 6
2.1.1　流程式生產之相關文獻 8
2.2　運送排班策略之相關文獻 11
2.3　供應鏈整合與策略分析 12
第三章　問題描述與模式建構 16
3.1　問題描述 16
3.2　基本假設 17
3.3　模式構建 17
第四章　研究方法 24
4.1　基因演算法介紹 24
4.1.1　染色體編碼（Encoding） 25
4.1.2　初始母體（Initial Population） 26
4.1.3　適應值函數（Fitness Function） 26
4.1.4　遺傳運算子（Genetic Operators） 27
4.1.5　終止條件（Termination） 31
4.2　混合式基因演算法與簡例說明 34
第五章　數值例測試 43
5.1　數值例設計 43
5.1.2　數值例比較 47
5.3　實例分析 55
第六章　結論與建議 62
6.1　結論 62
6.2　建議 63
參考文獻 65


圖目錄
圖1.1　研究架構流程圖 5
圖3.1　生產排程運送架構圖 16
圖4.1　二元編碼圖 25
圖4.2　整數編碼圖 26
圖4.3　單點交配圖 28
圖4.4　兩點交配圖 29
圖4.5　字罩交配圖 30
圖4.6　單點突變圖 31
圖4.7　基因流程圖 33
圖4.8　染色體編碼圖 34
圖4.9　基因解碼圖 36
圖4.10　染色體交換配對過程 38
圖4.11　單點突變圖 40
圖4.12　混合式基因演算法流程圖 42
圖5.1　各問題規模組間求解時間之趨勢圖 46
圖5.2　各問題規模下組內、組間求解時間標準差之趨勢圖 46


表目錄
表4.1　初始母體基因組合 35
表4.2　染色體之適應值 37
表4.3　菁英政策選取之染色體 37
表4.4　染色體複製結果 38
表4.5　染色體交換配對前之基因組合 39
表4.6　染色體交換配對後之基因組合 39
表4.7　染色體突變結果 40
表5.1　問題規模大小內容 44
表5.2　訂單相關之各項參數測試值 44
表5.3　各問題規模下之指標值 45
表5.4　問題規模一數值例求解時間與求解品質比較 50
表5.5　問題規模二數值例求解時間與求解品質比較 51
表5.6　問題規模三數值例求解時間與求解品質比較 52
表5.7　問題規模四數值例求解時間與求解品質比較 53
表5.8　問題規模五數值例求解時間與求解品質比較 54
表5.5　訂單相關之各項參數測試值 55
表5.6　基本資料設定 56
表5.7　產品AP90之實際參數資料表 57
表5.8　產品AP90於問題規模一之測試結果（N =3） 58
表5.9　產品AP90於問題規模二之測試結果（N =5） 59
表5.10　產品AP90於問題規模三之測試結果（N =7） 60

【1】 Al-Turki, U., Fedjki, C. and Andijani, A. (2001), “Tabu search for a class of single-machine scheduling problems,” Computers & Operations Research, vol. 28, pp. 1223-1230.
【2】 Armentano, V. A. and Ronconi, D. P. (1999), “Tabu search for total tardiness minimization in flowshop scheduling problems,” Computers & Operations Research, Vol. 26 pp. 219-235.
【3】 Ashayeri, J. and Selen, W. (2007), “A planning and scheduling model for onsertion in printed circuit board assembly,” European Journal of Operational Research, vol. 183, pp.909-925.
【4】 Buer, M. G. V., Woodruff, D. L. and Olson, R. T. (1999), “Solving the medium newspaper production / distribution problem,” European Journal of Operational Research, vol. 115, pp. 237-253
【5】 Chen, B. and Lee, C. Y. (2008), “Logistics scheduling with batching and transportation,” European Journal of Operational Research, vol. 189, pp. 871-876.
【6】 Feldmann, M. and Biskup, D. (2003), “Single-machine scheduling for minimizing earliness and tardiness penalties by meta-heuristic approaches,” Computers & Industrial Engineering, vol.44, pp.307-323.
【7】 Grunow, M., Gunther, H. O., Schlesusener, M. and Yilmaz, I. O. (2004), “Operations planning for collect-and-place in PCB assembly,” Computers & Industrial Engineering, vol. 47, pp. 409-429.
【8】 Hall, N. G. and Potts, C. N. (2003), “Supply chain scheduling: batching and delivery,” Operation Research, vol. 51, pp. 566-584.
【9】 Kiesmuller, G. P., de Kok, A.G. and Fransoo, J. C. (2005), “Transportation mode selection with positive manufacturing lead time,” Transportation Research Part E, vol. 41, pp. 511-530.
【10】 Kubzin, M. A., Potts, C. N. and Strsevich, V. A. (2009), “Approximation results for flow shop scheduling problems with machine availability constraints,” Computers & Operations Research, Vol. 36, pp. 379-390.
【11】 Lee, C. Y. and Chen, Z. L. (2001), “Machine scheduling with transportation considerations,” Journal of Scheduling, vol.4, pp. 3-24.
【12】 Li, K., Ganesan, V. K. and Sivakumar, A. I. (2006), “Scheduling of single stage assembly with air transportation in a consumer electronic supply chain,” Computers & Industrial Engineering; Vol. 51, pp. 264-278.
【13】 Li, X., Wang, Q. and Wu, C. (2009), “Efficient composite heuristics for total flowtime minimization in permutation flow shops,” Omega, Vol. 27, pp. 155-164.
【14】 Liu, J. and Reeves, C. R. (2001), “Constructive and composite heuristic solutions to the P//ΣCi scheduling problem,” European Journal of Operational Research, vol. 132, pp. 439-452.
【15】 Manazini, R. and Bindi, F. (2009), “Strategic design and operational management optimization of a multi stage physical distribution system,” Transportation Research Part E, http://www.elsevier.com/locate/tre
【16】 Meixell, M. J. and Gargeya, V. B. (2005), “Global supply chain design: A literature review and critique,” Transportation Research Part E, Vol. 41, pp. 531-550.
【17】 Raut, S., Swami, S. and Gupta, J. N. D. (2008), “Scheduling a capacitated single machine with time deteriorating jobs values,” International Journal of Production Economics, vol. 114, pp. 769-780.
【18】 Roslof, J., Harjunkoski, I., Bjorkqvist, J., Karlsson, S. and Westerlund, T. (2001), “An MILP-based reordering algorithm for complex industrial,” Computers & Chemical Engineering, vol. 25, pp. 821-828.
【19】 Sadegheih, A. (2007), “Sequence optimization and design of allocation using GA and SA,” Applied Mathematics and Computation, vol. 186, pp. 1723-1730.
【20】 Soomer, M. J. and Franx, G. J. (2008), “Scheduling aircraft landings using airlines' preferences,” European Journal of Operational Research, vol. 190, pp. 277-291.
【21】 Talluri, S. and Baker, R. C. (2002), “A multi-phase mathematical programming approach for effective supply chain design,” European Journal of Operational Research, Vol. 141 pp. 544-558.
【22】 Tang, L. and Gong, H. (2009), “The coordination of transportation and bathing scheduling,” Applied Mathematical Modelling, http:// www.elsevier.com/locate/apm
【23】 Tang, L. and Liu, P. (2009), “Flow-shop scheduling problems with transportation or deterioration between the batching and single machines,” Computers & Operations Research, Vol. 56, pp. 1289-1295.
【24】 Tyan, J. C., Wang, F. K. and Du, T. C. (2003), “An evaluation of freight consolidation policies in global third party logistics,” Omega, Vol. 31 pp. 56-62.
【25】 Vergara, F. E., Khouja, M. and Michelewicz, Z. (2002), “An evolutionary algorithm for optimizing material flow in supply chains,” Computers & industrial, Vol. 43, pp. 407-421.
【26】 Verma, S. and Dessouky, M. (1998), “Single machine scheduling of unit time jobs with earliness and tardiness penalties,” Mathematics of Operations Research, vol.23, No. 4, pp.930-943.
【27】 Yang, D. L., Hsu, C. J. and Kuo, W. H. (2008), “A two- machine flow-shop scheduling problem with a separated maintenance constraint,” Computers & Operations Research, Vol. 35, pp. 876-833.
【28】 Ying, K. C. and Liao, C. J. (2004), “An ant colony system for permutation flow-shop sequencing,” Computers & operations Research, Vol. 31, pp. 791-801.
【29】 Yokoyama. (2008), “Flow-shop scheduling with setup and assembly operations,” European Journal of Operational Research, Vol. 187 pp. 1184-1195.