Two-objective fuzzy job shop scheduling through genetic algorithm

This paper discusses fuzzy job shop scheduling considering the fuzzy proces sing time and the fuzzy duetime, and formulates the fuzzy job shop scheduli ng problem considering two objects, namely, minimization of the maximum fuz zy completion time and maximization of the average agreement index. For eac h of the functions in the formulated two-objective fuzzy job shop schedulin g problem, the fuzzy goal of the decision-maker is specified by a linear me mbership function, and then an approximate solution: method is proposed, wh ere the genetic algorithm is used-for the problem, which integrates the mem bership functions by the fuzzy decision formulated by Bellman and Zadeh. As numerical examples, 6 x 6 and 10 x 10 two-objective fuzzy job shop schedul ing problems are considered. Comparing the results to those by simulated an nealing, the effectiveness of the proposed method is demonstrated. (C) 2000 Scripta Technica.