1999 Volume 11 Issue 5 Pages 781-788
In this paper, focusing on job shop scheduling with fuzzy duedate and fuzzy processing time, multiobjective fuzzy job shop scheduling problems are formulated as three-objective ones which not only maxmize the minimum agreement index but also maxmize the average agreement index and minimize the maximum fuzzy completing time. Having elicited the linear membership functions for the fuzzy goals of the decision maker, we adopt the fuzzy decision of Bellman and Zadeh. Then genetic algorithms which are suitable for solving the formulated problems are proposed. As illustrative numerical examples, both 6×6 and 10×10 three-objective job shop scheduling problems with fuzzy duedate and fuzzy processing time are considered, and the feasibility and effectiveness of the proposed method are demonstrated.
