Single machine scheduling problem with fuzzy due date and processing time

Abstract This paper considers a single machine scheduling problem with fuzzy due date and fuzzy processing time. There are n jobs J 1, J 2, …, Jn to be processed on a single machine. Associated with each job Jj , there is a membership function of due date which describes the degree of satisfaction with respect to the completion time of Jj . The due date is structured similar to a trapezoidal fuzzy set, and the processing time is described as a triangular fuzzy set. The objective is to maximize the minimum grade of satisfaction over given jobs. In this paper, polynomial‐time algorithms with O(n2 logG) are proposed to solve the scheduling problem and are illustrated by means of an example.