Solving Flow Shop Group Scheduling Problem by Tabu Search

• Main Authors: Chia-Tang Wu, 吳家塘
• Other Authors: Pei-Chann Chang
• Format: Others
• Language: zh-TW
• Online Access: http://ndltd.ncl.edu.tw/handle/15700615078919887085

碩士 === 元智大學 === 工業工程研究所 === 86 === This research addresses the group scheduling in a flowhsop environment using Tabu search. In most real world manufacturing environment, multi-stage scheduling is adopted for most industry. This problem is proved to be NP-complete and therefore lots of computations are required for achieving the optimal solution. The procedure developed in this research is divided into two stages. At the first stage, a heuristic algorithm is developed to find an initial schedule for group scheduling. At the second stage, the initial job is disturbed and different schedules is therefore produced. The approach that tabu search employed is to keep a list of our last few moves through the short-term scheme in tabu list. Before reaching the local optimum the neighborhood procedure incorporated with the moving path will improve the solution and force diversification to the optimal solution in a short elapsed time. The procedure is continued until the termination rules is reached and therefore the makespan is decreased. Experimental results show that the proposed tabu search improves the overall average quality from 2.81% to 12.34% and the insert move is compared favorably with the swap move term of average quality improvement in the exchanging rules of tabu search.