Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
