Relations between conventional scheduling problems and fuzzy scheduling problems

Abstract

Scheduling problems can be fuzzified by introducing the concept of fuzzy due date; the membership function of a fuzzy due date assigned to each job represents the grade of satisfaction of the decision maker for the completion time of that job. The aim of this paper is to show the relations between the fuzzy scheduling problems and conventional scheduling problems with earliness and tardiness penalties. It is shown that a genetic algorithm can find the optimal solutions of the conventional scheduling problems by solving the fuzzy scheduling problems.