Possible optimality of solutions in a single machine scheduling problem with fuzzy parameters

A single machine scheduling problem with parameters given in the form of fuzzy numbers is considered. It is assumed that the optimal schedule in such a problem cannot be determined precisely (since the parameters are not known a priori). In the paper the concept of degree of possible optimality of a given schedule is introduced. An algorithm of calculating the degree of o p timality in the general case is presented and then it is applied to two particular cases of the problem.