GRAPH COLORING PROBLEM IN THE CONTEXT OF SCHEDULE OPTIMIZATION: SOFTWARE SOLUTION Graph Coloring Problem in the Context of Schedule Optimization: Software Solution

Published in Intellectual Technologies on Transport · Pages 32–37 · Rubric: Articles
DOI: https://doi.org/10.24412/2413-2527-2023-335-32-37
Received: 11.01.2025 Accepted: 11.01.2025 Published: 11.01.2025 Language of publication: RUS
This article is dedicated to the analysis of the graph coloring problem, which is relevant in various fields, including scheduling, resource planning and management, among others. During the research, this problem was adapted for optimizing the scheduling of educational activities. The main goal of the study was to create an algorithm and software for developing a user interface for scheduling in educational institutions. The developed software can be easily customized for different types of educational establishments, from schools to universities.
graph, schedule, algorithm, greedy algorithm, graph coloring problem, visual representation, program, Python