Abstract

The concept of obtaining fuzzy sum of fuzzy colorings problem has a novel application in scheduling theory. The problem of scheduling N jobs on a single machine and obtaining the minimum value of the job completion times is equivalent to finding the fuzzy chromatic sum of the fuzzy graph modeled for this problem. In the present paper the task scheduling problem is solved by using fuzzy graph.

Full Text
Paper version not known

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