Study Of The Job Shop Sequencing Based On Heuristics Algorithm

The production mode of most manufacturing enterprises is turning to small batch along with the intense competition of the market, so the job shop sequencing problem has become a typical scheduling problem.Refere to the number of documents, the paper optimize the Job Shop sequencing model through analyzing the limition of original modle, and set up mathematical model which minimize the number of tardy jobs. The algorithm is used to choose the part when operations of different parts competing one machine and choose the machine when an operation of a part had more than one usable machine. The paper put forward an amelioration of the classical job shop scheduling problem to construct one new method of heuristic algorithm that can make the search region near the result, which can shorten the search time and improve efficiency of the work. On the same time, the method takes the balance of the same kind of machines into account and adjusts the quantity of the equipments with reason. That method improves the utilization of machine. At last, and the application of the algorithm to a plan is also presented as an example to illustrate the satisfactory results.To find a solution to sequencing of Job Shop problem, the paper provides a viable method through the medel constructed and solved. In a word, the paper is important to the practical production.