The Study On Flexible Resources Job Shop Scheduling Based On Genetic Algorithm

As a popular research realm in manufacture system, Job Shop Scheduling (JSP) is one of the most difficult problems in theoretic. The main task in scheduling, in terms of produce target and constraints, is to determine the precise process route, time, machine and operation et al for every process object. An eminent scheduling strategy can improve the optimization and economic efficiency of produce system.The insufficiency of resources in the shop floor holds back the accomplishment of production plans. In a sense, whether the enterprise can survive market competition is determined by whether it can meet customers' demands in time, which is further determined by how efficiently the limited resources are used. The assignment of a schedule is that according to produce goal and restriction to arrange the detailed process line, time, machine and operation etc. Therefore, good schedule methods can enhance manufacture system's optimization character and economy benefit. Because of the resource and procedure restriction, so far, the theory of calculate complexity show most schedule problem is belong to nondeterministic polynomial hard problem, and the research of the results involve space commotion explode. At the same time in practical there are diversified dynamic events which can't be expected, so as to workshop schedule is very complexity. So far there is no a currency effective schedule methods.This paper firstly introduces the methods and developments about workshop scheduling inside and outside country; secondly expatiates the basic conception and principle about genetic algorithm; then analyses the flow shop and job shop scheduling problem, also predigests the mathematic depiction so as to convenience further program design.Based on genetic algorithms, an intelligent scheduling optimization of job-shop with multiple process plans is studied. A new scheduling algorithm is proposed, which combines the genetic algorithms with dispatching rules. The dual-flexible-resource constraints (DFRC) scheduling problem is studied. A new scheduling algorithm is proposed. The result has shown that the proposed algorithm is excellent. The predominance of the proposed encoding strategy for DRC is analyzed. The relevant scheduling algorithm is proposed and simulation result shows that the proposed algorithm is feasible.