Bicriteria parallel machines scheduling problem with fuzzy due dates based on NSGA-II

A kind of unrelated parallel machines scheduling problem with fuzzy due dates is discussed. The memberships of fuzzy due dates denote the grades of satisfaction of decision-makers with respect to completion times with jobs. Objectives of scheduling are to maximize the minimum grade of satisfaction while makespan is minimized in the meantime. Nondominated Sorting Genetic Algorithm (NSGA-II) is employed to search the Pareto optimal solutions set for above bicriteria scheduling problem. Numerical simulation illustrates that ability of NSGA-II to find and maintain Pareto optimal solutions set in population.