| Summary: | 碩士 === 中原大學 === 工業工程研究所 === 95 === This research explores the three-machines flow shop with machine eligibility and the main purpose is to develop the minimum makespan. The approaches include a optimization algorithm and one heuristic algorithm. The optimization algorithm is the branch and bound algorithm, and the heuristic is sequenced by Johnson’s rule at the beginning, then to make a shifting sequence of jobs according to the attributes, at last by comparing the completion time on machine 2 with machine 3 , to decide that if the shift is continuing. Experimental results show that the solution error is below 3%. In the end, the research points out that an optimal algorithm of special case is built when the process time of machine 2 is bigger than machine 3
|
|---|
