Research on Optimization of Job-Shop Operative Plan Based on Genetic Scheduling Algorithm

摘要

A job-shop scheduling problem is proved to be a NP-hard problem. Considering its complexity and its difficulty in solving, the methods of the traditional analysis optimization have been unable to solve these problems. A solution that combining Object-Oriented System Simulation and optimization algorithm is provided in this paper. A framework of job-shop scheduling simulation optimization system is suggested. The basic principles of genetic algorithm is expounded; The system is analyzed using UML mapped in eM-Plant simulation software, and its model parameters are optimized through genetic algorithm (GA) to get the ideal scheduling. An example is given to explain the system. This solution is easy and feasible .and provides a shortcut for this kind of complicated problem.