請用此 Handle URI 來引用此文件：
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/61200完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.advisor | 楊烽正(Feng-Cheng Yang) | |
| dc.contributor.author | Guan-Cing Jiang | en |
| dc.contributor.author | 江冠慶 | zh_TW |
| dc.date.accessioned | 2021-06-16T10:52:40Z | - |
| dc.date.available | 2018-11-05 | |
| dc.date.copyright | 2013-11-05 | |
| dc.date.issued | 2013 | |
| dc.date.submitted | 2013-08-09 | |
| dc.identifier.citation | Chin Soon Chong, Malcolm Yoke Hean Low, Appa Iyer Sivakumar, and Kheng Leng Gay, 'A Bee Colony Optimization Algorithm to Job Shop Scheduling', Simulation Conference, WSC 06. Proceedings of the Winter, 1954-1961 (2006).
Alberto Colorni, Marco Dorigo, Vittorio Maniezzo, and Marco Trubian, 'Ant System for Job-Shop Scheduling', Belgian Journal of Operations Research, Statistics and Computer Science (1994). Federico Della Croce, Roberto Tadei, and Giuseppe Volta, 'A Genetic Algorithm for the Job Shop Problem', Computers Ops Res., 22 (1), 15-24 (1995). L. Davis, 'Job Shop Scheduling with Genetic Algorithms', Proceedings of the 1st International Conference on Genetic Algorithms L. Erlbaum Associates Inc., 136-140 (1985). Marco Dorigo, and Luca Maria Gambardella, 'Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem', IEEE Transactions on Evolutionary Computation, 1 (1) (1997). Matsuo Hisayuki, Suh Chang Juck, and Robert S. Sullivan, 'A Controlled Search Simulated Annealing Method for the General Job Shop Scheduling Problem', Working paper 03-04-88, Graduate School of Business, University of Texas, Austin (1988). Shyh Chang Lin, Erik D. Goodman, and III William F. Punch, 'A Genetic Algorithm Approach to Dynamic Job Shop Scheduling Problems', Genetic Algorithms Research and Applications Group 230 Engineering Building Michigan State University (1997). Noureddine Liouane, Ihsen Saad, Slim Hammadi, and Pierre Borne, 'Ant Systems & Local Search Optimization for Flexible Job Shop Scheduling Production', International Journal of Computers, Communications & Control, 2 (2), 174-184 (2007). Monaldo Mastrolilli, and Luca Maria Gambardella, 'Effective Neighborhood Function for the Flexible Job Shop Problem', Technical Report n. IDSIA-45-48 (1998). Dell'amico Mauro, and Trubian Marco, 'Applying Tabu Search to the Job-Shop Scheduling Problem', Annals of Operations Research, 41 (3), 231-252 (1993). John F. Muth, and Gerald L. Thompson, 'Probabilistic Learning Combinations of Local Job-Shop Scheduling Rules', Industrial Scheduling, PrenticeHall, Englewood Cliffs, 225 – 251 (1963). Ranga Ramasesh, 'Dynamic Job Shop Scheduling: A Survey of Simulation Research', Omega Int. J. of Mgmt Sci., 18 (1), 43-57 (1989). Johannes Marius Jacobus Schutten, 'Practical Job Shop Scheduling', Annals of Operations Research, 83, 161–177 (1998). D.Y. Sha, and C.Y. Hsu, 'A Hybrid Particle Swarm Optimization for Job Shop Scheduling Problem', Computers & Industrial Engineering, 51 (4), 791-808 (2006). Thomas Stutzle, and Holger H. Hoos, 'Max-Min Ant System', Future Generation Computer Systems, 16, 889–914 (2000). John Wiley, Software Testing. Vol. http://dl.acm.org/citation.cfm?id=519642 (1999). Li Ning Xing, Ying Wu, Chen Peng Wang, Qing Song Zhao, and Jian Xiong, 'A Knowledge-Based Ant Colony Optimization for Flexible Job Shop Scheduling Problems', Applied Soft Computing, 10, 888–896 (2009). Feng-Cheng Yang, and Yon-Chun Chou, 'Superior/Inferior Segment-Discriminated Ant System for Combinatorial Optimization Problems', Computers & Industrial Engineering, 57 (2), 475-495 (2008). Rong Zhou, A.Y.C. Nee, and Heow Pueh Lee, 'Performance of an Ant Colony Optimisation Algorithm in Dynamic Job Shop Scheduling Problems', International Journal of Production Research, 47 (11), 2903-2920 (2009). | |
| dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/61200 | - |
| dc.description.abstract | 本研究承襲零工式生產排程問題並定義一全新「多型態零工式生產排程問題」(Polymorphic Job Shop Scheduling Problem)，並運用「蟻拓優化演算法」(Ant Colony Optimization Algorithm)，提出「蟻拓優化演算法應用於多型態零工式生產排程問題」(Ant Colony Optimization Algorithm for Polymorphic Job Shop Scheduling Problem, ACO4PJSP)。隨著時代的進步，典型的零工式生產排程問題已經不符合實際排程上的需求，雖然近年來不斷的有學者提出零工式生產排程的相關變型問題，但無法涵蓋到所有可能的排程情況，本研究定義PJSP問題，考慮許多實際排程上可能面臨的情況，並代入軟體測試公司的實際排程案例，以驗證PJSP的可行性與合理性。由於典型的JSP與PJSP皆為一NP-Hard問題，所以本研究利用「蟻拓優化演算法」，可在短時間內得到不錯的解以提供排程的決策。研究結果顯示，ACO4PJSP不但可針對不同的狀況選擇不同的求解目標，亦可求解軟體測試公司的實際排程案例。證明ACO4PJSP是適合求解複雜情況下的排程問題。 | zh_TW |
| dc.description.abstract | This research defines a scheduling problem called “Polymorphic Job Shop Scheduling Problem” (PJSP). PJSP is a new problem originated from “Job Shop Scheduling Problem” (JSP). Different from JSP, many real world scheduling conditions are considered in PJSP. Though our literature survey shows none of the transformed JSP problems developed in recent studies are similar to PJSP, both JSP and PJSP are NP hard problems. In this research, a method based on “Ant Colony Optimization Algorithm” (ACO) to solve PJSP is developed and named as “Ant Colony Optimization Algorithm for Polymorphic Job Shop Scheduling Problem” (ACO4PJSP). In this study, two scheduling examples from software testing companies are tested by ACO4PJSP, proving that our developed ACO4PJSP is capable for solving two different scheduling examples based on different objectives and many scheduling conditions. | en |
| dc.description.provenance | Made available in DSpace on 2021-06-16T10:52:40Z (GMT). No. of bitstreams: 1 ntu-102-R00546030-1.pdf: 4277240 bytes, checksum: d6be0f50ddc5567e1391fb968f5486e9 (MD5) Previous issue date: 2013 | en |
| dc.description.tableofcontents | 摘要 i
Abstract ii 目錄 iii 圖目錄 v 表目錄 vi 第1章 緒論 1 1.1 研究動機 1 1.2 研究目的 1 1.3 研究方法與流程 2 1.4 章節概要 2 第2章 文獻探討 4 2.1 蟻拓優化演算法 4 2.1.1蟻拓優化演算法的歷史 4 2.1.2蟻拓優化演算法的演算流程 4 2.2 零工式生產排程問題及其變型 6 2.2.1零工式生產排程問題 6 2.2.2動態零工式生產排程問題 8 2.2.3彈性零工式生產排程問題 8 2.2.4實際零工式生產排程問題 8 2.2.5生產排程問題的綜合比較 9 2.3 軟體測試的排程問題 10 第3章 蟻拓優化演算法應用於多型態零工式生產排程問題 11 3.1多型態零工式生產排程問題 11 3.1.1零工式生產排程問題 11 3.1.2多型態零工式生產排程問題 12 3.2蟻拓優化演算法應用於多型態零工式生產排程問題的演算流程 17 3.2.1 ACO4PJSP的費洛蒙及啟發項設計 17 3.2.2 ACO4PJSP的求解流程 21 第4章 蟻拓優化演算法應用於多型態零工式生產排程問題的求解系統與範例驗證 31 4.1多型態零工式生產排程的標竿問題 31 4.2 ACO4PJSP的求解系統 32 4.2.1使用者介面 33 4.2.2 PJSP標竿問題產生器 38 4.2.3自動更新迄今最佳解功能 41 4.3範例測試 42 4.3.1完工時限對於求解目標的影響 42 4.3.2軟體公司的軟體測試排程案例 47 第5章 結論與未來研究建議 57 5.1結論 57 5.2未來研究建議 58 參考文獻 59 附錄一 62 附錄二 67 附錄三 69 附錄四 73 | |
| dc.language.iso | zh-TW | |
| dc.subject | 零工式生產排程 | zh_TW |
| dc.subject | 蟻拓優化演算法 | zh_TW |
| dc.subject | 多型態零工式生產排程 | zh_TW |
| dc.subject | 軟體測試 | zh_TW |
| dc.subject | Software Testing | en |
| dc.subject | Job Shop Scheduling Problem | en |
| dc.subject | Polymorphic Job Shop Scheduling Problem | en |
| dc.subject | Ant Colony Optimization Algorithm | en |
| dc.title | 蟻拓優化演算法應用於多型態零工式生產排程問題 | zh_TW |
| dc.title | Ant Colony Optimization Algorithm for Polymorphic Job Shop Scheduling Problems | en |
| dc.type | Thesis | |
| dc.date.schoolyear | 101-2 | |
| dc.description.degree | 碩士 | |
| dc.contributor.oralexamcommittee | 蔡瑞煌(Rui-Huang Cai),羅士哲(Shi-Zhe Luo),洪一薰(Yi-Xun Hong) | |
| dc.subject.keyword | 蟻拓優化演算法,零工式生產排程,多型態零工式生產排程,軟體測試, | zh_TW |
| dc.subject.keyword | Ant Colony Optimization Algorithm,Job Shop Scheduling Problem,Polymorphic Job Shop Scheduling Problem,Software Testing, | en |
| dc.relation.page | 75 | |
| dc.rights.note | 有償授權 | |
| dc.date.accepted | 2013-08-09 | |
| dc.contributor.author-college | 工學院 | zh_TW |
| dc.contributor.author-dept | 工業工程學研究所 | zh_TW |
| 顯示於系所單位： | 工業工程學研究所 | |
文件中的檔案：
| 檔案 | 大小 | 格式 | |
|---|---|---|---|
| ntu-102-1.pdf 未授權公開取用 | 4.18 MB | Adobe PDF |
系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。