| Summary: | 碩士 === 靜宜大學 === 企業管理研究所 === 98 === The scheduling is a very important issue in production management field. We investigate for the hybrid flow shop scheduling problem. The makespan is always one of the important criteria in the scheduling field. In order to reduce the makespan, the manufacturer set up parallel machines to increase the production efficiency. However, due to the cost of machines, not all the industries can invest a lot of costs on setting up parallel machines to increase the production. Therefore, the objective of this research is to develop an effective heuristic algorithm to find a good schedule for the hybrid three-stage flow shop scheduling problem to reduce makespans. We adopt the Genetic Algorithm (GA) for solving the hybrid flow shop scheduling problem and compare the schedule found by the GA with traditional dispatching rules such as FCFS, SPT, LPT, EDD… etc.. In the experimental results, the genetic algorithm can obtain superior solutions for the hybrid flow shop scheduling problem. We also find that the GA is most effective for the hybrid flow shop scheduling problem when the problem size is small.
|
|---|
