Graph coloring has many applications including task scheduling, parallel computation, frequency allocation, Network design, register allocation etc. Here we concerned about the problem of vertex coloring on scheduling or assigning where these graph coloring provide algorithm to prevent or at least minimize the conflict scheduling. The objective is to provide simple way for solving worker scheduling problem in big industries. To overcome these problems we can schedule the task for workers by applying the concept of vertex coloring of graph theory using GRIN software.
Author(s) Details:
S. Srividhya,
Department of Mathematics, Sathyabama Institute of Science and Technology (Deemed to be University), Chennai- 600 119, India.
Please see the link here: https://stm.bookpi.org/RUMCS-V3/article/view/14037
No comments:
Post a Comment