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/99063
完整後設資料紀錄
DC 欄位值語言
dc.contributor.advisor黃奎隆zh_TW
dc.contributor.advisorKwei-Long Huangen
dc.contributor.author廖昶勝zh_TW
dc.contributor.authorChang-Sheng Liaoen
dc.date.accessioned2025-08-21T16:14:43Z-
dc.date.available2025-08-22-
dc.date.copyright2025-08-21-
dc.date.issued2025-
dc.date.submitted2025-07-30-
dc.identifier.citation1. Akhtar, Muhammad Umair, Muhammad Huzaifa Raza, and Muhammad Shafiq. 2019. 'Role of batch size in scheduling optimization of flexible manufacturing system using genetic algorithm', Journal of Industrial Engineering International, 15: 135-46.
2. Andres, Carlos, Cristobal Miralles, and Rafael Pastor. 2008. 'Balancing and scheduling tasks in assembly lines with sequence-dependent setup times', European Journal of Operational Research, 187: 1212-23.
3. Bai, Danyu, Zhi-Hai Zhang, and Qiang Zhang. 2016. 'Flexible open shop scheduling problem to minimize makespan', Computers & Operations Research, 67: 207-15.
4. Behnamian, Javad, S Memar Dezfooli, and Hamed Asgari. 2021. 'A scatter search algorithm with a novel solution representation for flexible open shop scheduling: a multi-objective optimization', The Journal of Supercomputing, 77: 13115-38.
5. Castillo, Francisco, and Pedro Gazmuri. 2015. 'Genetic algorithms for batch sizing and production scheduling', The International Journal of Advanced Manufacturing Technology, 77: 261-80.
6. Chhajed, Dilip. 1995. 'A fixed interval due-date scheduling problem with earliness and due-date costs', European Journal of Operational Research, 84: 385-401.
7. Costa, Antonio, Fulvio Antonio Cappadonna, and Sergio Fichera. 2014. 'Joint optimization of a flow-shop group scheduling with sequence dependent set-up times and skilled workforce assignment', International Journal of Production Research, 52: 2696-728.
8. Kashan, Ali Husseinzadeh, and Behrooz Karimi. 2009. 'A discrete particle swarm optimization algorithm for scheduling parallel machines', Computers & Industrial Engineering, 56: 216-23.
9. Kuo, I-Hong, Shi-Jinn Horng, Tzong-Wann Kao, Tsung-Lieh Lin, Cheng-Ling Lee, Takao Terano, and Yi Pan. 2009. 'An efficient flow-shop scheduling algorithm based on a hybrid particle swarm optimization model', Expert systems with applications, 36: 7027-32.
10. Lee, Ik Sun. 2013. 'Minimizing total tardiness for the order scheduling problem', International Journal of Production Economics, 144: 128-34.
11. Liaw, Ching-Fang. 1999. 'A tabu search algorithm for the open shop scheduling problem', Computers & Operations Research, 26: 109-26.
12. Mashizi, Iman Khosravi, Vahid Momenaei Kermani, and Naser Shahsavari-Pour. 2022. 'Flexible open-shop problem for minimizing weighted total completion time', Journal of Intelligent & Fuzzy Systems, 42: 1353-66.
13. Mejía, Gonzalo, Juan Pablo Caballero-Villalobos, and Carlos Montoya. 2017. 'Petri nets and deadlock-free scheduling of open shop manufacturing systems', IEEE Transactions on Systems, Man, and Cybernetics: Systems, 48: 1017-28.
14. Mosheiov, Gur, and Daniel Oron. 2008. 'A single machine batch scheduling problem with bounded batch size', European Journal of Operational Research, 187: 1069-79.
15. Naderi, B, SMT Fatemi Ghomi, M Aminnayeri, and M Zandieh. 2011. 'A study on open shop scheduling to minimise total tardiness', International Journal of Production Research, 49: 4657-78.
16. Naderi, B, and M Zandieh. 2014. 'Modeling and scheduling no-wait open shop problems', International Journal of Production Economics, 158: 256-66.
17. Nattaf, Margaux, Christian Artigues, Pierre Lopez, Rosa Medina, Victor Parada, and Lorena Pradenas. 2015. "A batch sizing and scheduling problem on parallel machines with different speeds, maintenance operations, setup times and energy costs." In 2015 International Conference on Industrial Engineering and Systems Management (IESM), 883-91. IEEE.
18. Niu, Ben, Yunlong Zhu, Xiaoxian He, and Henry Wu. 2007. 'MCPSO: A multi-swarm cooperative particle swarm optimizer', Applied Mathematics and computation, 185: 1050-62.
19. Pan, Quan-Ke, Ponnuthurai N Suganthan, Tay J Chua, and TX Cai. 2010. 'Solving manpower scheduling problem in manufacturing using mixed-integer programming with a two-stage heuristic algorithm', The International Journal of Advanced Manufacturing Technology, 46: 1229-37.
20. Raman, N, FB Talbot, and RV Rachamadugu. 1989. 'Due date based scheduling in a general flexible manufacturing system', Journal of Operations Management, 8: 115-32.
21. Ramdania, DR, M Irfan, F Alfarisi, and D Nuraiman. 2019. "Comparison of genetic algorithms and Particle Swarm Optimization (PSO) algorithms in course scheduling." In Journal of Physics: Conference Series, 022079. IOP Publishing.
22. Scholl, Armin, Nils Boysen, and Malte Fliedner. 2013. 'The assembly line balancing and scheduling problem with sequence-dependent setup times: problem extension, model formulation and efficient heuristics', OR spectrum, 35: 291-320.
23. Sha, DY, and Cheng-Yu Hsu. 2006. 'A hybrid particle swarm optimization for job shop scheduling problem', Computers & Industrial Engineering, 51: 791-808.
24. Sha, DY, and Cheng-Yu Hsu. 2008. 'A new particle swarm optimization for the open shop scheduling problem', Computers & Operations Research, 35: 3243-61.
25. Shen, Liji, Stéphane Dauzère-Pérès, and Janis S Neufeld. 2018. 'Solving the flexible job shop scheduling problem with sequence-dependent setup times', European Journal of Operational Research, 265: 503-16.
-
dc.identifier.urihttp://tdr.lib.ntu.edu.tw/jspui/handle/123456789/99063-
dc.description.abstract本研究探討在考慮批量分割情境下,同時兼顧機台與人力技術水平的彈性開放式排程問題。在工具機主軸加工產業中,隨著現場逐漸採用高精度機台設備,機台的設定需具備專業技術與程式能力的人員進行操作。由於各機台的設定方式不同,人力技術水平成為影響排程的重要因素。此外,該產業製程間轉換的原物料體積龐大,加上每位客戶訂單數量不同,使得單筆訂單難以在同一時間內完成所有製程後統一移送至下一站。因此,本研究納入批量分割,允許訂單部分批次完成後即先行投入下一道加工製程,藉此縮短整體生產週期,提升生產效率與產能。為貼近實際生產情境,本研究更進一步考量機台維修時間,以及生產進行到一半時可能存在指定機台和已完工量之限制。
在上述條件限制下,由於該產業於生產過程中通常考量機台稼動率和準時交貨予客戶的表現,因此本研究設定之目標為最小化總延遲時間和總完工時間,並分別給予權重參數w_1和w_2。為有效求解此複雜排程問題,將使用混合整數規劃模型與啟發式演算法進行分析,透過比較兩種方法於不同規模、參數設定及交期條件下的求解表現,探討其優劣性與適用範圍,以解決加工廠之實務情境問題。
zh_TW
dc.description.abstractThis study examines an open shop scheduling problem that includes batch splitting, flexible use of machines, and operator skill levels. In the machine tool spindle machining industry, high-precision equipment requires setups by workers with specialized technical knowledge and programming skills. Because machine setups differ, operator skill becomes an important factor in scheduling. Additionally, large volumes of raw materials and varying customer order sizes make it difficult to complete all processes of an order simultaneously before moving to the next stage. Batch splitting is introduced to allow parts of an order to move to the next process once completed, reducing overall production time and improving efficiency and output.
To better represent real-world situations, this study also considers machine maintenance schedules and practical constraints, such as specific machine assignments and partially completed orders. Since the industry values high machine usage and timely deliveries, the study aims to minimize total tardiness and total completion time, and I use w_1 and w_2 to represent the weight parameters separately. To solve this scheduling problem effectively, the research uses both a mixed-integer programming model and a heuristic algorithm. By comparing the two methods under various conditions and delivery requirements, this study evaluates their performance and suitability for real machining workshop environments.
en
dc.description.provenanceSubmitted by admin ntu (admin@lib.ntu.edu.tw) on 2025-08-21T16:14:43Z
No. of bitstreams: 0
en
dc.description.provenanceMade available in DSpace on 2025-08-21T16:14:43Z (GMT). No. of bitstreams: 0en
dc.description.tableofcontents目次 ii
圖次 v
表次 vii
致謝 viii
摘要 x
Abstract xi
第一章 緒論 1
1.1研究背景 1
1.2研究動機與目的 2
1.3研究架構 4
第二章 文獻探討 6
2.1開放式生產排程 6
2.2彈性開放式生產排程 8
2.3批量分割 9
2.4人力資源 12
2.5混合整數規劃模型 13
2.6粒子群演算法 14
第三章 問題描述與數學模型 17
3.1問題描述 17
3.1.1彈性開放式生產排程 17
3.1.2機台和人力配置 18
3.1.3批量分割規則 19
3.1.4夾具更換條件和機台設定 20
3.1.5零件生產數量與交期 21
3.1.6機台停機保養 22
3.2問題假設與限制 23
3.3混合整數規劃模型之建構 24
3.4混合整數規劃求解範例與數值測試 29
3.4.1範例資料說明 29
3.4.2數值測試說明 35
3.4.3數值測試分析 37
第四章 啟發式演算法 38
4.1粒子群演算法 38
4.1.1指定機台工作的平均批量分割 39
4.1.2粒子群初始化與參數設定 40
4.1.3機台與人力模組 42
4.1.4交配與突變 45
4.2無考量批量分割 47
4.2.1不同問題規模探討 48
4.2.2考慮人力後的求解情形 51
4.3考量批量分割 54
4.3.1不同問題規模探討 54
4.3.2考慮人力後的求解情形 61
4.4實務案例 65
第五章 結論 69
5.1研究總結 69
5.2未來研究方向 70
參考文獻 71
附錄 74
附錄一.模型求解於小問題4種情境下的結果 74
附錄二.PSO求解於所有問題情境下的結果 75
附錄三.中、大型問題的人力機台對應表 77
附錄四.實務案例訂單資料 78
-
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.subjectParticle Swarm Optimization Algorithmen
dc.subjectMixed-Integer Linear Programmingen
dc.subjectManpower Resourcesen
dc.subjectBatch Splittingen
dc.subjectFlexible Open Shop Schedulingen
dc.title整合批量分割與人力資源之彈性開放式生產排程-以工具機主軸加工業為例zh_TW
dc.titleFlexible Open-Shop Scheduling with Considering Batch Split and Manpoweren
dc.typeThesis-
dc.date.schoolyear113-2-
dc.description.degree碩士-
dc.contributor.oralexamcommittee吳政翰;洪英超zh_TW
dc.contributor.oralexamcommitteeGen-Han Wu;Ying-Chao Hungen
dc.subject.keyword彈性開放式排程,批量分割,人力資源,混合整數規劃,粒子群演算法,zh_TW
dc.subject.keywordFlexible Open Shop Scheduling,Batch Splitting,Manpower Resources,Mixed-Integer Linear Programming,Particle Swarm Optimization Algorithm,en
dc.relation.page82-
dc.identifier.doi10.6342/NTU202503044-
dc.rights.note未授權-
dc.date.accepted2025-08-01-
dc.contributor.author-college工學院-
dc.contributor.author-dept工業工程學研究所-
dc.date.embargo-liftN/A-
顯示於系所單位:工業工程學研究所

文件中的檔案:
檔案 大小格式 
ntu-113-2.pdf
  未授權公開取用
2.11 MBAdobe 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