Bandwidth Restricted Transmission-Simulated Discrete Optimization Algorithm for Job Shop Scheduling Problems
Date Issued
2012
Date
2012
Author(s)
Chen, Yu-Nien
Abstract
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.
Subjects
Meta-heuristic Algorithm
Job Shop Scheduling problems
Scheduling
Bandwidth Restricted Transmission-Simulated Optimization Algorithm
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-101-R99546032-1.pdf
Size
23.54 KB
Format
Adobe PDF
Checksum
(MD5):fc245d0ac84728feccc1cce688e36bfa