Research And Analysis Of Flexible Flow Shop Scheduling Problem Based On Mechanism Design

Scheduling problem is a study that how to allocate the limited resources to multiple processing tasks in a certain time. Efficient scheduling algorithm can improve the competitiveness of enterprises and help enterprises to advance production rationality and effectiveness. Previous studies have indicated that the scheduling problem is NPHard, and the optimal solution cannot be obtained in polynomial time unless NP=P. Thus this paper design the corresponding optimization algorithms based on the intelligent optimization algorithm.Flexible flow shop scheduling problem is an important research branch of flow shop scheduling problem, and the biggest difference compared with the traditional scheduling problem is that the choice of parallel machines is required in the process of solving the problem that increases degree of difficulty. The research on flexible flow shop scheduling problem has the significance both on the theoretical research value and practical application value. Because of the feasible solution quality of the existing algorithm which needs to be further improved, an algorithm called Multy Search Mechanism Particle Swarm Optimization algorithm is proposed to solve the problem with the objective of minimizing the maximum completion time aiming at the flexible flow shop scheduling problem. The Multy Search Mechanism Particle Swarm Optimization algorithm based on particle swarm algorithm because of the excellent characteristics of strong search ability and minor parameters. In the algorithm, the NEH greedy search algorithm is introduced to optimize the processing sequence of the parallel machine because the performance of the current solving algorithm for optimizing the sequence of job processing. At the same time SA Disturb search algorithm expand the scope of the search further, Random Perturbation algorithm introduced in Multy Search Mechanism Particle Swarm Optimization algorithm help the particles to jump out of the local optimum. Experimental results show that the effectiveness and applicability of MMPSO algorithm are higher than other algorithms.However, the working process of some factories need a special processing requirement which must meet no-wait requirement in the processing, meanwhile they need to ensure that the different needs of both supply and demand. This paper propose Elite particle swarm optimization algorithm and Alliance Empire competition algorithm to solve the problem of no-waiting flexible flow shop scheduling problem with two targets above. Elite particle swarm optimization algorithm with the framework based on particle swarm optimization algorithm introduce Elite Crossover Algorithm to improve the quality of feasible solution and define the concept of “block” to keep a better continuity between jobs in the feasible solution. The main updating method of Empire competition algorithm with fast search speed and high quality of feasible solution is based on the evolution of multiple Empire group simultaneously. Therefore, the Alliance Empire competition algorithm made the Empire competition algorithm as an iterative model. At the same time algorithm introduced Imperial Marriage Algorithm and used a new revolutionary strategy in order to obtain a higher quality of the feasible solution. In the case of different size of the problem, the simulation experiment compared the six performance indicators, the performance of Elite particle swarm optimization algorithm and AICA in the experiment indicated that both of two algorithms can achieve a feasible solution with a higher quality and get better double objective optimization effect.Production scheduling problems inevitably involve the interests of both sides of supply and demand, and the participants tend to have rational and selfish behavior and lead that machine information provided by the participants is deceptive, so the concept of mechanism design is introduced to obtain the real information of the participants by designing the honest mechanism in this paper to make the scheduling result having authenticity and credibility. We design a flexible flow shop scheduling problem based on the honest mechanism algorithm in this paper and prove that the algorithm satisfies the honest mechanism and can be calculated in polynomial time.