| In the manufacturing system,process planning and shop scheduling are very important components,which affect the productivity of the production process and equipment utilization.In the actual production environment,they are generally independent of each other.This independent serial operation mode greatly limits the manufacturing capacity of the manufacturing system,resulting in insufficient resource utilization,reduced productivity and other phenomenen.Integration of Process Planning and Scheduling(IPPS)can effectively improve resource utilization and production efficiency and reduce costs.Through in-depth study of the characteristics of IPPS,the author proposed the neighborhood structure and evaluation strategy of the corresponding problem,and used hybrid colonial competition algorithm(HCCA)and local search strategy to solve the single Target FJSP,single target IPPS and multi-target IPPS issues.Finally got the best plan for these Problems.In the second chapter,the author constructed the FJSP problem model with the goal of minimizing the maximum makespan,and solved the problem by combining the colonial competition algorithm with tabu search.According to the characteristics of FJSP problem,the author designed the coding and decoding scheme and applied Jaya iteration to the empire assimilation operation,and introduced two efficient neighborhood structures M.G neighborhood and N7 neighborhood to improve the search efficiency of tabu search.The proposed algorithm is used to solve the famous FJSP benchmark problem,which shows that the proposed algorithm surpasses the current literature in quality,and the experimental results prove the effectiveness and superiority of the proposed algorithm.In the third chapter,the author constructed an IPPS problem model with the goal of minimizing the maximum makespan,proposed a two-layer neighborhood search strategy,and fuses it with the colonial competition algorithm to solve the IPPS problem.On the basis of the second chapter,the algorithm designs empire initialization,assimilation,competition and other operations according to the characteristics of IPPS problem.At the same time,a flexible neighborhood structure based on process sequence is proposed to expand the insertion space of local search.A local search algorithm of two-layerneighborhood search is designed and combined with the colonial competition algorithm.The results of maximum makespan obtained by using the benchmark problem tests are all better than the results of the current literatures,which show the superiority of the proposed algorithm.In the forth chapter,the author studied the multi-objective problem of IPPS based on the minimum maximum makespan,the maximum machine workload(MMW)and the total workload of machines(TMW).The author proposed a multi-objective hybrid colonial competition algorithm to solve the IPPS problem,which is based on the multi-objective Pareto optimization theory,introduced a variety of local search strategies for different targets,combined with the colonial competition algorithm,obtaind the front solution by non-dominant sorting,and used the grey relational degree method to select the satisfactory scheduling solution from the Pareto solution set.In the end,the author summarized the whole thesis and maked prospects of the thesis. |
