Setting due dates to minimize the total weighted possibilistic m...

In this paper, it is investigated how to sequence jobs with fuzzy processing times and<br> predict their due dates on a single machine such that the total weighted possibilistic mean<br> value of the weighted earliness–tardiness costs is minimized. First, an optimal polynomial<br> time algorithm is put forward for the scheduling problem when there are no precedence<br> constraints among jobs. Moreover, it is shown that if general precedence constraints are<br> involved, the probl