| Summary: | 碩士 === 中原大學 === 工業與系統工程研究所 === 101 === The main purpose of this thesis is to solve the flow shop scheduling problems in LCD manufacturing company. A heuristic algorithm is proposed to minimize both the idle time of machines and makespan. In order to evaluate the effectiveness of the heuristic, we compare it with Nawaz heuristic and CDS heuristic. Numerical experiments show that the heuristic provides a satisfactory result.
To compare each algorithm by minimum makespan, the result of experimentation shows that the new heuristic algorithm is the same as Nawaz algorithm (both 792sec), and is 18sec faster than CDS algorithm (810sec).
But in the progress by using Nawaz heuristic to calculate the best order scheduling, iterations increased because of the numerous equivalent results. On the contrary, new heuristic algorithm offers a more effective way by using CDS heuristic to replace Nawaz heuristic when the equivalent result appears, and earn the best result. In short, new heuristic algorithm is proved to be efficient by decreasing of iterations and minimum makespan.
|
|---|
