A Memetic Approach to Fuzzy Job Shop Based on Expectation Model

In the sequel we consider a job shop problem with uncertain processing times modelled using triangular fuzzy numbers. A scheduling model based on the expected value of the makespan is introduced. Later, a genetic algorithm based on codification of permutations with repetitions, a decoding algorithm to generate possibly active schedules and a local search schema are defined in order to solve the job shop problem. Experimental results illustrate the potential of the proposed methods.