跳到主要內容

臺灣博碩士論文加值系統

(100.28.0.143) 您好!臺灣時間:2024/07/14 23:27
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

: 
twitterline
研究生:陳信容
研究生(外文):CHEN, XIN-RONG
論文名稱:應用啟發式和模擬退火法於單機三準則多類別客戶訂單工作件問題之研究
論文名稱(外文):Solving the single-machine three-criteria multi-class and customer order scheduling problem by using heuristics and simulated annealing algorithm
指導教授:吳進家吳進家引用關係林文欽林文欽引用關係
指導教授(外文):WU, CHIN-CHIALIN, WIN-CHIN
口試委員:吳文祥鄭舜仁
口試委員(外文):WU, WEN-HSIANGCHENG, SHUENN-REN
口試日期:2022-06-08
學位類別:碩士
校院名稱:逢甲大學
系所名稱:統計學系統計與精算碩士班
學門:數學及統計學門
學類:統計學類
論文種類:學術論文
論文出版年:2022
畢業學年度:110
語文別:中文
論文頁數:39
中文關鍵詞:排序模擬退火客戶訂單多個工作類別三項標準
外文關鍵詞:Sequencingsimulated annealingmultiple job classestri-criteria
相關次數:
  • 被引用被引用:0
  • 點閱點閱:116
  • 評分評分:
  • 下載下載:23
  • 收藏至我的研究室書目清單書目收藏:0
多種作業類別排序解決一組多類別工作件工作排序問題,其中每個類別中的所有作業接連著來一起操作則可以減少機器的設置時間。另一方面,具有單一準則的客戶訂單調度問題著重於同時完成同一訂單中的所有作業以降低其運輸與持有成本。
鑑於目前學術界對多種類別工作件排序問題的相關研究相當有限,本研究探討一個單機上的三準則多類別工作件客戶訂單調度,主要目標是考慮最小化最大完工時間、所有作業的總完成時間以及所有訂單持有成本的線性組合。由於此一的問題屬於困難且十分複雜(NP-hard),所以使用分支定界法結合本文所出的下界和屬性來尋找最佳調度。同時本文提出三種局部搜索方法與改進的六種算法,並更進一步使用這六種啟發式的解作為初始種子的六種模擬退火算法。最後,也評估了所提出算法的測試模擬結果。
Multiple job category sequencing addresses a set of multi-category work pieces, where all jobs in each category operate in tandem to reduce machine setup time. On the other hand, the customer order scheduling problem with a single criterion focuses on completing all the jobs in the same order at the same time to reduce its transportation and holding costs.
In view of the fact that the current academic research on the sorting of multiple types of workpieces is quite limited, this study discusses the three-criteria multi-type workpiece customer order scheduling on a single machine. The main goal is to minimize a linear combination of the maximum completion time, the total completion time of all jobs and all order holding costs. Since this problem is difficult and very complex (NP-hard), the branch and bound method is used in combination with the lower bounds and properties presented in this paper to find the optimal schedule. At the same time, this paper proposes six improved algorithms based on three local search methods, and further uses the six heuristic solutions as initial seeds for a simulated annealing algorithm. Finally, the test simulation results of the proposed algorithm are also evaluated.

第一章 緒論
第二章 研究問題介紹
第一節 符號說明
第二節 問題定義
第三節 範例介紹
第四節 凌越性質與下界
第三章 演算法介紹
第一節 啟發式演算法
第二節 模擬退火法
第三節 分支定界法
第四章 模擬結果與分析
第一節 小工作件的實驗結果分析
第二節 大工作件的實驗結果分析
第五章 結論與未來研究方向
英文文獻
中文文獻
附錄


