Flow shop scheduling with fuzzy due dates using genetic algorithm

This paper discusses flow shop scheduling from the viewpoint of fuzziness. We formulate a fuzzy flow shop scheduling problem based on the concept of fuzzy due dates. The membership function of the fuzzy due date corresponds to the grade of satisfaction of a completion time. The objective function is the sum of the weighted membership function over given jobs. Our problem is to find the sequence that maximizes the objective function. We find the scheduling by using genetic algorithm. An example is employed to illustrate the effectiveness of the algorithm.