Design And Implementation Of An Algorithm On Solving The Flexible Job Shop Scheduling Problem

With the development of society, in manufacturing, to adapt the competition of themarket and the individuation and diversification of the customer requirement, a mode ofproduction which is multi-species and small quantities was accepted by the most ofmanufacturers. In this discrete mode of production, it is easy to get some problems, suchas production delays, low-quality and high cost, etc. Therefore, how to get a practicalscheme about finishing all orders in a low-cost becomes one of the most importantproblems of business managers.The Flexible Job-shop Scheduling Problem is the right problem, about how to get asolution of finishing all jobs in a shorter time, under the situation of multi-jobs, complexoperations and fixed number of machines. In this paper, to solve this problem, firstly,describe the current research status. Secondly, introduce in detail about the principles,ideas, and operations of genetic algorithm. And then, propose and implement a neweffective hybrid genetic algorithm (EHGA) solving the flexible job-shop schedulingproblem, and design a more advanced operation of Double-rate Mutation and a localsearch algorithm. Finally, prove the effectiveness and advanced of the algorithm by thesimilar result.Ultimately, the new hybrid genetic algorithm enhances the efficiency of the generalgenetic algorithm solving the flexible job-shop scheduling problem. Do a good job insolving the contradiction among the cost of production, the production cycle and thebenefits. Get a better result and achieve the research objectives.