Jobshop scheduling with imprecise durations: a fuzzy approach

Jobshop scheduling problems are NP-hard problems. The durations in the reality of manufacturing are often imprecise and the imprecision in data is very critical for the scheduling procedures. Therefore, the fuzzy approach, in the framework of the Dempster-Shafer theory, commands attention. The fuzzy numbers are considered as sets of possible probabilistic distributions. After a review of some issues concerning fuzzy numbers, we discuss the determination of a unique optimal solution of the problem and then we cast a meta-heuristic (simulated annealing-SA) to this particular framework for optimization. It should be stressed that the obtained schedule remains feasible for all realizations of the operations durations