LPT scheduling on fuzzy tasks with triangular membership functions

We (1998) demonstrated how discrete fuzzy concepts can easily be used in the LPT (longest processing time first) algorithm for managing uncertain scheduling. This paper extends application to the continuous fuzzy domain. The membership functions of the scheduled tasks are assumed to be triangular, and three heuristic fuzzy LPT scheduling methods are proposed to yield scheduling results with polygonal or triangular final completion-time membership functions. Experiments with different numbers of scheduled tasks are also presented to show the effectiveness of the proposed methods