Hybrid Particle Swarm Optimization Algorithm In Inter Cell Scheduling Problem With Flexible Routes

speaking, the cellular manufacturing system contains two or more production cells. In the actual production process, because of the limitations of the production process, there are some parts which require two or more processing units working together to complete the case, this article we call those parts which need to produce in different cells exception parts. Based on the actual situation, I make a research the inter cell scheduling problem with flexible routes.Firstly, this paper describes the cellular manufacturing system and inter cell scheduling problem, then this paper propose the focus of this paper is inter cell scheduling problem with flexible routes by analyzing research situation.Afterward, this paper make a analysis and model about the inter cell scheduling problem which exits flexible routes, and compare with the current cell scheduling problem, then this paper propose the problem that there are many flexible routes when the exception parts begin to schedule, then the exception parts need to select one route to schedule.Afterward, this paper describes the hybrid particle swarm scheduling algorithm based on tabu algorithm, and proposes to solve the neighborhood solution by critical path, this paper compare the hybrid particle swarm algorithm with the particle swarm optimization algorithm to solve the inter cell scheduling problem with flexible routes, and compare the deviation of the optimal value, cpu time and machine load. Then the result shows that the hybrid particle swarm algorithm can effectively solve the inter cell scheduling problem with flexible routes.Finally, this paper introduced the workshop intelligent scheduling system software development, details of a branch of the system plan to the module on the function and detailed design.