Research On SMT Shop Arrangement Optimization

The shop production arrangement problem is a pivotal problem of the production scheduling, and the most important way to improve the production efficiency. The purpose of this problem is fulfilling the production plan on time with assigning resources effectively. The shop production arrangement, a combinatorial optimization problem, has been solved by many kinds of optimized algorithm recently. However, the problem how to design and choose the best optimized algorithm for the practical production needs future study.Starting from introducing the goal and the present research of the shop production arrangement, this paper analyzes the significance of the problem, also introduces the optimized problem and its correlative optimized algorithm. The Genetic Algorithm (GA) is introduced in detail, specially its excellence, the basic thought, the elementary operation, and the parameter establishment. After researching the characteristic and the present situation of the SMT production workshop, a mathematical model and an objective function are proposed according to the fundamental research of the parallel-machine and the solution of the earliness/ tardiness (E/T) scheduling problem. On this foundation, coding with mix manner of job-flow shop, combining the genetic algorithm with heuristic algorithm, the paper designs an optimized algorithm for the objective function proposed above. At last, this work designs and achieves an emulational system for the shop production arrangement. The system can tell the manager about the condition, and will be able to solve the shop production arrangement problem.The work in this paper is just at the beginning stage, and it has not done the microscopic arrangement job. The multi-aim arrangement problem also needs to solve in the future.