Multi-Objective Scheduling with Fuzzy Completion Times

In this paper, we try to explain characteristic of Multi-Objective Scheduling with fuzzycompletion times. With a computer calculation we show a culprit that we can solve it by changing shape of membership function of fuzzy completion time as the satisfaction grade. There also exists some difficulty in minimum satisfaction as a scheduling criterion that approximately for all schedules it is near Zero and by this many of algorithm work inefficient. In final point we suggest a modifying in membership function what it can make the situation much better.

Keywords:

Fuzzy scheduling problem , Fuzzy completion time , Non-dominant set of solutions , Satisfaction grade