The improved genetic algorithm for the complex job-shop scheduling

Job shop scheduling problem is a typical NP-hard problem, most of the existing researches of job-shop scheduling have the following problems: firstly, took various processing parameters of the production systems as the exact uncertainty value; Secondly, took production system as a static system, ignored a variety of unexpected situations of the actual processing. This paper started from the actual demand of production operation and management of complex production environment, taking non-deterministic exact value, disturbance and other factors of the processing parameters in the production process into account, carried out the job-shop scheduling research question of a complex production environment based on improved genetic algorithm.