簡易檢索 / 詳目顯示
| 研究生： |
侯宜璇 Hou, Yi-Xuan |
|---|---|
| 論文名稱： |
多途程非對稱整備時間及雙顧客類型之最適生產排程之研究 Optimal Production Scheduling under Asymmetrical Set-up Time and Multi-routing for Two Types Customers |
| 指導教授： |
黃允成
Huang, Yun-Cheng |
| 學位類別： |
碩士 Master |
| 系所名稱： |
管理學院 - 工業管理系所 Department of Industrial Management |
| 畢業學年度： | 108 |
| 語文別： | 中文 |
| 論文頁數： | 56 |
| 中文關鍵詞： | 非對稱整備時間 、演算法 、隨選績效指標 、雙顧客類型 |
| 外文關鍵詞： | Asymmetrical Set-up Time, Algorithms, On-demand performance indicators, Dual-type Customers |
| DOI URL： | http://doi.org/10.6346/NPUST202000219 |
| 相關次數： | 點閱：12 下載：1 |
| 分享至: |
| 查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 |
本研究考量產品間之轉換需整備時間，然因拆裝困難度導致整備時間不同，因此將非對稱整備時間及生產批量納入生產排程系統中，考慮雙類型之顧客以及臨時插單等功能，使排程系統更符合實務上之需求。本研究提出隨機優化演算法(Random Optimization Algorithm, 簡稱ROA)在隨選績效指標下求解三種績效指標，並比較兩種訂單排序方式。結果顯示，使用演算法求得之排程結果皆優於使用者選擇之初解排程結果，本研究所提出之隨機優化演算法，可有效改善排程之效能。
This study considers the set-up time between products. However, due to the difficulty of disassembly and assembly, the set-up time is different. Therefore, the asymmetrical set-up time and production batches are considered in the production scheduling system. Due to the practical needs of orders emergency insertion and dual-type customers, this study proposes a Random Optimization Algorithm (ROA) to search for the optimal scheduling under three performance indicators on demand and compare the results under two initial scheduling methods. The results showed that ROA is better than the initial scheduling methods. The random optimization algorithm proposed by this study can effectively improve the production performance.
摘要 I
Abstract II
謝誌 III
目錄 IV
圖索引 VII
表索引 IX
1 緒論 1
1.1. 研究背景與動機 1
1.2. 研究目的 2
1.3. 研究限制 2
1.4. 研究流程及架構 2
2. 文獻探討 4
2.1. 排程情境 4
2.2. 啟發式演算法 5
2.3. 整備時間 7
2.4. 文獻差異比較 8
3. 研究方法與模式建構 10
3.1. 問題描述 10
3.2. 符號定義與說明 10
3.3. 總完工時間(Makespan) 12
3.3.1. 情境一：批量對於總完工時間之影響 13
3.3.2. 情境二：途程相同下，不考慮整備時間之總完工時間 17
3.3.3. 情境三：途程相同下，考慮整備時間之總完工時間 19
3.3.4. 情境四：途程不同下之總完工時間 24
3.4. 排程邏輯 30
3.5. 隨機優化演算法之建構 31
3.5.1. 選擇初始解 32
3.5.2. 計算績效指標之目標函數 32
3.5.3. 隨機優化演算法 32
3.5.4. 突變 33
3.5.5. 終止條件 33
3.6. VIP客戶 34
3.7. 臨時插單 35
3.8. 排程程式架構 35
4.案例模擬與應用 38
4.1. 模擬訂單案例 38
4.2. 排程系統介面 40
4.2.1. 主要排程系統介面 40
4.2.2. 新增臨時訂單 44
4.3. 模擬訂單之測試結果 45
4.3.1. 10筆訂單在各初解情況下之各績效指標測試結果 45
4.3.2. 20筆訂單在各初解情況下之各績效指標測試結果 47
4.3.3. 30筆訂單在各初解情況下之各績效指標測試結果 48
4.3.4. 小結 50
5.結論與建議 51
參考文獻 53
作者簡介 56
1. Bektur, G. and Saraç, T., A mathematical model and heuristic algorithms for an unrelated parallel machine scheduling problem with sequence-dependent setup times, machine eligibility restrictions and a common server, Computers and Operations Research, Vol. 103, 2019, pp. 46-63
2. Cheng, T. C. E., Ng, C. T. and Yuan, J. J., Single-machine scheduling of multi-operation jobs without missing operations to minimize the total completion time, European Journal of Operational Research, Vol. 191(2), 2008, pp. 320-331
3. Ching, W. K., A Production Model with Delivery Time Guarantees for Manufacturing Systems with Early Set-up, Computers & Industrial Engineering, Vol. 35(1-2), 1998, pp. 121-124
4. Kashan, A. H., Karimi, B. and Jolai, F., An effective hybrid multi-objective genetic algorithm for bi-criteria scheduling on a single batch processing machine with non-identical job sizes, Engineering Applications of Artificial Intelligence, Vol. 23(6), 2010, pp. 911-922
5. Lambert, S., Cyr, B., AbdulNour, G. and Drolet, J., Comparison study of scheduling rules and set-up polieies for a SMT production line, Computers & Industrial Engineering, Vol. 33(1-2), 1997, pp. 369-372
6. Liu, Z., Zhang, Y., Yu, M. and Zhou, X., Heuristic algorithm for ready-mixed concrete plant scheduling with multiple mixers, Automation in Construction, Vol. 84, 2017, pp. 1-13
7. ÖncüHazır., Agi, M.A.N. and Guérin, J., A fast and effective heuristic for smoothing workloads on assembly lines: algorithm design and experimental analysis, Computers and Operations Research, Vol. 115, 2020, pp. 104857
8. Parunak, V. D., Characterizing the manufacturing scheduling problem, Journal of Manufacturing Systems, Vol. 10(3), 1991, pp. 241-259.
9. Reddy, G.R., Singh, H., Domeika, A., Kumar, N. M. and Quanjin, M., Modelling of heuristic distribution algorithm to optimize flexible production scheduling in Indian industry, ScienceDirect, Vol. 167, 2020, pp. 1120-1127
10. Riahi, V., Newton, M. A. H., Polash, M. M. A. and Sattar, A., Tailoring customer order scheduling search algorithms, Computers and Operations Research, Vol. 108, 2019, pp. 155-165
11. Sherali, H. D., Goubergen, D. V. and Landeghem, H. V., A quantitative approach for scheduling activities to reduce set-up in multiple machine lines, European Journal of Operational Research, Vol. 187(3), 2008, pp. 1224-1237
12. Sung, C.S., Kim, Y. H. and Yoon, S. H., A problem reduction and decomposition approach for scheduling for a flow-shop of batch processing machines, European Journal of Operational Research, Vol. 121(1), 2000, pp. 179–192.
13. Wang, C. S., Uzsoy, R., A genetic algorithm to minimize maximum lateness on a batch processing machine, Computers and Operations Research, Vol. 29(12), 2002, pp. 1621–1640.
14. Wang, Y., Wang, L., Peng, Z., Chen, G. and Cai, Z., A Multi Ant System based hybrid heuristic algorithm for Vehicle Routing Problem with Service Time Customization, Swarm and Evolutionary Computation, Vol. 50, 2019, pp. 100563
15. Wang, Z., Qi, Y., Cui, H. and Zhang, J., A hybrid algorithm for order acceptance and scheduling problem in make to-stock/make-to-order industries, Computers & Industrial Engineering, Vol. 127, 2019, pp. 841-852
16. Wu, C. C., Yang, T. H., Zhang, X., Kang, C. C., Chung, I. H. and Lin, W. C., Using heuristic and iterative greedy algorithms for the total weighted completion time order scheduling with release times, Swarm and Evolutionary Computation, Vol. 44, 2019, pp. 913-926
17. Zhen, L., Ma, C., Xiao, L. and Zhang, W., Multi-depot multi-trip vehicle routing problem with time windows and release dates, Transportation Research Part E, Vol. 135, 2020, pp. 101866
