Research Article
Citation: T. Pathinathan, J.JesinthaRosline. "Application of Fuzzy Graphs in Scheduling Jobs." International Journal of Computing Algorithm 3.1 (2014): 34-36. |
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.
Keywords Fuzzy graphs, k-fuzzy colouring of graphs, fuzzy chromatic sum of graphs.
- BibTex
- Reference
- XML
- JSON
- Dublin Core
- CSL
@article{App1457933, author = {T. Pathinathan,J.JesinthaRosline}, title = {Application of Fuzzy Graphs in Scheduling Jobs}, journal={International Journal of Computing Algorithm}, volume={3}, issue={1}, issn = {2278-2397}, year = {2014}, publisher = {Scholarly Citation Index Analytics-SCIA}
<?xml version='1.0' encoding='UTF-8'?> <record> <language>eng</language> <journalTitle>International Journal of Computing Algorithm</journalTitle> <eissn>2278-2397 </eissn> <publicationDate>2014</publicationDate> <volume>3</volume> <issue>1</issue> <startPage>34</startPage> <endPage>36</endPage> <documentType>article</documentType> <title language='eng'>Application of Fuzzy Graphs in Scheduling Jobs</title> <authors> <author> <name>T. Pathinathan</name> </author> </authors> <abstract language='eng'>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.</abstract> <fullTextUrl format='pdf'>http://www.hindex.org/2014/p579.pdf</fullTextUrl> <keywords language='eng'> <keyword>Fuzzy graphs, k-fuzzy colouring of graphs, fuzzy chromatic sum of graphs.</keyword> </keywords> </record>
{ "@context":"http://schema.org", "@type":"publication-article","identifier":"http://www.hindex.org/2014/article.php?page=579", "name":"Application of Fuzzy Graphs in Scheduling Jobs", "author":[{"name":"T. Pathinathan "}], "datePublished":"2014", "description":"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.", "keywords":["Fuzzy graphs, k-fuzzy colouring of graphs, fuzzy chromatic sum of graphs."], "schemaVersion":"https://schema.org/version/3.3", "includedInDataCatalog":{ "@type":"DataCatalog", "name":"Scholarly Citation Index Analytics-SCIA", "url":"http://hindex.org"}, "publisher":{"@type":"Organization", "name":"Scientific Communications Research Academy" } }
<?xml version='1.0' encoding='utf-8'?> <oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd"> <dc:contributor>J.JesinthaRosline</dc:contributor> <dc:contributor></dc:contributor> <dc:contributor></dc:contributor> <dc:creator>T. Pathinathan</dc:creator> <dc:date>2014</dc:date> <dc:description>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.</dc:description> <dc:identifier>2014SCIA316F0579</dc:identifier> <dc:language>eng</dc:language> <dc:title>Application of Fuzzy Graphs in Scheduling Jobs</dc:title> <dc:type>publication-article</dc:type> </oai_dc:dc>
{ "identifier": "2014SCIA316F0579", "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.", "author": [ { "family": "T. Pathinathan,J.JesinthaRosline" } ], "id": "579", "issued": { "date-parts": [ [ 2014 ] ] }, "language": "eng", "publisher": "Scholarly Citation Index Analytics-SCIA", "title": " Application of Fuzzy Graphs in Scheduling Jobs", "type": "publication-article", "version": "3" }