Allahverdi, A., Gupta, J.N.D., Aldowaisan, T. (1999). A review of scheduling research involving setup considerations. Omega, 27 (2): 219-239.
Allahverdi, A., Ng, C.T., Cheng, T.C.E, Kovalyov, M.Y. (2008). A survey of scheduling problems with setup times or Costs. European Journal of Operational Research, 187(3): 985-1032.
Della Croce, F., Narayan, V., Tadei, R. (1996). The two-machine total completion time flow shop problem. European Journal of Operational Research, 90: 227-237.
Dileepan, P., Sen, T. (1988). Bicriterion static scheduling research for a single machine. Omega 16, 53-59.
Erel, E., Ghosh, J.B. (2007). Customer order scheduling on a single machine with family setup times: Complexity and algorithms. Applied Mathematics and Computation, 185: 11-18.
Framinan, J.M., Perez-Gonzalez, P., Fernandez-Viagas, V. (2019). Deterministic assembly scheduling problems: A review and classification of concurrent-type scheduling models and solution procedures. European Journal of Operational Research, 273401- 417.
Fry, T.D., Armstrong, R.D., Lewis, H. (1989). A framework for single machine multiple objective sequencing research. Omega 17: 595 - 607.
Gupta, J.N.D., Ho, J.C., van der Veen, J.A. (1997). Single machine hierarchical scheduling with customer orders and multiple job classes. Annals of Operations Research, 70: 127 - 143.
Hsu, S.Y., Liu, C.H. (2009). Improving the delivery efficiency of the customer order scheduling problem in a job shop. Computers and Industrial Engineering, 57: 856 - 866.
Kirkpatrick, S., Gellat, C.D., Vecchi, M.P. (1983). Optimization by simulated annealing algorithm. Science, 220: 671-680.
Kim, S. C., and P. M. Bobrowski. (1997). Scheduling jobs with uncertain setup times and sequence dependency. Omega, 25(4): 437–447.
Kovalenko, Y.V., Zakharov, A.O. (2020). The pareto set reduction in bicriteria customer order scheduling on a single machine with setup times, in: Journal of Physics: Conference Series, IOP Publishing. p. 012087.
Liaee, M.M., Emmons, H. (1997). Scheduling families of jobs with setup times. International Journal of Production Economics, 51(3): 165 -176.
Liao, C.J. (1993). Tradeoff between setup times and carrying costs for finished items. Computers & operations research, 20: 697- 705.
Lin, B. M. T., Yin, P. Y., Liu, Y. S. (2013). Sequence-dependent scheduling with order deliveries. Applied Mathematics and Computation, 222: 58-71.
Lin, B.M.T. and Kononov, A.V. (2007). Customer order scheduling to minimize the number of tardy jobs. European Journal of Operational Research,183(2): 944-948.
Liu, C.H. (2009). Lot streaming for customer order scheduling problem in job shop environments. International Journal of Computer Integrated Manufacturing, 22(9): 890–907.
Liu, C.H. (2010). A coordinated scheduling system for customer orders scheduling problem in job shop environments. Expert Systems with Applications, 37: 7831–7837.
Shi, Z., Wang, L., Liu, P., Shi, L., (2017). Minimizing completion time for order scheduling: formulation and heuristic algorithm. IEEE Transactions on Automation Science and Engineering, 14(4): 1558–1569.
Shi, Z. Huang, Z., Shi, L. (2018). Customer order scheduling on batch processing machines with incompatible job families. International Journal of Production Research, 56(1–2): 795–808.
Suma, T., Murugesan, R. (2019). Mathematical model and heuristic based subtask scheduling algorithm for order scheduling. AIP Conference Proceedings 2095, 030026-1–030026-9.
Suerie, C. (2006). Modeling of period overlapping setup times. European Journal of Operational Research, 174(2): 874-886.
Suerie, C., Stadtler, H. (2003). The capacitated lot-sizing problem with linked lot-sizes. Management Science, 49: 1039-1054.
van Donk, D.P. and van Doorne, R. (2016). The impact of the customer order decoupling point on type and level of supply chain Integration. International Journal of Production Research, 54(9): 2572–2584.
Xu, X., Ma, Y., Zhou, Z., Zhao, Y. (2015). Customer order scheduling on unrelated parallel machines to minimize total completion time. IEEE Transactions on Automation Science and Engineering, 12(1): 244–257.
Yang, W.H. (1999). Survey of scheduling research involving setup times. International Journal of Systems Science, 30(2): 143-155.
Yang, J. (2011). Customer order scheduling in a two machine flowshop. International Journal of Management Science, 17(1): 95–116.
Ying, K.C., Pourhejazy, P., Cheng, C.Y., Syu, R.S. (2020). Supply chain-oriented permutation flowshop scheduling considering flexible assembly and setup times. International Journal of Production Research, doi.org/ 10.1080/ 00207543.2020. 1842938.
Zangwill, W.I. (1987). From EOQ towards ZI. Management Science ,33; 1209 -1223.
Zhao, Y., Xu, X., Li, H., Liu, Y. (2018). Stochastic customer order scheduling with setup times to minimize expected cycle time. International Journal of Production Research, 56(7): 2684–2706.

QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top