Study On Flexible Job-shop Fuzzy Scheduling Problems Based On Genetic Algorithm

Most researches about FJSS Problems are limited in strict restricted environments in which all kinds of information and restrictions are predefined. However, affected by human, machines and envirmental factors ,the corresponding information such as restrictions and temporal parameters are uncertain and can not be predefined precisely. This dissertation extend FJSS Problem form ideal environment to practical fuzzy environment which are more flexible and practical.The paper, introduce completly the connection of Job-shop scheduling Problem, Flexible Job-shop scheduling Problem and Flexible Job-Shop fuzzy scheduling Problem in the graph view firstly.and the code algorithm is given about those scheduling Problems firstly.This dissertation studies the Total Flexible Job-shop scheduling Problem aiming at minimized makespan which has fuzzy operation time, temporal parameters is donoted by 6-point fuzzy number .Introducing the possible theory, It use the credibility measure to illustrate each sub-problem of this problem and it use genetic algorithm to get perfect scheduling schemes respectively secondly.This dissertation studies the Flexible Job-shop scheduling aiming at minimized E/T penalty which has fuzzy operation time and fuzzy due dates. For this problem, it introduce the degree of possibility of 6-point fuzzy number, and the definition of the degree to which fuzzy number (A|～) is greater than or equal to (B|～) , then an improved genetic algorithm is given to get a perfect scheduling scheme thirdly.Finally, the experimental results and conclusion are given.