Some Algorithms for Solving Scheduling Problems in Fuzzy Environment Using CPM

Abstract

In this thesis, the shortcomings and limitations of the existing methods for fi nding the optimal fuzzy project completion time as well as for fi nding minimum fuzzy crashing cost corresponding to specifi c fuzzy project completion time are pointed out. Also, new methods are proposed to overcome the limitations as well as to resolve the shortcomings of the existing methods.