Given a graph G = (V; E), a coloring function C assigns an integer value C (i) to each node iā V in such a way that the extremes of any edge {i; j} ā E cannot share the same color this concept of crisp gragh is used in fuzzy to minimize the working time of N jobs in a single machine. In this paper using fuzzy chromatic sum the minimum value for job completion time is calculated.