Abstract
Circular coloring is a popular branch of graph theory which has been exhaustively studied for two decades mainly from a theoretical perspective. Since it is a refinement of the traditional proper coloring, it provides a more accurate model for cyclic scheduling problems which often arise in industrial applications. The present paper briefly surveys a special class of open shop scheduling that can be solved via circular coloring, and then proposes a new mathematical programming model and tabu search algorithm to compute the circular chromatic number of a graph effectively.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
