Skip navigation

DSpace

機構典藏 DSpace 系統致力於保存各式數位資料(如:文字、圖片、PDF)並使其易於取用。

點此認識 DSpace
DSpace logo
English
中文
  • 瀏覽論文
    • 校院系所
    • 出版年
    • 作者
    • 標題
    • 關鍵字
    • 指導教授
  • 搜尋 TDR
  • 授權 Q&A
    • 我的頁面
    • 接受 E-mail 通知
    • 編輯個人資料
  1. NTU Theses and Dissertations Repository
  2. 工學院
  3. 工業工程學研究所
請用此 Handle URI 來引用此文件: http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/70287
完整後設資料紀錄
DC 欄位值語言
dc.contributor.advisor洪一?
dc.contributor.authorShao-Hao Changen
dc.contributor.author張少豪zh_TW
dc.date.accessioned2021-06-17T04:25:18Z-
dc.date.available2023-08-18
dc.date.copyright2018-08-18
dc.date.issued2018
dc.date.submitted2018-08-14
dc.identifier.citationAbyaneh, S. H., & Zandieh, M. (2012). Bi-objective hybrid flow shop scheduling with sequence-dependent setup times and limited buffers. The International Journal of Advanced Manufacturing Technology, 58(1-4), 309–325.
Afzalirad, M., & Rezaeian, J. (2016). Resource-constrained unrelated parallel machine scheduling problem with sequence dependent setup times, precedence constraints and machine eligibility restrictions. Computers & Industrial Engineering, 98, 40–52.
Attar, S., Mohammadi, M., & Tavakkoli-Moghaddam, R. (2013). Hybrid flexible flowshop scheduling problem with unrelated parallel machines and limited waiting times. The International Journal of Advanced Manufacturing Technology, 68(5-8), 1583–1599.
Baptiste, P. (2003). On minimizing the weighted number of late jobs in unit execution time open-shops. European Journal of Operational Research, 149(2), 344–354.
Bellanger, A., Hanafi, S., & Wilbaut, C. (2013). Three-stage hybrid-flowshop model for cross-docking. Computers & Operations Research, 40(4), 1109–1121.
Bierwirth, C., & Kuhpfahl, J. (2017). Extended grasp for the job shop scheduling problem with total weighted tardiness objective. European Journal of Operational Research, 261(3), 835–848.
Ebrahimi, M., Ghomi, S. F., & Karimi, B. (2014). Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates. Applied Mathematical Modelling, 38(9-10), 2490–2504.
Feng, X., Zheng, F., & Xu, Y. (2016). Robust scheduling of a two-stage hybrid flow shop with uncertain interval processing times. International Journal of Production Research, 54(12), 3706–3717.
Gholami, M., Zandieh, M., & Alem-Tabriz, A. (2009). Scheduling hybrid flow shop with sequence-dependent setup times and machines with random breakdowns. The International Journal of Advanced Manufacturing Technology, 42(1-2), 189–201.
Gourgand, M., Grangeon, N., & Norre, S. (2003). A contribution to the stochastic flow shop scheduling problem. European Journal of Operational Research,151(2),415–433.
Gupta, J., Hariri, A., & Potts, C. (1997). Scheduling a two-stage hybrid flow shop with parallel machines at the first stage. Annals of Operations Research, 69, 171–191.
Huang, W., & Li, S. (1998). A two-stage hybrid flowshop with uniform machines and setup times. Mathematical and Computer Modelling: An International Journal, 27(2), 27–45.
Koulamas, C., & Panwalkar, S. (2016). The proportionate two-machine no-wait job shop scheduling problem. European Journal of Operational Research, 252(1), 131–135.
Kyparisis, G. J., & Koulamas, C. (2006). Flexible flow shop scheduling with uniform parallel machines. European journal of operational research, 168(3), 985–997.
Mosheiov, G., & Oron, D. (2008). Open-shop batch scheduling with identical jobs. European Journal of Operational Research, 187(3), 1282–1292.
Mosheiov,G.,Sarig,A.,Strusevich,V.A.,&Mosheiff,J. (2018). Two-machine flow shop and open shop scheduling problems with a single maintenance window. European Journal of Operational Research.
Mousavi, S., Mousakhani, M., & Zandieh, M. (2013). Bi-objective hybrid flow shop scheduling: a new local search. The International Journal of Advanced Manufacturing Technology, 64(5-8), 933–950.
Ruiz, R., & Vázquez-Rodríguez, J. A. (2010). The hybrid flow shop scheduling problem. European journal of operational research, 205(1), 1–18.
Shabtay, D. (2012). The just-in-time scheduling problem in a flow-shop scheduling system. European Journal of Operational Research, 216(3), 521–532.
Shen, L., Dauzère-Pérès, S., & Neufeld, J. S. (2018). Solving the flexible job shop scheduling problem with sequence-dependent setup times. European Journal of Operational Research, 265(2), 503–516.
Smutnicki, C. (1998). A two-machine permutation flow shop scheduling problem with buffers. Operations-Research-Spektrum, 20(4), 229–235.
Tang, L., Liu, W., & Liu, J. (2005). A neural network model and algorithm for the hybrid flow shop scheduling problem in a dynamic environment. Journal of Intelligent Manufacturing, 16(3), 361–370.
Tang, L., & Zhang, Y. (2005). Heuristic combined artificial neural networks to schedule hybrid flow shop with sequence dependent setup times. In International symposium on neural networks (pp. 788–793).
Vila, I.R.,&Pascual, R.C. (2009). Ahybridflowshopmodelforanicecreamproduction scheduling problem. Journal of Industrial Engineering and Management, 2(1), 60–89.
Wang, S., & Liu, M. (2014). Two-stage hybrid flow shop scheduling with preventive maintenance using multi-objective tabu search method. International Journal of Production Research, 52(5), 1495–1508.
Yaurima, V., Burtseva, L., & Tchernykh, A. (2009). Hybrid flowshop with unrelated machines, sequence-dependent setup time, availability constraints and limited buffers. Computers & Industrial Engineering, 56(4), 1452–1463.
Zabihzadeh, S. S., & Rezaeian, J. (2016). Two meta-heuristic algorithms for flexible flow shop scheduling problem with robotic transportation and release time. Applied Soft Computing, 40, 319–330.
Zhang, X.-Y., & Chen, L. (2016). Heuristics for minimizing the total tardiness in a reentrant hybrid flow shop with non-identical machines in parallel. In Industrial engineering and engineering management (ieem), 2016 ieee international conference on (pp. 987–991).
Zhong, W.-y., & Lv, L.-h. (2014). Hybrid flowshop scheduling with interstage job transportation. Journal of the Operations Research Society of China, 2(1), 109–121.
Zhou, H., Cheung, W., & Leung, L. C. (2009). Minimizing weighted tardiness of job shop scheduling using a hybrid genetic algorithm. European Journal of Operational Research, 194(3), 637–649.
dc.identifier.urihttp://tdr.lib.ntu.edu.tw/jspui/handle/123456789/70287-
dc.description.abstract本論文研究一種混合型流程式生產排程問題其考慮非相關平行加工機台與順序相依整備時間。根據產線特性,我們提出兩種演算法。在相同的參數設定下,數值分析顯示總體訂單派工演算法在總完工時間,平均總訂單延遲,延遲訂單張數皆優於分群訂單派工演算法。最後討論未來研究延伸方向。zh_TW
dc.description.abstractIn this paper, we study a two-stage hybrid flow shop scheduling problem where unrelated parallel machines and sequence-dependent setup time are considered.We propose two algorithms based on the characteristics of the production line.Under the same parameter settings, our numerical results show that overall order dispatch (OODA) algorithm outforms clustered order dispatching (CODA) algorithm with respect to the makespan, average total tardiness, and the number of delayed orders.In the end, we discuss the future research directions.en
dc.description.provenanceMade available in DSpace on 2021-06-17T04:25:18Z (GMT). No. of bitstreams: 1
ntu-107-R05546038-1.pdf: 716413 bytes, checksum: 2e788e4040ef137d0e53dfad940fed49 (MD5)
Previous issue date: 2018
en
dc.description.tableofcontents誌謝 i
摘要 ii
Abstract iii
目錄 v
圖目錄 vi
表目錄 vii
1 緒論 1
2 方法論 7
2.1 問題描述 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7
2.1.1 生產線架構 . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7
2.1.2 各階段工作站加工機台生產性質 . . . . . . . . . . . . . . . . 7
2.1.3 工作生產性質 . . . . . . . . . . . . . . . . . . . . . . . . . . . 8
2.1.4 訂單生產性質 . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
2.2 總體訂單派工演算法 . . . . . . . . . . . . . . . . . . . . . . . . . . . 10
2.2.1 總體訂單派工演算法集合 . . . . . . . . . . . . . . . . . . . . 11
2.2.2 總體訂單派工演算法參數 . . . . . . . . . . . . . . . . . . . . 11
2.2.3 總體訂單派工演算法變數 . . . . . . . . . . . . . . . . . . . . 12
2.3 分群訂單派工演算法 . . . . . . . . . . . . . . . . . . . . . . . . . . . 14
2.3.1 分群訂單派工演算法集合 . . . . . . . . . . . . . . . . . . . . 14
2.3.2 分群訂單派工演算法參數 . . . . . . . . . . . . . . . . . . . . 15
2.3.3 分群訂單派工演算法變數 . . . . . . . . . . . . . . . . . . . . 15
2.4 時間計算 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16
3 個案分析 20
3.1 績效指標 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20
3.2 參數設定 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21
3.3 結果比較 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 23
3.4 敏感度分析 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 23
3.4.1 針對需求量 . . . . . . . . . . . . . . . . . . . . . . . . . . . . 23
3.4.2 針對交期 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 24
3.4.3 針對第一階段加工處理時間 . . . . . . . . . . . . . . . . . . . 25
3.4.4 針對第二階段加工處理時間 . . . . . . . . . . . . . . . . . . . 26
3.4.5 針對第一階段順序相依整備時間 . . . . . . . . . . . . . . . . 27
3.4.6 針對第二階段順序相依整備時間 . . . . . . . . . . . . . . . . 28
4 結論與未來方向 30
References 32
參考文獻 32
dc.language.isozh-TW
dc.subject混合型流程式生產zh_TW
dc.subject順序相依整備時間zh_TW
dc.subject平均總訂單延遲zh_TW
dc.subject總完工時間zh_TW
dc.subject總延遲訂單張數zh_TW
dc.subject非相關平行加工機台zh_TW
dc.subjectNumber of delayed ordersen
dc.subjectUnrelated parallel machinesen
dc.subjectSequence-dependent setup timeen
dc.subjectMakespanen
dc.subjectAverage total tardinessen
dc.subjectHybrid flow shopen
dc.title非相關平行加工機台與順序相依整備時間之混合型流程式生產排程zh_TW
dc.titleHybrid Flow Shop Scheduling with Unrelated Parallel Machines and Sequence-dependent Setup Timeen
dc.typeThesis
dc.date.schoolyear106-2
dc.description.degree碩士
dc.contributor.oralexamcommittee藍俊宏,陳文智
dc.subject.keyword混合型流程式生產,非相關平行加工機台,順序相依整備時間,總完工時間,平均總訂單延遲,總延遲訂單張數,zh_TW
dc.subject.keywordHybrid flow shop,Unrelated parallel machines,Sequence-dependent setup time,Makespan,Average total tardiness,Number of delayed orders,en
dc.relation.page35
dc.identifier.doi10.6342/NTU201803408
dc.rights.note有償授權
dc.date.accepted2018-08-15
dc.contributor.author-college工學院zh_TW
dc.contributor.author-dept工業工程學研究所zh_TW
顯示於系所單位:工業工程學研究所

文件中的檔案:
檔案 大小格式 
ntu-107-1.pdf
  未授權公開取用
699.62 kBAdobe PDF
顯示文件簡單紀錄


系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。

社群連結
聯絡資訊
10617臺北市大安區羅斯福路四段1號
No.1 Sec.4, Roosevelt Rd., Taipei, Taiwan, R.O.C. 106
Tel: (02)33662353
Email: ntuetds@ntu.edu.tw
意見箱
相關連結
館藏目錄
國內圖書館整合查詢 MetaCat
臺大學術典藏 NTU Scholars
臺大圖書館數位典藏館
本站聲明
© NTU Library All Rights Reserved