Bandwidth Restricted Transmission-Simulated Discrete Optimization Algorithm for Job Shop Scheduling Problems

• Main Authors: Yu-Nien Chen, 陳昱年
• Other Authors: Feng-Cheng Yang
• Format: Others
• Language: zh-TW
• Published: 2012
• Online Access: http://ndltd.ncl.edu.tw/handle/36845768736248384392

碩士 === 國立臺灣大學 === 工業工程學研究所 === 100 === This research presents a meta-heuristic algorithm called “Bandwidth Restricted Transmission-Simulated Discrete Optimization Algorithm for Job Shop Scheduling Problem” (BRT-S4JSP) for solving Job Shop Scheduling Problem (JSP). BRT-S imitates the behavior of data transmission in the network and simulates messengers transmit messages. Messengers select the communication links and constructive a complete route under the restriction of resources. BRT-S simulates that links are subject to operations of natural deterioration and enhancement/deduction/modulation. Based on the original BRT-S computational flow, BRT-S4JSP conducts the computational flow of JSP. BRT-S is designed for solving discrete optimization problems. We develop BRTSOS4JSP solving system for Job Shop Scheduling Problem through programming language. By using the benchmark of JSP from OR-library, we compare results with other meta-heuristic algorithm then verify the feasibility of BRT-S4JSP. In the example for JSP, BRT-S can obtain optimal solutions and use less objective function evolution than others. BRT-S4JSP can obtain better solutions under the same stop criteria. This research proves BRT-S4JSP is a good meta-heuristic algorithm for Job Shop Scheduling Problems.