A possibilistic approach to sequencing problems with fuzzy parameters

In this paper a possibilistic approach to sequencing is proposed. For each parameter, whose value is not precisely known, a possibility distribution is given. The objective is to calculate a sequence of jobs, for which the possibility (necessity) of delays of jobs is minimal. Five sequencing problems are formulated and the computational complexity of all of them is explored.